Clustering with Distributed Data

Abstract

We consider $K$-means clustering in networked environments (e.g., internet of things (IoT) and sensor networks) where data is inherently distributed across nodes and processing power at each node may be limited. We consider a clustering algorithm referred to as networked $K$-means, or $NK$-means, which relies only on local neighborhood information exchange. Information exchange is limited to low-dimensional statistics and not raw data at the agents. The proposed approach develops a parametric family of multi-agent clustering objectives (parameterized by $\rho$) and associated distributed $NK$-means algorithms (also parameterized by $\rho$). The $NK$-means algorithm with parameter $\rho$ converges to a set of fixed points relative to the associated multi-agent objective (designated as `generalized minima'). By appropriate choice of $\rho$, the set of generalized minima may be brought arbitrarily close to the set of Lloyd's minima. Thus, the $NK$-means algorithm may be used to compute Lloyd's minima of the collective dataset up to arbitrary accuracy.

References in corpus (8)

• Communication-Efficient Learning of Deep Networks from Decentralized Data
• Parallel and Distributed Methods for Nonconvex Optimization--Part II: Applications
• $QD$-Learning: A Collaborative Distributed Strategy for Multi-Agent Reinforcement Learning Through Consensus + Innovations
• D${}^2$: Decentralized Training over Decentralized Data
• Distributed k-Means and k-Median Clustering on General Topologies
• Adding vs. Averaging in Distributed Primal-Dual Optimization
• Distributed k-means algorithm
• Partitioning Data on Features or Samples in Communication-Efficient Distributed Optimization?