Robust information-theoretic clustering

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

Volumn 2006, Issue , 2006, Pages 65-75

  Böhm, Christian ^a   Faloutsos, Christos ^b   Pan, Jia Yu ^b   Plant, Claudia ^c  

^a UNIVERSITY OF MUNICH   (Germany)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY FOR HEALTH SCIENCES   (Austria)

Author keywords

Clustering; Data Summarization; Noise robustness; Parameter free Data Mining

Indexed keywords

ALGORITHMS; DATA FLOW ANALYSIS; DATA MINING; INFORMATION ANALYSIS; PARAMETER ESTIMATION; ROBUSTNESS (CONTROL SYSTEMS);

CLUSTERING; MINIMUM DESCRIPTION LENGTH (MDL); NOISE-ROBUSTNESS; PARAMETER-FREE DATA MINING;

INFORMATION THEORY;

EID: 33749545220     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1150402.1150414     Document Type: Conference Paper

References (22)

1. C. C. Aggarwal and P. S. Yu. Finding generalized projected clusters in high dimensional spaces. In SIGMOD Conference, pages 70-81, 2000.
2. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In SIGMOD Conference, pages 94-105, 1998.
3. M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander. OPTICS: Ordering points to identify the clustering structure. In SIGMOD Conference, 1999.
4. A. Bhattacharya, V. Ljosa, J.-Y. Pan, M. R. Verardo, H. Yang, C. Faloutsos, and A. K. Singh. ViVo: Visual vocabulary construction for mining biomedical images. In Proceedings of the Fifth IEEE International Conference on Data Mining (ICDM), 2005.
5. C. Böhm, K. Kailing, P. Kröger, and A. Zimek. Computing clusters of correlation connected objects. In SIGMOD Conference, pages 455-466, 2004.
6. D. Chakrabarti, S. Papadimitriou, D. S. Modha, and C. Faloutsos. Fully automatic cross-associations. In KDD Conference, pages 79-88, 2004.
7. 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 Conference, 1996.
8. P. Grünwald. A tutorial introduction to the minimum description length principle. Advances in Minimum Description Length: Theory and Applications, 2005.
9. S. Guha, R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large databases. In SIGMOD Conference, pages 73-84, 1998.
10. G. Hamerly and C. Elkan. Learning the k in k-means. In Proceedings of NIPS, 2003.
11. J. A. Hartigan. Clustering Algorithms. John Wiley & Sons, 1975.
12. I. Jolliffe. Principal Component Analysis. Springer Verlag, 1986.
13. F. Murtagh. A survey of recent advances in hierarchical clustering algorithms. The Computer Journal, 26(4): 354-359, 1983.
14. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems, 2001.
15. R. T. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In Proc. of VLDB Conference., pages 144-155, 1994.
16. D. Pelleg and A. Moore. X-means: Extending K-means with efficient estimation of the number of clusters. In Proceedings of the Seventeenth International Conference on Machine Learning (ICML), pages 727-734, 2000.
17. N. Slonim and N. Tishby. Document clustering using word clusters via the information bottleneck method. In SIGIR, pages 208-215, 2000.
18. N. Tishby, F. C. Pereira, and W. Bialek. The information bottleneck method. CoRR, physics/0004057, 2000.
19. A. K. Tung, X. Xu, and B. C. Ooi. CURLER: Finding and visualizing nonlinear correlation clusters. In SIGMOD Conference, pages 467-478, 2005.
20. C. Van-Rijsbergen. Information Retrieval. Butterworths, London, England, 2nd edition, 1979.
21. B. Zhang, M. Hsu, and U. Dayal. K-harmonic means - A spatial clustering algorithm with boosting. TSDM, pages 31-45, 2000.
22. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An efficient data clustering method for very large databases. In SIGMOD Conference, pages 103-114, 1996.