Fast adaptive k-means clustering: some empirical results
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 233-238 vol.2
- https://doi.org/10.1109/ijcnn.1990.137720
Abstract
The authors present learning rate schedules for fast adaptive k-means clustering which surpass the standard MacQueen learning rate schedule (J. MacQeen, 1967) in speed and quality of solution by several orders of magnitude for large k. The methods accomplish this by largely overcoming the problems of metastable local minima and nonstationarity of cluster region boundaries which plague the MacQueen approach. The authors use simulation results to compare the clustering performances of four learning rate schedules applied to independently sampled data from a uniform distribution in one and two dimensionsKeywords
This publication has 5 references indexed in Scilit:
- Dynamics of lateral interaction networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Fast Learning in Networks of Locally-Tuned Processing UnitsNeural Computation, 1989
- Self-Organization and Associative MemoryPublished by Springer Nature ,1988
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- A Stochastic Approximation MethodThe Annals of Mathematical Statistics, 1951