Download:
by Xiaoli Zhang Fern, Carla E. Brodley
In Proceedings of the International Conference on Machine Learning
http://web.engr.oregonstate.edu/~xfern/graph_icml04.pdf
Add To MetaCart
Abstract:
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniques, we solve this problem by reducing it to a graph partitioning problem. We introduce a new reduction method that constructs a bipartite graph from a given cluster ensemble. The resulting graph models both instances and clusters of the ensemble simultaneously as vertices in the graph. Our approach retains all of the information provided by a given ensemble, allowing the similarity among instances and the similarity among clusters to be considered collectively in forming the final clustering. Further, the resulting graph partitioning problem can be solved efficiently. We empirically evaluate the proposed approach against two commonly used graph formulations and show that it is more robust and achieves comparable or better performance in comparison to its competitors. 1.
Citations
|
4833
|
Elements of Information Theory
– Cover, Thomas
- 1991
|
|
2263
|
UCI Repository of Machine Learning Databases
– Blake, Merz
- 1998
|
|
1081
|
Normalized Cuts and Image Segmentation
– Shi, Malik
- 2000
|
|
498
|
A fast and high quality multilevel scheme for partitioning irregular graphs
– Karypis, Kumar
- 1998
|
|
431
|
On spectral clustering: Analysis and an algorithm
– Ng, Jordan, et al.
- 2001
|
|
145
|
New Spectral Methods for Ratio Cut Partitioning and Clustering
– Hagen, Kahng
- 1992
|
|
144
|
Cluster ensembles - a knowledge reuse framework for combining multiple partitions
– Strehl, Ghosh
- 2002
|
|
139
|
Co-clustering documents and words using bipartite spectral graph partitioning
– Dhillon
- 2001
|
|
96
|
Document clustering using word clusters via the information bottleneck method
– Slonim, Tishby
- 2000
|
|
87
|
Information-theoretic co-clustering
– Dhillon, Mallela, et al.
- 2003
|
|
50
|
Random projection for high dimensional data clustering: A cluster ensemble approach
– Fern, Brodley
- 2003
|
|
45
|
Bagging to improve the accuracy of a clustering procedure
– Dudoit, Fridlyand
- 2003
|
|
42
|
Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
– Monti, Tamayo, et al.
- 2003
|
|
40
|
Learning spectral clustering
– Bach, Jordan
- 2003
|
|
13
|
Algorithms for graph partitioning: A survey. Linkoping
– Fjallstrom
- 1998
|
|
5
|
Voting-merging: An ensemble method for clustering. ICANN
– Dimitriadou, Weingessel, et al.
- 2001
|
|
1
|
The customized-queries approach to CBIR using
– Dy, Brodley, et al.
- 1999
|
|
1
|
Data clustering using evidence accumulation. ICPR
– Fred, Jain
- 2002
|
|
1
|
Combining multiple weak clusterings. ICDM
– Topchy, Jain, et al.
- 2003
|
