Distributed Clustering and Learning Over Networks

From MaRDI portal
Publication:4580644

DOI10.1109/TSP.2015.2415755zbMATH Open1394.94696arXiv1409.6111OpenAlexW2159585070MaRDI QIDQ4580644FDOQ4580644

Ali H. Sayed, Xiaochuan Zhao

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: Distributed processing over networks relies on in-network processing and cooperation among neighboring agents. Cooperation is beneficial when agents share a common objective. However, in many applications agents may belong to different clusters that pursue different objectives. Then, indiscriminate cooperation will lead to undesired results. In this work, we propose an adaptive clustering and learning scheme that allows agents to learn which neighbors they should cooperate with and which other neighbors they should ignore. In doing so, the resulting algorithm enables the agents to identify their clusters and to attain improved learning and estimation accuracy over networks. We carry out a detailed mean-square analysis and assess the error probabilities of Types I and II, i.e., false alarm and mis-detection, for the clustering mechanism. Among other results, we establish that these probabilities decay exponentially with the step-sizes so that the probability of correct clustering can be made arbitrarily close to one.


Full work available at URL: https://arxiv.org/abs/1409.6111






Cited In (6)






This page was built for publication: Distributed Clustering and Learning Over Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580644)