Distributed data clustering over networks

•Clustering on multiple sources of distributed data.•Non-convex optimization in multi-agent networks with time-varying connectivity;•Leveraging dynamic consensus for diffuse information in the network.•Consensus-based Expectation-Maximization applied to Gaussian mixture models. [Display omitted] In...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Pattern recognition Jg. 93; S. 603 - 620
Hauptverfasser: Altilio, Rosa, Di Lorenzo, Paolo, Panella, Massimo
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 01.09.2019
Schlagworte:
Clustering
Distributed learning
Expectation maximization
Gaussian mixtures
Non-Convex optimization
Expectation maximization
Non-Convex optimization
Distributed learning
Clustering
Gaussian mixtures
ISSN:0031-3203, 1873-5142
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•Clustering on multiple sources of distributed data.•Non-convex optimization in multi-agent networks with time-varying connectivity;•Leveraging dynamic consensus for diffuse information in the network.•Consensus-based Expectation-Maximization applied to Gaussian mixture models. [Display omitted] In this paper, we consider the problem of distributed unsupervised clustering, where training data is partitioned over a set of agents, whose interaction happens over a sparse, but connected, communication network. To solve this problem, we recast the well known Expectation Maximization method in a distributed setting, exploiting a recently proposed algorithmic framework for in-network non-convex optimization. The resulting algorithm, termed as Expectation Maximization Consensus, exploits successive local convexifications to split the computation among agents, while hinging on dynamic consensus to diffuse information over the network in real-time. Convergence to local solutions of the distributed clustering problem is then established. Experimental results on well-known datasets illustrate that the proposed method performs better than other distributed Expectation-Maximization clustering approaches, while the method is faster than a centralized Expectation-Maximization procedure and achieves a comparable performance in terms of cluster validity indexes. The latter ones achieve good values in absolute range scales and prove the quality of the obtained clustering results, which compare favorably with other methods in the literature.
ISSN:0031-3203
1873-5142
DOI:10.1016/j.patcog.2019.04.021