Large-scale Robust Enhanced Ensemble Clustering via Outlier Decoupling
Jiaxuan Xu, Lei Duan, Xinye Wang, Liang Du
Abstract
Ensemble clustering aims to derive a consensus partition from multiple base clustering results. Anchor-based methods construct compact similarity representations via anchors, substantially improving computational efficiency. However, when outliers contaminate the data, reconstructing the base clustering results often yields biased anchors. These biased anchors degrade the quality of the anchor similarity matrix and lead to a decline in clustering accuracy. To address this issue, we propose a novel method called large-scale robust enhanced ensemble clustering via outlier decoupling (RANGE). Specifically, RANGE first converts the base clustering results into an initial bipartite graph. To enhance the reliability of this bipartite graph, RANGE designs a high-order fuzzy enhancement strategy (HFES) specifically for initial bipartite graphs. Next, RANGE introduces an anchor matrix to improve the computational efficiency of the bipartite graph reconstruction process. To improve robustness, RANGE decomposes the anchor similarity matrix into a clean component and a residual outlier component in the anchor space. A global cross-correlation penalty is imposed to suppress leakage between the two components, while a row-wise ℓ 2,1 -norm on the residual part confines contamination to a small number of residual anchor directions. Moreover, by applying outlier detectors to the decoupled outlier structure, RANGE can be extended to the outlier detection task. Consequently, RANGE forms a cross-task general framework. Extensive experiments indicate that RANGE delivers superior performance in both clustering validity and outlier detection.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7b944f7f-c936-4911-940e-1601ed4ddeccBuilds on13
- Learning Cluster-Wise Anchors for Multi-View ClusteringChao Zhang, Xiuyi Jia, Zechao Li, Chunlin Chen et al.AAAI 2024 · 66 citations
- Tri-level Robust Clustering Ensemble with Multiple Graph LearningPeng Zhou, Liang Du, Yi-Dong Shen, Xuejun LiAAAI 2021 · 38 citations
- Tensorized Label Learning on Anchor GraphJing Li, Quanxue Gao, Qianqian Wang, Wei XiaAAAI 2024 · 20 citations
- S2MVTC: A Simple Yet Efficient Scalable Multi-View Tensor ClusteringZhen Long, Qiyuan Wang, Yazhou Ren, Yipeng Liu et al.CVPR 2024 · 12 citations
- On Regularizing Multiple Clusterings for Ensemble Clustering by Graph Tensor LearningMan-Sheng Chen, Jia-Qi Lin, Chang-Dong Wang, Wudong Xi et al.ACM MM 2023 · 12 citations
Related papers
- Robust Consensus Anchor Learning for Efficient Multi-view Subspace ClusteringYalan Qin, Nan Pu, Guorui Feng, Nicu SebeICML 2025
- Efficient Anchor Learning-based Multi-view Clustering - A Late Fusion MethodTiejian Zhang, Xinwang Liu, En Zhu, Sihang Zhou et al.ACM MM 2022 · 28 citations
- Alleviate Anchor-Shift: Explore Blind Spots with Cross-View Reconstruction for Incomplete Multi-View ClusteringSuyuan Liu, Siwei Wang, Ke Liang, Junpu Zhang et al.NeurIPS 2024 · 13 citations
- Automatic and Aligned Anchor Learning Strategy for Multi-View ClusteringHuimin Ma, Siwei Wang, Shengju Yu, Suyuan Liu et al.ACM MM 2024 · 14 citations
- Dual-Constraint Multi-view Fuzzy Clustering with Scalable Anchor Graph LearningLuyan Cui, Huibing Wang, Yawei Chen, Mingze Yao et al.ACM MM 2025 · 3 citations
