Distributed k-mean algorithm for data clustering

摘要

Clustering is a useful technique for data mining among large amount of data. The k-mean algorithm is a popular algorithm for data clustering. In this article, we derive a distributed version of the k-mean algorithm for clustering data sets distributed in different locations. The distributed k-mean algorithm can be applied to distributed databases without the need of copying data to a central location as required by original version of the algorithm.