Combining multiple clusterings by soft correspondence

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2005, Pages 282-289

  Long, Bo ^a   Zhang, Zhongfei ^a   Yu, Philip S ^b  

^a BINGHAMTON UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DATA MINING; ITERATIVE METHODS; MATRIX ALGEBRA;

CONSENSUS CLUSTERING; SOFT CORRESPONDENCE;

SOFT COMPUTING;

EID: 34548569516     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2005.45     Document Type: Conference Paper

References (17)

1. N. M. L. A. P. Dempster and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39(8): 1-38, 1977.
2. A.K.Jain and R.C.Dubes. Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs, NJ, 1988.
3. M. H. C. L. Alexander P. Topchy and A. K. Jain. Analysis of consensus partition in cluster ensemble. In ICDM'04, pages 1101-1111. 2004.
4. D.D.Lee and H.S.Seung. Learning the parts of objects by non-negative matrix factorization. Nature, 401:788-791, 1999.
5. E. Dimitriadou, A. Weingessel, and K. Hornik. Votingmerging: An ensemble method for clustering. In ICANN '01.
6. X. Z. Fern and C. E. Brodley. Solving cluster ensemble problems by bipartite graph partitioning. In ICML '04.
7. B. Fischer and J. M. Buhmann. Path-based clustering for grouping of smooth curves and texture segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 25(4):513-518, 2003.
8. A. L. Fred and A. K. Jain. Data clustering using evidence accumulation. In ICPR '02.
9. A. L. N. Fred. Finding consistent clusters in data partitions. In Multiple Classifier Systems, pages 309-318, 2001.
10. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. Multilevel hypergraph partitioning: application in vlsi domain. In DAC '97.
11. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1):359-392, 1998.
12. D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In NIPS, pages 556-562, 2000.
13. N. C. S. P.Kellam, X.Lin and A.Tucker. Comparing, contrasting and combining clusters in viral gene expression data. In Proceedings of 6th Workshop on Intelligence Data Analysis in Medicine an Pharmacology, pages 56-62, 2001.
14. S.Dudoit and J. Fridlyand. Bagging to improve the accuracy of a clustering procedure. Bioinformatics, 19(9): 1090-1099, 2003.
15. A. Strehl and J. Ghosh. Cluster ensembles - a knowledge reuse framework for combining partitionings. In AAAI 2002. AAAI/MIT Press.
16. A. Topchy, A. K. Jain, and W. Punch. Combining multiple weak clusterings. In Proceedings of the Third IEEE International Conference on Data Mining, page 331, 2003.
17. A. Topchy, A. K. Jain, and W. Punch. A mixture model for clustering ensembles. Inproc. AIAM Data mining, page 379, 2004.