Space Partitioning for Scalable K-Means

@article{Pettinger2010SpacePF,
  title={Space Partitioning for Scalable K-Means},
  author={David Pettinger and Giuseppe Di Fatta},
  journal={2010 Ninth International Conference on Machine Learning and Applications},
  year={2010},
  pages={319-324}
}
K-Means is a popular clustering algorithm which adopts an iterative refinement procedure to determine data partitions and to compute their associated centres of mass, called centroids. The straightforward implementation of the algorithm is often referred to as ‘brute force’ since it computes a proximity measure from each data point to each centroid at every iteration of the K-Means process. Efficient implementations of the K-Means algorithm have been predominantly based on multi-dimensional… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS