K-means clustering versus validation measures: A data distribution perspective

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn 2006, Issue , 2006, Pages 779-784

  Xiong, Hui ^a   Wu, Junjie ^b   Chen, Jian ^b  

^a RUTGERS UNIVERSITY   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Coefficient of Variation (CV); Entropy; K means Clustering

Indexed keywords

CLUSTERING ALGORITHMS; COEFFICIENT OF VARIATION (CV); K-MEANS CLUSTERING;

ALGORITHMS; APPROXIMATION THEORY; ENTROPY; PROBLEM SOLVING;

DATA MINING;

EID: 33749563831     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. P. Bradley, U. Fayyad, and C. Reina. Scaling clustering algorithms to large databases. In KDD, pages 9-15, 1998.
2. M. DeGroot and M. Schervish. Probability and Statistics. Addison Wesley; 3rd edition, 2001.
3. L. Ertoz, M. Steinbach, and V. Kumar. A new shared nearest neighbor clustering algorithm and its applications. In SDM Workshop on Clustering High Dimensional Data and its Applications, 2001.
4. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD, pages 226-231, 1996.
5. J. Ghosh. Scalable Clustering Methods for Data Mining, Handbook of Data Mining. Lawrence Ealbaum Assoc, 2003.
6. S. Guha, R. Rastogi, and K. Shim. Cure: An efficient clustering algorithm for large databases. In ACM SIGMOD, pages 73-84, 1998.
7. E.-H. Han, D. Boley, M. Gini, R. Gross, K. Hastings, G. Karypis, V. Kumar, B. Mobasher, and J. Moore. Webace: A web agent for document categorization and exploration. In Proc. of the 2nd Intl. Conf. on Autonomous Agents, 1998.
8. W. Hersh, C. Buckley, T. J. Leone, and D. Hickam. Ohsumed: An interactive retrieval evaluation and new large test collection for research. In SIGIR, pages 192-201, 1994.
9. A. Jain and R. Dubes. Algorithms for Clustering Data. Prentice Hall, 1998.
10. R. Jarvis and E. Patrick. Clusering using a similarity measure based on shared nearest neighbors. IEEE Trans. on Computers, C-22(11):1025-1034, 1973.
11. G. Karypis. In http://www-users.cs.umn.edu/karypis/cluto/.
12. G. Karypis, E.-H. Han, and V. Kumar. Chameleon: A hierarchical clustering algorithm using dynamic modeling. IEEE Computer, 32(8):68-75, August 1999.
13. D. Lewis. Reuters-21578 text categorization text collection 1.0. In http://www.research.att.com/lewis.
14. J. Li and H. Liu. In http://sdmc.i2r.a-star.edu.sg/rp/.
15. J. MacQueen. Some methods for classification and analysis of multivariate observations. In L. M. L. Cam and J. Neyman, editors, Proc. of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Volume I, Statistics. University of California Press, September 1967.
16. F. Murtagh. Clustering Massive Data Sets, Handbook of Massive Data Sets. Kluwer, 2000.
17. D. Newman, S. Hettich, C. Blake, and C. Merz. Uci repository of machine learning databases, 1998.
18. M. F. Porter. An algorithm for suffix stripping. In Program, 14(3), 1980.
19. M. Steinbach, G. Karypis, and V. Kumar. A comparison of document clustering techniques. In KDD Workshop on Text Mining, August 2000.
20. P.-N. Tan, M. Steinbach, and V. Kumar. Introduction to Data Mining. Addison-Wesley, 2005.
21. TREC. In http://trec.nist.gov.
22. Y. Zhao and G. Karypis. Criterion functions for document clustering: Experiments and analysis. Machine Learning, 55(3):Pages: 311-331, June 2004.