Convergence Properties of the K-Means Algorithms

Bottou, Léon, Bengio, Yoshua

Neural Information Processing Systems 

K-Means is a popular clustering algorithm used in many applications, including the initialization of more computationally expensive algorithms (Gaussian mixtures, Radial Basis Functions, Learning Vector Quantization and some Hidden Markov Models). The practice of this initialization procedure often gives the frustrating feeling that K-Means performs most of the task in a small fraction of the overall time. This motivated us to better understand this convergence speed. A second reason lies in the traditional debate between hard threshold (e.g.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found