Back to Search Start Over

Multiview Common Subspace Clustering via Coupled Low Rank Representation.

Authors :
Abhadiomhen, Stanley Ebhohimhen
Wang, Zhiyang
Shen, Xiangjun
Fan, Jianping
Source :
ACM Transactions on Intelligent Systems & Technology. Aug2021, Vol. 12 Issue 4, p1-25. 25p.
Publication Year :
2021

Abstract

Multi-view subspace clustering (MVSC) finds a shared structure in latent low-dimensional subspaces of multi-view data to enhance clustering performance. Nonetheless, we observe that most existing MVSC methods neglect the diversity in multi-view data by considering only the common knowledge to find a shared structure either directly or by merging different similarity matrices learned for each view. In the presence of noise, this predefined shared structure becomes a biased representation of the different views. Thus, in this article, we propose a MVSC method based on coupled low-rank representation to address the above limitation. Our method first obtains a low-rank representation for each view, constrained to be a linear combination of the view-specific representation and the shared representation by simultaneously encouraging the sparsity of view-specific one. Then, it uses the k-block diagonal regularizer to learn a manifold recovery matrix for each view through respective low-rank matrices to recover more manifold structures from them. In this way, the proposed method can find an ideal similarity matrix by approximating clustering projection matrices obtained from the recovery structures. Hence, this similarity matrix denotes our clustering structure with exactly k connected components by applying a rank constraint on the similarity matrix's relaxed Laplacian matrix to avoid spectral post-processing of the low-dimensional embedding matrix. The core of our idea is such that we introduce dynamic approximation into the low-rank representation to allow the clustering structure and the shared representation to guide each other to learn cleaner low-rank matrices that would lead to a better clustering structure. Therefore, our approach is notably different from existing methods in which the local manifold structure of data is captured in advance. Extensive experiments on six benchmark datasets show that our method outperforms 10 similar state-of-the-art compared methods in six evaluation metrics. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
21576904
Volume :
12
Issue :
4
Database :
Academic Search Index
Journal :
ACM Transactions on Intelligent Systems & Technology
Publication Type :
Academic Journal
Accession number :
154614138
Full Text :
https://doi.org/10.1145/3465056