The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Solving cluster ensemble problems by bipartite graph partitioning
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
Monti, S., Tamayo, P., Mesirov, J., & Golub, T. (2003) · Machine Learning · doi:10.1023/a:1023949509487 · Cited by 2,116 · cited 4×
“…of clustering techniques is the development of cluster ensemble or consensus clustering techniques (Strehl & Ghosh, 2002; Fern & Brodley, 2003; Monti et al., 2003; Topchy et al., 2003), which seek to improve clustering performance by first generating multiple partitions of a given data set and…”
BackgroundMethodInfluentialCo-clustering documents and words using bipartite spectral graph partitioning
Dhillon, I. S. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502550 · Cited by 1,697
New spectral methods for ratio cut partitioning and clustering
Hagen, L., & Kahng, A. B. (1992) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.159993 · Cited by 1,288
Information-theoretic co-clustering
Dhillon, I. S., Mallela, S., & Modha, D. S. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956764 · Cited by 1,006
Random projection for high dimensional data clustering: a cluster ensemble approach
Fern, X. Z., & Brodley, C. E. (2003) · Cited by 595
Self-citationBagging to improve the accuracy of a clustering procedure
Dudoit, S., & Fridlyand, J. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg038 · Cited by 530
Data clustering using evidence accumulation
Fred, A. L. N., & Jain, A. K. (2003) · Object recognition supported by user interaction for service robots · doi:10.1109/icpr.2002.1047450 · Cited by 515
Bach, F., & Jordan, M. I. (2003) · UC Berkeley · Cited by 493
Document clustering using word clusters via the information bottleneck method
Slonim, N., & Tishby, N. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345578 · Cited by 474
A Mixture Model for Clustering Ensembles
Topchy, A., Jain, A. K., & Punch, W. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.35 · Cited by 384
Research and Development in Information Retrieval
(1983) · Lecture Notes in Computer Science · doi:10.1007/bfb0036332 · Cited by 378
Combining multiple weak clusterings
Topchy, A. P., Jain, A. K., & Punch, W. F. (2004) · Proceedings · doi:10.1109/icdm.2003.1250937 · Cited by 369
Voting-Merging: An Ensemble Method for Clustering
Dimitriadou, E., Weingessel, A., & Hornik, K. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44668-0_31 · Cited by 97
Cited by
Time-series clustering – A decade review
Aghabozorgi, S., Seyed Shirkhorshidi, A., & Ying Wah, T. (2015) · Information Systems · doi:10.1016/j.is.2015.04.007 · Cited by 1,826
A SURVEY OF CLUSTERING ENSEMBLE ALGORITHMS
VEGA-PONS, S., & RUIZ-SHULCLOPER, J. (2011) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001411008683 · Cited by 609
Advances in Fuzzy Clustering and its Applications
(2007) · Wiley eBooks · doi:10.1002/9780470061190 · Cited by 508
A Survey on Multiview Clustering
Chao, G., Sun, S., & Bi, J. (2021) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2021.3065894 · Cited by 427
Locally Weighted Ensemble Clustering
Huang, D., Wang, C.-D., & Lai, J.-H. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2702343 · Cited by 371
Metadata
- Authors
- Fern, X. Z., & Brodley, C. E.
- Venue
- Twenty-first international conference on Machine learning - ICML '04
- Publisher
- ACM Press
- Published
- 2004
- Pages
- 36
- OpenAlex
- W1967761844
- Cited by
- 559
- References
- 18
- Type
- conference abstract
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.