Fast Distributed k-Means with a Small Number of Rounds

1 code implementation • 31 Jan 2022 • Tom Hess, Ron Visbord, Sivan Sabato

Our algorithm guarantees a cost approximation factor and a number of communication rounds that depend only on the computational capacity of the coordinator.

Clustering