Alternatives to the k-means algorithm that find better clusterings

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2002, Pages 600-607

  Hamerly, Greg ^a   Elkan, Charles ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; IMAGE SEGMENTATION; LEARNING SYSTEMS; OPTIMIZATION; PATTERN RECOGNITION;

CLUSTERING ALGORITHM; DATA CLUSTERING; DATA WEIGHT FUNCTIONS; DATASETS;

DATA MINING;

EID: 0038156173     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/584792.584890     Document Type: Conference Paper

References (23)

1. J. C. Bezdek. Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, New York, 1981.
2. C. M. Bishop. Neural Networks for Pattern Recognition. Clarendon Press, Oxford, 1995.
3. P. S. Bradley and U. M. Fayyad. Refining initial points for K-Means clustering. In Proc. 15th International Conf. on Machine Learning, pages 91-99. Morgan Kaufmann, San Francisco, CA, 1998.
4. D. Comaniciu and P. Meer. Mean shift: a robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001.
5. S. Dasgupta. Experiments with random projection. In Uncertainty in Artificial Intelligence: Proceedings of the Sixteenth Conference (UAI-2000), pages 143-151, San Franciso, CA, 2000. Morgan Kaufmann Publishers.
6. Drineas, Frieze, Kannan, Vempala, and Vinay. Clustering in large graphs and matrices. In SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1999.
7. Y. Freund and R. Schapire. A short introduction to boosting. Japanese Society for Artificial Intelligence, 14:771-780, 1999.
8. A. Kalton, P. Langley, K. Wagstaff, and J. Yoo. Generalized clustering, supervised learning, and data assignment. In Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining, pages 299-304, San Francisco, 2001. ACM Press.
9. M. Kearns, Y. Mansour, and A. Y. Ng. An information-theoretic analysis of hard and soft assignment methods for clustering. In Proceedings of Uncertainty in Artificial Intelligence, pages 282-293, AAAI, 1997.
10. A. Likas, N. Vlassis, and J. Verbeek. The global k-means clustering algorithm. Technical report, Computer Science Institute, University of Amsterdam, The Netherlands, February 2001. IAS-UVA-01-02.
11. J. MacQueen. Some methods for classification and analysis of multivariate observations. In L. M. LeCam and J. Neyman, editors, Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, volume 1, pages 281-297, Berkeley, CA, 1967. University of California Press.
12. M. Meǐla and D. Heckerman. An experimental comparison of model-based clustering methods. Machine learning, 42:9-29, 2001.
13. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. Neural Information Processing Systems, 14, 2002.
14. D. Pelleg and A. Moore. Accelerating exact k-means algorithms with geometric reasoning. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 277-281. AAAI Press, 1999.
15. D. Pelleg and A. Moore. X-means: Extending K-means with efficient estimation of the number of clusters. In Proceedings of the 17th International Conf. on Machine Learning, pages 727-734. Morgan Kaufmann, San Francisco, CA, 2000.
16. J. Peña, J. Lozano, and P. Larrañaga. An empirical comparison of four initialization methods for the k-means algorithm. Pattern recognition letters, 20:1027-1040, 1999.
17. P. Sand and A. Moore. Repairing faulty mixture models using density estimation. In Proceedings of the 18th International Conf. on Machine Learning. Morgan Kaufmann, San Francisco, CA, 2001.
18. P. Sand and A. Moore. Fastmix clustering software, 2002. http://www.cs.cmu.edu/-psand/.
19. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
20. L. Zadeh. Fuzzy sets. Information and Control, 8:338-353, 1965.
21. B. Zhang. Generalized k-harmonic means - boosting in unsupervised learning. Technical Report HPL-2000-137, Hewlett-Packard Labs, 2000.
22. B. Zhang, M. Hsu, and U. Dayal. K-harmonic means - a data clustering algorithm. Technical Report HPL-1999-124, Hewlett-Packard Labs, 1999.
23. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: a new data clustering algorithm and its applications. volume 1, pages 141-182, 1997.