# Clustering with Distributed Data

arXiv: https://arxiv.org/abs/1901.00214 · HTML: https://mlsanity.com/paper/1901.00214/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 1 Jan 2019.

## Built on by (most cited first, 3 of 3)

- [Gradient Based Clustering](https://mlsanity.com/paper/2202.00720/) (2022)
- [A Unified Framework for Center-based Clustering of Distributed Data](https://mlsanity.com/paper/2402.01302/) (2024)
- [Distributed Gradient Clustering: Convergence and the Effect of Initialization](https://mlsanity.com/paper/2603.20507/) (2026)

## Abstract (arXiv)

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 ρ) and associated distributed NK-means algorithms (also parameterized by ρ). The NK-means algorithm with parameter ρ converges to a set of fixed points relative to the associated multi-agent objective (designated as `generalized minima'). By appropriate choice of ρ, 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.