RIC: Parameter-free noise-robust clustering

ACM Transactions on Knowledge Discovery from Data

Volumn 1, Issue 3, 2007, Pages

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

^a UNIVERSITY OF MUNICH   (Germany)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c GOOGLE INC   (United States)

^d University of Munich ^*  (United States)

Author keywords

Clustering; Data summarization; Noise robustness; Parameter free data mining

Indexed keywords

DATA SUMMARIZATION; NOISE ROBUSTNESS; PARAMETER-FREE DATA MINING; ROBUST INFORMATION-THEORETIC CLUSTERING (RIC);

ACOUSTIC NOISE; AUTOMATION; DATA MINING; OPTIMIZATION; PARAMETER ESTIMATION; ROBUSTNESS (CONTROL SYSTEMS);

CLUSTERING ALGORITHMS;

EID: 37049038390     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1297332.1297334     Document Type: Conference Paper

References (25)

1. AGGARWAL, C. C. AND YU, P. S. 2000. Finding generalized projected clusters in high dimensional spaces. In Proceedings of the ACM International SIGMOD Conference on Management of Data, 70-81.
2. AGRAWAL, R., GEHRKE, J., GUNOPULOS, D., AND RAGHAVAN, P. 1998. Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of the ACM International SIGMOD Conference on Management of Data, 94-105.
3. ANKERST, M., BREUNIG, M. M., KRIEGEL, H.-P., AND SANDER, J. 1999. OPTICS: Ordering points to identify the clustering structure. In Proceedings of the ACM International SIGMOD Conference on Management of Data.
4. BANFIELD, J. D. AND RAFTERY, A. E. 1993. Model-based Gaussian and non-Gaussian clustering. Biometrics 49, 3, 803-821.
5. BHATTACHARYA, A., LJOSA, V., PAN, J.-Y., VERARDO, M. R., YANG, H., FALOUTSOS, C., AND SINGH, A. K. 2005. ViVo: Visual vocabulary construction for mining biomedical images. In Proceedings of the 5th IEEE International Conference on Data Mining (ICDM).
6. BÖHM, C., KAILING, K., KRÖGER, P., AND ZIMEK, A. 2004. Computing clusters of correlation connected objects. In Proceedings of the ACM International SIGMOD Conference on Management of Data, 455-466.
7. CHAKRABARTI, D., PAPADIMITRIOU, S., MODHA, D. S., AND FALOUTSOS, C. 2004. Fully automatic cross-associations. In Proceedings of the ACM SIGKDD Conference on International Knowledge Discovery and Data Mining. 79-88.
8. ESTER, M., KRIEGEL, H.-P., SANDER, J., AND XU, X. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the ACM SIGKDD Conference on International Knowledge Discovery and Data Mining.
9. GRÜNWALD, P. 2005. A tutorial introduction to the minimum description length principle. Advances in Minimum Description Length: Theory and Applications.
10. GUHA, S., RASTOGI, R., AND SHIM, K. 1998. CURE: An efficient clustering algorithm for large databases. In Proceedings of the ACM International SIGMOD Conference on Management of Data, 73-84.
11. HAMERLY, G. AND ELKAN, C. 2003. Learning the k in k-means. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS).
12. HARTIGAN, J. A. 1975. Clustering Algorithms. John Wiley.
13. JOLLIFFE, I. 1986. Principal Component Analysis. Springer.
14. MURTAGH, F. 1983. A survey of recent advances in hierarchical clustering algorithms. Comput. J. 26, 4, 354-359.
15. NG, A., JORDAN, M., AND WEISS, Y. 2001. On spectral clustering: Analysis and an algorithm. In Proceedings of the Conference on Advances in Neural Information Processing Systems.
16. NG, R. T. AND HAN, J. 1994. Efficient and effective clustering methods for spatial data mining. In Proceedings of the Conference on Very Large Databases (VLDB), 144-155.
17. PELLEG, D. AND MOORE, A. 2000. X-means: Extending K-means with efficient estimation of the number of clusters. In Proceedings of the 17th International Conference on Machine Learning (ICML), 727-734.
18. SLONIM, N. AND TISHBY, N. 2000. Document clustering using word clusters via the information bottleneck method. In Proceedings of the Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 208-215.
19. STILL, S. AND BIALEK, W. 2004. How many clusters? An information theoretic perspective. Neural Comput. 16, 2483-2506.
20. TIBSHIRANI, R., WALTHER, G., AND HASTIE, T. 2000. Estimating the number of clusters in a dataset via the gap statistic. Tech. Rep., Stanford University.
21. TISHBY, N., PEREIRA, F. C., AND BIALEK, W. 2000. The information bottleneck method. In Proceedings of the 37th Allerton Conference on Communication, Control and Computing.
22. TUNG, A. K., XU, X., AND OOI, B. C. 2005. CURLER: Finding and visualizing nonlinear correlation clusters. In Proceedings of the ACM International SIGMOD Conference on Management of Data, 467-478.
23. VAN-RIJSBERGEN, C. 1979. Information Retrieval, 2nd ed. Butterworths, London.
24. ZHANG, B., HSU, M., AND DAYAL, U. 2000. K-harmonic means - A spatial clustering algorithm with boosting. In Proceedings of the 1st International Workshop on Temporal, Spatial, and Spatio-Temporal Data Mining-Revised Papers (TSDM), 31-45.
25. ZHANG, T., RAMAKRISHNAN, R., AND LIVNY, M. 1996. BIRCH: An efficient data clustering method for very large databases. In Proceedings of the ACM International SIGMOD Conference on Management of Data, 103-114.