A new MCA-based divisive hierarchical algorithm for clusteing categorical data

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2009, Pages 1058-1063

  Xiong, Tengke ^a   Wang, Shengrui ^a   Mayers, André ^a   Monga, Ernest ^a  

^a UNIVERSITÉ DE SHERBROOKE   (Canada)

Author keywords

Categorical data; Clustering; Divisive hierarchical; MCA

Indexed keywords

CATEGORICAL DATA; CATEGORICAL DATA CLUSTERING; DATA REPRESENTATIONS; DENDROGRAMS; DISTANCE MEASURE; DIVISIVE HIERARCHICAL CLUSTERING; HIERARCHICAL ALGORITHM; LARGE DATASETS; MULTIPLE CORRESPONDENCE ANALYSIS; NUMBER OF CLUSTERS; SIMILARITY MEASURE; SYNTHETIC AND REAL DATA;

CLUSTER ANALYSIS; MAGNETIC LOGIC DEVICES;

CLUSTERING ALGORITHMS;

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

References (25)

1. Data Generator. http://www.datasetgenerator.com/.
2. H. Abdi and D. Valentin, "Multiple correspondence analysis," in Encyclopedia of Measurement and Statistics, N.J. Saltkind, Thousand Oaks, 2007.
3. P. Andritsos, P. Tsaparas, R.J. Miller and K.C. Sevcik, "LIMBO: scalable clustering of categorical data," Lecture Notes in Computer Science, 2004.
4. D. Barbara, Y. Li and J. Couto, "COOLCAT: an entropy-based algorithm for categorical clustering," in ACM CIKM, 2002.
5. M. Brand, "Fast low-rank modifications of the thin singular value decomposition," Linear Algebra and its Applications, 2006.
6. E. Cesario, G. Manco and R. Ortale, "Top-down parameter-free clustering of high-dimensional categorical data," IEEE Transactions on knowledge and data engineering, 19(12), 2007.
7. K. Chen and L. Liu, "The 'best K' for entropy-based categorical data clustering," in proc. 17th international conference on Scientific and statistical database management, 2005.
8. C. Ding and X. He, "Cluster merging and splitting in hierarchical clustering algorithms," In ICDM, 2002.
9. P. Drineas, E. Drinea and P.S. Huggins, "An experimental evaluation of a monte-carlo algorithm for singular value decomposition," Lecture Notes in Computer Science, 2003.
10. B.S. Everitt, S. Landau and M. Leese, Cluster Analysis, 4th ed., Arnold Publishers, London, 2001.
11. G.Gan and J. Wu, "Subspace clustering for high dimensional categorical data," SIGKDD Explorations, 6(2), 2004.
12. V. Ganti, J. Gehrke and R. Ramakrishnan, "CACTUS: Clustering categorical data using summaries," ACM SIGKDD, 1999.
13. M. Greenacre, Correspondence analysis in practice, London: Academic Press, 1993.
14. M. Greenacre and J. Blasius, Multiple Correspondence Analysis and Related Methods, Chapman&Hall, 2006.
15. S. Guha, R. Rastogi and K. Shim, "ROCK: a robust clustering algorithm for categorical attributes," In ICDE, 1999.
16. A.K. Jain, M.N. Murty and P.J. Flynn, "Data clustering: A review," ACM Computing Surveys, 31(3), 1999.
17. E. Keogh, S. Lonardi and C.A. Ratanamahatana, "Towards parameter-free data mining," In ACM SIGKDD, 2004.
18. T. Li, S. Ma and M. Ogihara, "Entropy-based criterion in categorical clustering," In ICML, 2004.
19. R.B. Messaoud, O. Boussaid and S.L. Rabaseda, "Efficient multidimensional data representations based on multiple correspondence analysis," In ACM SIGKDD, 2006.
20. O.M. San, V. Huynh and Y. Nakamori, "An alternative extension of the k-means algorithm for clustering categorical data," International Journal of Applied Mathematics and Computer Science, 14(2), 2004.
21. P. Tan, M. Steinbach and V. Kumar, Introduction to Data Mining, Addison-Wesley, 2005.
22. K. Wang, C. Xu and B. Liu, "Clustering transactions using large items," In ACM CIKM, 1999.
23. H. Yan, K. Chen and L. Liu, "Efficiently clustering transactional data with weighted coverage density," In ACM CIKM, 2006.
24. Y. Yang, X. Guan, and J. You, "Clope: a fast and effective clustering algorithm for transactional data," In ACM SIGKDD, 2002.
25. Y. Zhao and G. Karypis, "Hierarchical clustering algorithms for document datasets," Data Mining and Knowledge Discovery, 10, 2005.