Abstract
We give a unifying description of several least squares clustering methods. We consider the K-means/Lloyd's algorithm, various local search based methods and clustering techniques based on neural networks. The relations between the various algorithms are explained. Also some computational results of these algorithms are given.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Aarts, E. H. L. and Lenstra, J. K.: Local Search in Combinatorial Optimization, Wiley-Interscience, 1997.
Brucker, P.: On the complexity of clustering problems, in Lecture Notes in Economics and Mathematical Systems, Springer, 1978, pp. 45–54.
Glover, F.: Future paths for integer programming and links to artificial intelligence, Comput. Oper. Res. 13 (1986), 533–549.
Hassoun, M. H.: Fundamentals of Artificial Neural Networks, MIT Press, Cambridge, MA, 1995.
Hertz, J. A., Krogh, A. S. and Palmer, R. G.: Introduction to the Theory of Neural Computation, Addison-Wesley, Reading, MA, 1991.
Jain, A. K. and Dubes, R. C.: Algorithms for Clustering Data, Prentice-Hall, 1988.
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silvermann, R. and Wu, A. Y.: A local search approximation algorithm for k-means clustering, in Proceedings of the Eighteenth Annual Symposium on Computational Geometry, ACM Press, New York, June 2002, pp. 10–18.
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silvermann, R. and Wu, A. Y.: An efficient k-means clustering algorithm: Analysis and implementation, IEEE Trans. Pattern Anal. Machine Intell. 24 (July 2002), 881–892.
Kirkpatrick, S., Gelatt, C. D. and Vecchii, M. P.: Optimization by simulated annealing, Science 220 (1983), 671–680.
Lloyd, S. P.: Least squares quantization in PCM, IEEE Trans. Inform. Theory 28 (1982), 129–137.
MacQueen, J.: Some methods for classification and analysis of multivariate observations, in Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1, 1967, pp. 281–296.
Rumelhart, D. E. and McClelland, J. L.: Parallel Distributed Processing, MIT, 1986.
Ward, J., Jr.: Hierarchical grouping to optimize an objective function, J. Amer. Statist. Assoc. 58 (1963), 236–244.
Zhang, B., Kleyner, G. and Hsu, M.: A local search approach to K-clustering, HP Labs Technical Report HPL-1999-119, 1999
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
ten Eikelder, H.M.M., van Erk, A.A. Unification of some Least Squares Clustering Methods. Journal of Mathematical Modelling and Algorithms 3, 105–122 (2004). https://doi.org/10.1023/B:JMMA.0000036581.87064.ed
Issue Date:
DOI: https://doi.org/10.1023/B:JMMA.0000036581.87064.ed