Efficiently clustering transactional data with weighted coverage density

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2006, Pages 367-376

  Yan, Hua ^a   Chen, Keke ^b   Liu, Ling ^b  

^a UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b Georgia Institute of Technology   (United States)

Author keywords

AMI; LISR; SCALE; Weighted coverage density

Indexed keywords

DATA STRUCTURES; METRIC SYSTEM; PARAMETER ESTIMATION; PROBLEM SOLVING;

EVALUATION METRICS; TRANSACTIONAL DATA; WEIGHTED COVERAGE DENSITY;

CLUSTERING ALGORITHMS;

EID: 34547626216     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183614.1183668     Document Type: Conference Paper

References (24)

1. J. Abello, M. G. C. Resende, and S. Sudarsky. Massive quasi-clique detection. Latin American Theoretical INformatics,pages 598-612, 2002.
2. C. C. Aggarwal, C. Magdalena, and P. S. Yu. Finding localized associations in market basket data. IEEE Trans, on Knowledge and Data Eng.,14(1):51-62, 2002.
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. Proc. 20th Int. Conf. Very Large Data Bases, VLDB,pages 487-499, 12-15 1994.
4. P. Andritsos, P. Tsaparas, R. J. Miller, and K. C. Sevcik. Limbo: Scalable clustering of categorical data. Proc. of Intl. Conf. on Extending Database Technology (EDBT),pages 123-146, 2004.
5. D. Barbara, Y. Li, and J. Couto. Coolcat: an entropy-based algorithm for categorical clustering. Proc. of ACM Conf. on Information and Knowledge Mgt. (CIKM),2002.
6. D. Chakrabarti, S. Papadimitriou, D. S. Modha, and C Faloutsos. Fully automatic cross-associations. Proc. of ACM SIGKDD Conference,2004.
7. K. Chen and L. Liu. VISTA: Validating and refining clusters via visualization. Information Visualization,3(4), 2004.
8. K. Chen and L. Liu. The "best k" for entropy-based categorical clustering. Proc. of Intl. Conf. on Scientific and Statistical Database Management (SSDBM),2005.
9. I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining,pages 269-274, 2001.
10. C. H. Q. Ding, X. He, H. Zha, M. Gu, and H. D. Simon. A min-max cut algorithm for graph partitioning and data clustering. Proceedings of ICDM 2001,pages 107-114, 2001.
11. V. Ganti, J. Gehrke, and R. Ramakrishnan. Cactus: Clustering categorical data using summaries. Proceedings of Intl. Conf. on Knowledge Discovery and Data Mining (KDD),pages 73-83, August 1999.
12. D. Gibson, J. Kleinberg, and P. Raghavan. Clustering categorical data: an approach based on dynamical systems. Proc. of Very Large Databases Conference (VLDB),1998.
13. S. Guha, R. Rastogi, and K. Shim. Rock: A robust clustering algorithm for categorical attributes. Proc. of IEEE Intl. Conf. on Data Eng. (ICDE),pages 512-521, March 1999.
14. M. Halkidi, Y. Batistakis, and M. Vazirgiannis. Cluster validity methods: Part I and II. SIGMOD Record,31(2):40-45, 2002.
15. T. Hastie, R. Tibshirani, and J. Friedmann. The Elements of Statistical Learning. Springer-Verlag, 2001.
16. Z. Huang. Extensions to the k-means algorithm for clustering large data sets with categorical values. Workshop on Research Issues on Data Mining and Knowledge Discovery, (DMKD),2(3):283-304, 1998.
17. A. K. Jain and R. C Dubes. Data clustering: A review. ACM Computing Surveys,31, 1999.
18. T. Li, S. Ma, and M. Ogihara. Entropy-based criterion in categorical clustering. Proc. of Intl. Conf. on Machine Learning (ICML),2004.
19. N. Mishra, D. Ron, and R. Swaminathan. On finding large conjunctive clusters. COLT,pages 448-462, 2003.
20. N. Tishby, F. C. Pereira, and W. Bialek. The information bottleneck method. Proc. of the 37-th Annual Allerton Conference on Communication, Control and Computing,1999.
21. K. Wang, C Xu, and B. Liu. Clustering transactions using large items. Proc. of ACM Conf. on Information and Knowledge Mgt. (CIKM),1999.
22. H. Yan, L. Zhang, and Y. Zhang. Clustering categorical data using coverage density. Proc. of Intl. Conf. on Advance Data Mining and Application,pages 248-255, 2005.
23. Y. Yang, X. Guan, and J. You. Clope: A fast and effective clustering algorithm for transactional data. Proc. of ACM SIGKDD Conference,July 2002.
24. H. Zha, X. He, C H. Q. Ding, M. Gu, and H. D. Simon. Bipartite graph partitioning and data clustering. CIKM,pages 25-32, 2001.