Sciweavers

Share
NIPS
1994

Convergence Properties of the K-Means Algorithms

8 years 11 months ago
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 algorithmor by slightly extending the mathematics of the EM algorithm to this hard threshold case. We show that the K-Means algorithmactually minimizes the quantization error using the very fast Newton algorithm.
Léon Bottou, Yoshua Bengio
Added 02 Nov 2010
Updated 02 Nov 2010
Type Conference
Year 1994
Where NIPS
Authors Léon Bottou, Yoshua Bengio
Comments (0)
books