论文信息 - Convergence Properties of the K-Means Algorithms

Convergence Properties of the K-Means Algorithms

This paper studies the convergence properties of the well known K-Means clustering algorithm. The K-Means algorithm can be described either as a gradient descent algorithm or by slightly extending the mathematics of the EM algorithm to this hard threshold case. We show that the K-Means algorithm actually minimizes the quantization error using the very fast Newton algorithm.

Yoshua Bengio | Léon Bottou | Yoshua Bengio | L. Bottou

[1] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .

[2] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[3] Teuvo Kohonen,et al. Self-Organization and Associative Memory , 1988 .

[4] Teuvo Kohonen,et al. Self-organization and associative memory: 3rd edition , 1989 .

[5] John E. Moody,et al. Note on Learning Rate Schedules for Stochastic Optimization , 1990, NIPS.

[6] Steven J. Nowlan,et al. Soft competitive adaptation: neural network learning algorithms based on fitting statistical mixtures , 1991 .

[7] Yoshua Bengio,et al. Artificial neural networks and their application to sequence recognition , 1991 .

[8] C. Leake. Synchronization and Linearity: An Algebra for Discrete Event Systems , 1994 .

[9] Xavier Driancourt. Optimisation par descente de gradient stochastique de systemes modulaires combinant reseaux de neurones et programmation dynamique. Application a la reconnaissance de la parole , 1994 .