Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Multiview Common Subspace Clustering via Coupled Low Rank Representation

View through CrossRef
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.
Title: Multiview Common Subspace Clustering via Coupled Low Rank Representation
Description:
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.

Related Results

Optimization algorithm for omic data subspace clustering
Optimization algorithm for omic data subspace clustering
Subspace clustering identifies multiple feature subspaces embedded in a dataset together with the underlying sample clusters. When applied to omic data, subspace clustering is a ch...
Weighted Multiview K-Means Clustering with L2 Regularization
Weighted Multiview K-Means Clustering with L2 Regularization
In the era of big data, cloud, internet of things, virtual communities, and interconnected networks, the prominence of multiview data is undeniable. This type of data encapsulates ...
A Proposed Clustering Algorithm for Efficient Clustering of High-Dimensional Data
A Proposed Clustering Algorithm for Efficient Clustering of High-Dimensional Data
To partition transaction data values, clustering algorithms are used. To analyse the relationships between transactions, similarity measures are utilized. Similarity models based o...
Projective Low-rank Subspace Clustering via Learning Deep Encoder
Projective Low-rank Subspace Clustering via Learning Deep Encoder
Low-rank subspace clustering (LRSC) has been considered as the state-of-the-art method on small datasets. LRSC constructs a desired similarity graph by low-rank representation (LRR...
On Subspace-recurrent Operators
On Subspace-recurrent Operators
In this article, subspace-recurrent operators are presented and it is showed that the set of subspace-transitive operators is a strict subset of the set of subspace-recurrent opera...
Multiview subspace clustering via low‐rank correlation analysis
Multiview subspace clustering via low‐rank correlation analysis
Abstract In order to explore multi‐view data, existing low‐rank‐based multi‐view subspace clustering methods seek a common low‐rank structure from different views...
Low Rank Correlation Representation and Clustering
Low Rank Correlation Representation and Clustering
Correlation learning is a technique utilized to find a common representation in cross-domain and multiview datasets. However, most existing methods are not robust enough to handle ...
Frequency of Common Chromosomal Abnormalities in Patients with Idiopathic Acquired Aplastic Anemia
Frequency of Common Chromosomal Abnormalities in Patients with Idiopathic Acquired Aplastic Anemia
Objective: To determine the frequency of common chromosomal aberrations in local population idiopathic determine the frequency of common chromosomal aberrations in local population...

Back to Top