Decentralized Clustering and Linking by Networked Agents

by   Sahar Khawatmi, et al.

We consider the problem of decentralized clustering and estimation over multi-task networks, where agents infer and track different models of interest. The agents do not know beforehand which model is generating their own data. They also do not know which agents in their neighborhood belong to the same cluster. We propose a decentralized clustering algorithm aimed at identifying and forming clusters of agents of similar objectives, and at guiding cooperation to enhance the inference performance. One key feature of the proposed technique is the integration of the learning and clustering tasks into a single strategy. We analyze the performance of the procedure and show that the error probabilities of types I and II decay exponentially to zero with the step-size parameter. While links between agents following different objectives are ignored in the clustering process, we nevertheless show how to exploit these links to relay critical information across the network for enhanced performance. Simulation results illustrate the performance of the proposed method in comparison to other useful techniques.


page 1

page 2

page 3

page 4


Distributed Clustering and Learning Over Networks

Distributed processing over networks relies on in-network processing and...

Decentralized Decision-Making Over Multi-Task Networks

In important applications involving multi-task networks with multiple ob...

Decentralized Clustering on Compressed Data without Prior Knowledge of the Number of Clusters

In sensor networks, it is not always practical to set up a fusion center...

Semi-Supervised Information-Maximization Clustering

Semi-supervised clustering aims to introduce prior knowledge in the deci...

Multi-Task Learning Regression via Convex Clustering

Multi-task learning (MTL) is a methodology that aims to improve the gene...

A clustering method for misaligned curves

We consider the problem of clustering misaligned curves. According to ou...

Universal Randomized Guessing with Application to Asynchronous Decentralized Brute-Force Attacks

Consider the problem of guessing the realization of a random vector X by...

Please sign up or login with your details

Forgot password? Click here to reset