.png){kind=icon}
.png){kind=icon}
Return
Learning Idempotent Representation for Subspace Clustering
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2023.3303343.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The critical point for the success of spectral-type subspace clustering algorithms is to seek reconstruction coefficient matrices that can faithfully reveal the subspace structures of data sets. An ideal reconstruction coefficient matrix should have two properties: 1) it is block-diagonal with each block indicating a subspace; 2) each block is fully connected. We find that a normalized membership matrix naturally satisfies the above two conditions. Therefore, in this paper, we devise an idempotent representation (IDR) algorithm to pursue reconstruction coefficient matrices approximating normalized membership matrices. IDR designs a new idempotent constraint. And by combining the doubly stochastic constraints, the coefficient matrices which are close to normalized membership matrices could be directly achieved. We present an optimization algorithm for solving IDR problem and analyze its computation burden as well as convergence. The comparisons between IDR and related algorithms show the superiority of IDR. Plentiful experiments conducted on both synthetic and real-world datasets prove that IDR is an effective subspace clustering algorithm.
Keywords:
Clustering algorithms
Sparse matrices
Optimization
Laplace equations
Synthetic data
Convergence
Computational modeling
Subspace clustering
idempotent matrix
doubly stochastic constraint
normalized membership matrix
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W