Outlier-robust clustering using independent components

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 185-198

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

^a UNIVERSITY OF MUNICH   (Germany)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

EPD; ICA; Outlier robust clustering

Indexed keywords

CLUSTERING ALGORITHMS; DISTRIBUTION FUNCTIONS; FLOW OF SOLIDS; HEMODYNAMICS; INDEPENDENT COMPONENT ANALYSIS; MULTIVARIANT ANALYSIS; TRELLIS CODES;

CLUSTER CONTENTS; CLUSTER MODELS; CLUSTER STRUCTURES; CLUSTERING APPROACHES; CLUSTERING METHODS; DATA DISTRIBUTIONS; DATA SETS; EPD; EXPERIMENTAL EVALUATIONS; GAUSSIAN; GAUSSIAN CLUSTERS; ICA; INDEPENDENT COMPONENTS; LAPLACIAN; NUMBER OF CLUSTERS; OUT-LIERS; OUTLIER-ROBUST CLUSTERING; POWER DISTRIBUTIONS; ROBUST CLUSTERING; SPLIT PLANES; TOP DOWNS;

CLUSTER ANALYSIS;

EID: 57149146298     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376638     Document Type: Conference Paper

References (18)

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, pages 49-60, 1999.
4. C. L. Blake and C. J. Merz. "UCI Repository of machine learning databases, http://www.ics.uci.edu/~mlearn/MLRepository.html".
5. C. Böhm, C. Faloutsos, J.-Y. Pan, and C. Plant. Robust information-theoretic clustering. In KDD Conference, pages 65-75, 2006.
6. C. Böhm, K. Kailing, P. Kröger, and A. Zimek. Computing clusters of correlation connected objects. In SIGMOD Conference, pages 455-466, 2004.
7. M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander. Lof: Identifying density-based local outliers. In SIGMOD Conference, pages 93-104, 2000.
8. A. P. Dempster, N. M. Laird, and D. B. Rubin. "Maximum Likelihood from Incomplete Data via the EM Algorithm". In J Roy Stat Soc, number 39, pages 1-31, 1977.
9. C. H. Q. Ding and X. He. K-means clustering via principal component analysis. In ICML Conference, 2004.
10. 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.
11. P. Grünwald. A tutorial introduction to the minimum description length principle. Advances in Minimum Description Length: Theory and Applications, 2005.
12. G. Hamerly and C. Elkan. Learning the k in k-means. In NIPS Conference, 2003.
13. A. Hyvärinen, J. Karhunen, and E. Oja. Independent Component Analysis. 2001.
14. A. Mineo and M. Ruggieri. A software tool for the exponential power distribution: The normalp package. Journal of Statistical Software, 12(4), 1 2005.
15. A. Ng, M. Jordan, and Y, Weiss. On spectral clustering: Analysis and an algorithm, 2001.
16. D. Pelleg and A. Moore. X-means: Extending K-means with efficient estimation of the number of clusters. In ICML Conference, pages 727-734, 2000.
17. A. K. Tung, X. Xu, and B. C. Ooi. CURLER: Finding and visualizing nonlinear correlation clusters. In SIGMOD Conference, pages 467-478, 2005.
18. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An efficient data clustering method for very large databases. In SIGMOD Conference, pages 103-114, 1996.