Generation of alternative clusterings using the CAMI approach

Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010

Volumn , Issue , 2010, Pages 118-129

  Dang, Xuan Hong ^a   Bailey, James ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

MAXIMUM PRINCIPLE;

CLUSTERING QUALITY; CONVENTIONAL CLUSTERING; EXPECTATION-MAXIMIZATION FRAMEWORKS; EXPLORATORY DATA ANALYSIS; MUTUAL INFORMATIONS; NOVEL ALGORITHM; REAL-WORLD DATASETS; STATE-OF-THE-ART ALGORITHMS;

DATA MINING;

EID: 84873124076     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972801.11     Document Type: Conference Paper

References (27)

1. A. Asuncion and D.J. Newman, UCI machine learning repository, 2007.
2. E. Bae and J. Bailey, Coala: A novel approach for the extraction of an alternate clustering of high quality and high dissimilarity, ICDM Conference, pages 53-62, 2006.
3. S. Basu, A. Banerjee, and R. Mooney, Active semi-supervision for pairwise constrained clustering, SDM Conference, pages 333-344, 2004.
4. Mikhail Bilenko, Sugato Basu, and Raymond J. Mooney, Integrating constraints and metric learning in semi-supervised clustering, ICML Conference, 2004.
5. C. Bishop, Pattern Recognition and Machine Learning, Springer-Verlag, 2006.
6. G. Chechik and N. Tishby, Extracting relevant structures with side information, NIPS Conference, pages 857-864, 2002.
7. Thomas M. Cover and Joy A. Thomas, Elements of Information Theory, Wiley-Interscience, August 1991.
8. Y. Cui, X. Fern, and J. Dy, Non-redundant multi-view clustering via orthogonalization, ICDM Conference, pages 133-142, 2007.
9. I. Davidson and Z. Qi, Finding alternative clusterings using constraints, ICDM Conference, pages 773-778, 2008.
10. I. Davidson, S. Ravi, and M. Ester, Efficient incremental constrained clustering, SIGKDD Conference, pages 240-249, 2007.
11. X. Fern and W. Lin, Cluster ensemble selection, Stat. Anal. Data Min, 1(3):128-141, 2008.
12. E. Gokcay and C. Principe, Information theoretic clustering, IEEE Trans. Pattern Anal. Mach. Intell., 24(2):158-171, 2002.
13. D. Gondek, Non-redundant clustering, PhD Thesis, Brown University, 2005.
14. D. Gondek, Hofmann, and Thomas, Non-redundant data clustering, Non-redundant data clustering, 12(1):1-24, 2007.
15. D. Gondek and T. Hofmann, Conditional information bottleneck clustering, ICDM Conference, pages 36-42, 2003.
16. D. Gondek, S. Vaithyanathan, and A. Garg, Clustering with model-level constraints, SDM Conference, 2005.
17. P. Jain, R. Meka, and I. Dhillon Simultaneous unsu-pervised learning of disparate clusterings, SDM Conference, pages 858-869, 2008.
18. K. Wagstaff and C. CardieClustering with instance-level constraints, ICML Conference, pages 1103-1110, 2000.
19. M. Law, A. Topchy, and A. Jain, Multiobjective data clustering, CVPR Conference, pages 424-430, 2004.
20. L. Xu and M. Jordan, On convergence properties of the em algorithm for gaussian mixtures, On convergence properties of the em algorithm for gaussian mixtures, 8:129-151, 1996.
21. Z. Qi and I. Davidson, A principled and flexible framework for finding alternative clusterings, SIGKDD Conference, pages 240-249, 2009.
22. A. Topchy, A. Jain, and W. Punch, A mixture model for clustering ensembles, SDM Conference, 2004.
23. K. Torkkola, Feature extraction by non parametric mutual information maximization, Feature extraction by non parametric mutual information maximization, 3:1415-1438, 2003.
24. K. Wagstaff, C. Cardie, S. Rogers, and S. Schrodl, Constrained k-means clustering with background knowledge, ICML Conference, pages 577-584, 2001.
25. E. Xing, A. Ng, M. Jordan, and S. Russell, Distance metric learning with application to clustering with side-information, NIPS Conference, pages 505-512, 2002.
26. L. Yang and R. Jin, Distance metric learning: A comprehensive survey, 2006.
27. R. Yang and M. Zwolinski, Mutual information theory for adaptive mixture models, Mutual information theory for adaptive mixture models, 23(4), 2001.