On the lower bound of local optimums in k-means algorithm

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 775-784

  Zhang, Zhenjie ^a   Dai, Bing Tian ^a   Tung, Anthony K H ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL OPTIMAL SOLUTION; K-MEANS ALGORITHM; TIME CONSUMPTION;

ALGORITHMS; DATA MINING; GLOBAL OPTIMIZATION; INFORMATION RETRIEVAL; ITERATIVE METHODS; LEARNING SYSTEMS;

COMPUTER SCIENCE;

EID: 56449089516     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.118     Document Type: Conference Paper

References (16)

1. D. Arthur and S. Vassilvitskii. How slow is the k-means method? In SoCG, pages 144-153, 2006.
2. L. Bottou and Y. Bengio. Convergence properties of the K-means algorithms. In NIPS, pages 585-592, 1995.
3. P S. Bradley and U. M. Fayyad. Refining initial points for K-Means clustering. In ICML, pages 91-99, 1998.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms 2nd version. The MIT Press, 2001.
5. C. H. Q. Ding and X. He. K-means clustering via principal component analysis. In ICML, 2004.
6. C. Elkan. Using the triangle inequality to accelerate k-means. In ICML, pages 147-153, 2003.
7. J. Han and M. Kamber. Data Mining: Concept and Techniques. Academic Press, 2000.
8. S. Har-Peled and B. Sadri. How fast is the k-means method? In SODA, pages 877-885, 2005.
9. M. Inaba, N. Katoh, and H. Imai. Applications of weighted voronoi diagrams and randomization to variance-based - clustering (extended abstract). In Symposium on Computational Geometry, pages 332-339, 1994.
10. T. Kanungo, D. Mount, N. Netanyahu, C. Piatko, R. Silverman, and A. Wu. An efficient k-means clustering algorithm: analysis and implementation, 2002.
11. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu. A local search approximation algorithm for k-means clustering. Comput. Geom., 28(2-3):89-112, 2004.
12. A. Kumar, Y. Sabharwal, and S. Sen. A simple linear time (1+ε)-approximation algorithm for k-means clustering in any dimensions. In FOCS, pages 454-462, 2004.
13. S. Lloyd. Least squares quantization in pcm. IEEE Transactions on Information Theory, 28:129-137.
14. M. Meila and D. Heckerman. An experimental comparison of several clustering and initialization methods, 1998.
15. D. Pelleg and A. Moore. Accelerating exact k -means algorithms with geometric reasoning. In Knowledge Discovery and Data Mining, pages 277-281, 1999.
16. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In SIGMOD Conference, pages 103-114, 1996.