A fast algorithm to cluster high dimensional basket data

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2001, Pages 633-636

  Ordonez, Carlos ^a   Omiecinski, Edward ^a   Ezquerra, Norberto ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (17)

1. Charu Aggarwal and Philip Yu. Finding generalized projected clusters in dimensional spaces. In ACM SIGMOD Conference, 2000.
2. Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopolos, and Prabhakar Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In ACM SIGMOD Conference, 1998.
3. Rakesh Agrawal, Tomasz Imielinski, and Arun Swami. Mining association rules between sets of items in large databases. In ACM SIGMOD Conference, pages 207-216, 1993.
4. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases. In VLDB Conference, 1994.
5. Paul Bradley, Usama Fayyad, and Cory Reina. Scaling clustering algorithms to large databases. In ACM KDD Conference, 1998.
6. Paul Bradley, Usama Fayyad, and Cory Reina. Scaling EM clustering to large databases. Technical report, Microsoft Research, 1999.
7. Arthur P. Dempster, Nan M. Laird, and Donald B. Rubin. Maximum likelihood estimation from incomplete data via the EM algorithm. Journal of The Royal Statistical Society, 39(1):1-38, 1977.
8. Richard Duda and Peter Hart. Pattern Classification and Scene Analysis, pages 10-45. John Wiley and Sons, 1973.
9. Fredrik Fanstrom, James Lewis, and Charles Elkan. Scalability for clustering algorithms revisited. SIGKDD Explorations, 2(1):51-57, June 2000.
10. Alexander Hinneburg and Daniel Keim. Optimal grid-clustering: Towards breaking the curse of dimensionality. In VLDB Conference, 1999.
11. Alexander Mood, Franklin Graybill, and Duane Boes. Introduction to the Theory of Statistics, pages 299-320. McGraw Hill, NY, 1974.
12. Radford Neal and Geoffrey Hinton. A view of the EM algorithm that justifies incremental, sparse and other variants. Technical report, Dept. of Statistics, University of Toronto, 1993.
13. Carlos Ordonez and Paul Cereghini. SQLEM: Fast clustering in SQL using the EM algorithm. In ACM SIGMOD Conference, pages 559-570, 2000.
14. Sam Roweis and Zoubin Ghahramani. A unifying review of Linear Gaussian Models. Neural Computation, 1999.
15. Nononi Ueda, Ryoehi Nakano, Zoubin Ghahramani, and Geoffrey Hinton. SMEM algorithm for mixture models. In Neural Information Processing Systems, 1998.
16. Ke Wang, Chu Xu, and Bing Liu. Clustering transactions using large items. In ACM CIKM Conference, 1999.
17. Lei Xu and Michael Jordan. On convergence properties of the EM algorithm for Gaussian mixtures. Neural Computation, 7, 1995.