Ensemble Clustering via Co-Association Matrix Self-Enhancement
- 6 March 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (8) , 11168-11179
Abstract
Ensemble clustering integrates a set of base clustering results to generate a stronger one. Existing methods usually rely on a co-association (CA) matrix that measures how many times two samples are grouped into the same cluster according to the base clusterings to achieve ensemble clustering. However, when the constructed CA matrix is of low quality, the performance will degrade. In this article, we propose a simple, yet effective CA matrix self-enhancement framework that can improve the CA matrix to achieve better clustering performance. Specifically, we first extract the high-confidence (HC) information from the base clusterings to form a sparse HC matrix. By propagating the highly reliable information of the HC matrix to the CA matrix and complementing the HC matrix according to the CA matrix simultaneously, the proposed method generates an enhanced CA matrix for better clustering. Technically, the proposed model is formulated as a symmetric constrained convex optimization problem, which is efficiently solved by an alternating iterative algorithm with convergence and global optimum theoretically guaranteed. Extensive experimental comparisons with 12 state-of-the-art methods on ten benchmark datasets substantiate the effectiveness, flexibility, and efficiency of the proposed model in ensemble clustering. The codes and datasets can be downloaded at https://github.com/Siritao/EC-CMS.Keywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (62106044, 62176160)
- Natural Science Foundation of Jiangsu Province (BK20210221)
- National Key Research and Development Program of China (2022YFF0608000)
- Zhejiang Lab (K2022KG1BB01)
- Basic and Applied Basic Research Foundation of Guangdong Province (2022A1515010791)
- ZhiShan Youth Scholar Program from Southeast University (2242022R40015)
- Natural Science Foundation of Shenzhen (20200804193857002)
This publication has 27 references indexed in Scilit:
- Robust Spectral Ensemble Clustering via Rank MinimizationACM Transactions on Knowledge Discovery From Data, 2019
- Enhanced Ensemble Clustering via Fast Propagation of Cluster-Wise SimilaritiesIEEE Transactions on Systems, Man, and Cybernetics: Systems, 2018
- Dynamic Affinity Graph Construction for Spectral Clustering Using Multiple FeaturesIEEE Transactions on Neural Networks and Learning Systems, 2018
- Rank-Constrained Spectral Clustering With Flexible EmbeddingIEEE Transactions on Neural Networks and Learning Systems, 2018
- Locally Weighted Ensemble ClusteringIEEE Transactions on Cybernetics, 2017
- Robust Principal Component Analysis on Graphs2015
- Robust Ensemble Clustering Using Probability TrajectoriesIEEE Transactions on Knowledge and Data Engineering, 2015
- Robust Ensemble Clustering by Matrix Completion2012
- A tutorial on spectral clusteringStatistics and Computing, 2007
- Learning generative visual models from few training examples: An incremental Bayesian approach tested on 101 object categoriesComputer Vision and Image Understanding, 2007