Distributed k-means algorithm

no code implementations • 15 Dec 2013 • Gabriele Oliva, Roberto Setola, Christoforos N. Hadjicostis

Since the partitions may not have a relation with the topology of the network--members of the same clusters may not be spatially close--the algorithm is provided with a mechanism to compute the clusters'centroids even when the clusters are disconnected in several sub-clusters. The results of the proposed distributed algorithm coincide, in terms of minimization of the objective function, with the centralized k-means algorithm.

Clustering Position