Solving cluster ensemble problems by bipartite graph partitioning

Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004

Volumn , Issue , 2004, Pages 281-288

  Fern, Xiaoli Zhang ^a   Brodley, Carla E ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING; ENSEMBLES; GRAPH FORMULATIONS; GRAPH PARTITIONING;

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; RANDOM PROCESSES; SET THEORY; VECTORS;

PROBLEM SOLVING;

EID: 14344258244     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Bach, F. R., & Jordan, M. I. (2004). Learning spectral clustering. NIPS 16.
2. Blake, C. L., & Merz, C. J. (1998). UCI repository of machine learning databases. http://www.ics.uci.edu/~mlearn/MLRepository.html.
3. Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. John Wiley & Sons.
4. Dhillon, I. S. (2001). Co-clustering documents and words using bipartite spectral graph partitioning. KDD.
5. Dhillon, I. S., Mallela, S., & Modha, D. S. (2003). Information-theoretic co-clustering. KDD.
6. Dimitriadou, E., Weingessel, A., & Hornik, K. (2001). Voting-merging: An ensemble method for clustering. ICANN.
7. Dudoit, S., & Fridlyand, J. (2003). Bagging to improve the accuracy of a clustering procedure. Bioinformatics, 19.
8. Dy, J. G., Brodley, C. E., Kak, A., Shyu, C., & Broderick, L. S. (1999). The customized-queries approach to CBIR using EM. CVPR.
9. Fern, X. Z., & Brodley, C. E. (2003). Random projection for high dimensional data clustering: A cluster ensemble approach. ICML.
10. Fjallstrom, P. (1998). Algorithms for graph partitioning: A survey. Linkoping Electronic Articles in Computer and Information Science, 3.
11. Fred, A. L. N., & Jain, A. K. (2002). Data clustering using evidence accumulation. ICPR.
12. Hagen, L., & Kahng, A. (1992). New spectral methods for ratio cut partitioning and clustering. IEEE transaction on CAD, 11, 1074-1085.
13. Karypis, G., & Kumar, V. (1998). A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20, 359-392.
14. Monti, S., Tamayo, P., Mesirov, J., & Golub, T. (2003). Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data. Machine Learning, 52, 91-118.
15. Ng, A., Jordan, M., & Weiss, Y. (2002). On spectral clustering: Analysis and an algorithm. NIPS 14.
16. Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence, 22, 888-905.
17. Slonim, N., & Tishby, N. (2000). Document clustering using word clusters via the information bottleneck method. Research and Development in Information Retrieval.
18. Strehl, A., & Ghosh, J. (2002). Cluster ensembles - a knowledge reuse framework for combining multiple partitions. Machine Learning Research, 3, 583-417.
19. Topchy, A., Jain, A. K., & Punch, W. (2003). Combining multiple weak clusterings. ICDM.
20. Topchy, A., Jain, A. K., & Punch, W. (2004). A mixture model for clustering ensembles. Proc. of SIAM Conf. on Data Mining.