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

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 39, Issue 2, 2009, Pages 318-331

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

^a RUTGERS UNIVERSITY   (United States)

^b BEIHANG UNIVERSITY   (China)

^c Tsinghua University   (China)

Author keywords

Clustering validation; Coefficient of variation (CV); Entropy; F measure; K means clustering

Indexed keywords

CLUSTER DISTRIBUTIONS; CLUSTER SIZES; CLUSTERING RESULTS; CLUSTERING VALIDATION; COEFFICIENT OF VARIATION (CV); DATA DISTRIBUTIONS; DATA SETS; ENTROPY MEASURES; F-MEASURE; INPUT DATUM; K-MEANS; K-MEANS CLUSTERING; K-MEANS CLUSTERING ALGORITHMS; KEY FEATURES; MISLEADING INFORMATIONS; PARTITIONAL CLUSTERING; RESEARCH EFFORTS; SKEWED DATUM; SMALL VARIATIONS; UNIFORM SIZES;

CLUSTER ANALYSIS; ENTROPY; WATER SUPPLY SYSTEMS;

CLUSTERING ALGORITHMS;

EID: 64049085167     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2008.2004559     Document Type: Article

References (45)

1. H. Xiong, J. Wu, and J. Chen, "K-means clustering versus validation measures: A data distribution perspective," in Proc. 12th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2006, pp. 779-784.
2. A. Jain and R. Dubes, Algorithms for Clustering Data. Englewood Cliffs, NJ: Prentice-Hall, 1998.
3. J. MacQueen, "Some methods for classification and analysis of multivariate observations," in Proc. 5th Berkeley Symp. Math. Stat. Probab., L. M. L. Cam and J. Neyman, Eds. Berkeley, CA: Univ. California Press, 1967, vol. I.
4. P.-N. Tan, M. Steinbach, and V. Kumar, Introduction to Data Mining Reading, MA: Addison-Wesley, 2005.
5. K. Krishna and M. Narasimha Murty, "Genetic K-means algorithm," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 29, no. 3, pp. 433-439, Jun. 1999.
6. M. Steinbach, G. Karypis, and V. Kumar, "A comparison of document clustering techniques," in Proc. Workshop Text Mining, 6th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, Aug. 2000, pp. 20-23.
7. Y. Zhao and G. Karypis, "Criterion functions for document clustering: Experiments and analysis," Mach. Learn., vol. 55, no. 3, pp. 311-331, Jun. 2004.
8. M. DeGroot and M. Schervish, Probability and Statistics, 3rd ed. Reading, MA: Addison-Wesley, 2001.
9. D. Barbará and P. Chen, "Using self-similarity to cluster large data sets," Data Mining Knowl. Discov., vol. 7, no. 2, pp. 123-152, Apr. 2003.
10. D. Barbará, Y. Li, and J. Couto, "Coolcat: An entropy-based algorithm for categorical clustering," in Proc. 11th ACM Int. Conf. Inf. Knowl. Manag., 2002, pp. 582-589.
11. Y. Chen, Y. Zhang, and X. Ji, "Size regularized cut for data clustering," in Proc. NIPS, 2005, pp. 211-218.
12. I. Jonyer, D. J. Cook, and L. B. Holder, "Graph-based hierarchical conceptual clustering," J. Mach. Learn. Res., vol. 2, no. 2, pp. 19-43, 2001.
13. J. Li, D. Tao, W. Hu, and X. Li, "Kernel principle component analysis in pixels clustering," in Proc. Web Intell., 2005, pp. 786-789.
14. W. Li, W. K. Ng, Y. Liu, and K.-L. Ong, "Enhancing the effectiveness of clustering with spectra analysis," IEEE Trans. Knowl. Data Eng., vol. 19, no. 7, pp. 887-902, Jul. 2007.
15. M. Halkidi, Y. Batistakis, and M. Vazirgiannis, "Cluster validity methods: Part I," SIGMOD Rec., vol. 31, no. 2, pp. 40-45, 2002.
16. C. J. V. Rijsbergen, Information Retrieval, 2nd ed. London, U.K.: Butterworths, 1979.
17. B. Larsen and C. Aone, "Fast and effective text mining using linear-time document clustering," in Proc. 5th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, Aug. 1999, pp. 16-22.
18. A. Ozgur, E. Alpaydm, Unsupervised Machine Learning Techniques for Text Document Clustering, Apr. 2004. [Online]. Available: www. cmpe.boun.edu.tr/pilab/MLmaterial/ozgur04unsupervised.pdf
19. G. Karypis, Cluto: Software for clustering high-dimensional datasets 2006. version 2.1.1. [Online]. Available: http://glaros.dtc.umn.edu/gkhome/views/cluto
20. TREC, Text Retrieval Conference, 1996. [Online]. Available: http://trec.nist.gov
21. W. Hersh, C. Buckley, T. J. Leone, and D. Hickam, "Ohsumed: An interactive retrieval evaluation and new large test collection for research," in Proc. 17th Annu. Int. ACM SIGIR Conf. Res. Develop. Inf. Retr., Jul. 1994, pp. 192-201.
22. D. Lewis, Reuters-21578 Text Categorization Text Collection 1.0, 2004. [Online]. Available: http://www.research.att.com/lewis
23. 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. 2nd Int. Conf. Auton. Agents, 1998, pp. 408-415.
24. M. F. Porter, "An algorithm for suffix stripping," Program, vol. 14, no. 3, pp. 130-137, Jul. 1980.
25. A. Bhattacharjee et al., "Classification of human lung carcinomas by mrna expression profiling reveals distinct adenocarcinoma subclasses," Proc. Natl. Acad. Sci. U. S. A., vol. 98, no. 24, pp. 13 790-13 795, Nov. 2001.
26. E.-J. Yeoh et al., "Classification, subtype discovery, and prediction of outcome in pediatric acute lymphoblastic leukemia by gene expression profiling," Cancer Cell, vol. 1, no. 2, pp. 133-143, Mar. 2002.
27. J. Li, and H. Liu, Kent Ridge Biomedical Data Set Repository. [Online]. Available: http://sdmc.i2r.a-star.edu.sg/rp/
28. D. Newman, S. Hettich, C. Blake, and C. Merz, UCI Repository of Machine Learning Databases, 1998. [Online]. Available: http://www. ics.uci.edu/_mlearn/MLRepository.html
29. I. Borg and P. Groenen, Modern Multidimensional Scaling - Theory and Applications. Berlin, Germany: Springer-Verlag, Feb. 1997.
30. I. Jolliffe, Principal Component Analysis, 2nd ed. Berlin, Germany: Springer-Verlag, Oct. 2002.
31. J. Demmel, Applied Numerical Linear Algebra. Philadelphia, PA: SIAM, Sep. 1997.
32. B. Tang, M. Shepherd, M. I. Heywood, and X. Luo, "Comparing dimension reduction techniques for document clustering," in Proc. Can. Conf. AI, 2005, pp. 292-296.
33. R. Jarvis and E. Patrick, "Clustering using a similarity measure based on shared near neighbors," IEEE Trans. Comput., vol. C-22, no. 11, pp. 1025-1034, Nov. 1973.
34. S. Guha, R. Rastogi, and K. Shim, "Cure: An efficient clustering algorithm for large databases," in Proc. ACM SIGMOD Int. Conf. Manag. Data, Jun. 1998, pp. 73-84.
35. E. Knorr, R. Ng, and V. Tucakov, "Distance-based outliers: Algorithms and applications," VLDB J., vol. 8, no. 3/4, pp. 237-253, Feb. 2000.
36. J.-S. Zhang and Y.-W. Leung, "Robust clustering by pruning outliers," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 33, no. 6, pp. 983-998, Dec. 2003.
37. A. Zhou, F. Cao, Y. Yan, C. Sha, and X. He, "Distributed data stream clustering: A fast EM-based approach," in Proc. 23rd Int. Conf. Data Eng., 2007, pp. 736-745.
38. M. Breunig, H.-P. Kriegel, R. Ng, and J. Sander, "LOF: Identifying density based local outliers," in Proc. ACM SIGMOD Int. Conf. Manag. Data, 2000, pp. 427-438.
39. L. Portnoy, E. Eskin, and S. Stolfo, "Intrusion detection with unlabeled data using clustering," in Proc. ACM CSS Workshop DMSA, 2001, pp. 5-8.
40. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, "A density-based algorithm for discovering clusters in large spatial databases with noise," in Proc. 2th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, Aug. 1996, pp. 226-231.
41. L. Ertoz, M. Steinbach, and V. Kumar, "A new shared nearest neighbor clustering algorithm and its applications," in Proc. Workshop Clustering High Dimensional Data Appl., 2002, pp. 105-115.
42. P. Bradley, U. Fayyad, and C. Reina, "Scaling clustering algorithms to large databases," in Proc. 4th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, Aug. 1998, pp. 9-15.
43. F. Murtagh, Clustering Massive Data Sets, Handbook of Massive Data Sets. Norwell, MA: Kluwer, 2000.
44. T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: An efficient data clustering method for very large databases," in Proc. ACM SIGMOD Int. Conf. Manag. Data, Jun. 1996, pp. 103-114.
45. J. Bezdek and N. Pal, "Some new indexes of cluster validity," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 28, no. 3, pp. 427-436, Jun. 1998.