Consensus Graph-Based Spectral Ensemble Clustering via Low-Rank Tensor Learning
Ensemble clustering using co-association matrices integrates multiple base clusterings but often overlooks interactions between crucial samples and base clusterings. This neglect can introduce noise and lead to information loss and instability. To address these issues, we propose the Consensus Graph-Based Spectral Ensemble Clustering via Low-Rank Tensor Learning (SECGTL) model. SECGTL organizes base clusterings into a third-order tensor and applies the Fast Fourier Transform (FFT) to capture inter-relations in the frequency domain. By rotating the tensor and minimizing the Tensor Schatten p-norm, SECGTL extracts shared information in a low-rank space, reducing noise and enhancing the learned common graph. With Laplacian rank constraints, SECGTL directly learns a graph with c-connected components, representing the clustering structure without post-processing. Extensive experiments on real-world datasets demonstrate SECGTL’s superior performance and robustness to noise.
Authors
- Haonan Xin (ORCID: https://orcid.org/0000-0003-2473-4108)
- Rong Wang (ORCID: https://orcid.org/0000-0001-9240-6726)
- Jie Wang (ORCID: https://orcid.org/0000-0002-3023-3804)
- Zihua Zhao (ORCID: https://orcid.org/0000-0001-8611-8656)
- Zhe Cao (ORCID: https://orcid.org/0009-0005-3706-6446)
Institutions
- Northwestern Polytechnical University (CN)
Publication Details
- Published
- 2025-03-12
- DOI
- https://doi.org/10.1109/icassp49660.2025.10888176
- Primary Topic
- Tensor decomposition and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Research and Development