.png){kind=icon}
Return
Efficient Anchor Graph Factorization for Multi-View Clustering
.png){kind=icon}
PRE
AI
DOI：10.1109/TMM.2023.3340095.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Due to the excellent interpretability of non-negative matrix factorization (NMF), NMF-based multi-view clustering has attracted much attention for multi-media data analysis and processing. However, the existing clustering methods leverage NMF to cluster data matrix, resulting in high computational complexity. Moreover, they are sub-optimal to exploit the complementary information between views because they all measure the between-views error pixel by pixel. To tackle this problem, inspired by orthogonal NMF and anchor graph, we present an efficient anchor graph factorization model with orthogonal, non-negative, and tensor low-rank constraints. We use an anchor graph instead of a data matrix to get an indicator matrix without post-processing, which remarkably reduces the computational complexity. To exploit the between-views complementary information well, we introduce tensor Schatten $p$-norm regularization on the third tensor, composed of soft label matrices of views. The solution can be obtained by iteratively optimizing four decoupled sub-problems, which can be solved more efficiently with good convergence. Through experimental results on the six multi-view datasets, our approach ensures the enhancement of clustering performance while improving efficiency.
Keywords:
Multi-view clustering
anchor graph
non-negative matrix factorisation
tensor Schatten p-norm
Journal
IF:
9.7
Papers:
4.6K
Citations:
2.4W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave
View more