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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Consensus Graph-Based Spectral Ensemble Clustering via Low-Rank Tensor Learning

Haonan Xin, Rong Wang, Jie Wang, Zihua Zhao et al.
1 links
Tensor decomposition and applications
article

Consensus Graph-Based Spectral Ensemble Clustering via Low-Rank Tensor Learning

Haonan Xin, Rong Wang, Jie Wang, Zihua Zhao, Zhe Cao
article en

Abstract

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.

Northwestern Polytechnical University (CN)
Research and Development
Openalex Percentile: Top 93%
Tensor decomposition and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.