• Corpus ID: 215238970

Consistent and Complementary Graph Regularized Multi-view Subspace Clustering

  title={Consistent and Complementary Graph Regularized Multi-view Subspace Clustering},
  author={Qinghai Zheng and Jihua Zhu and Zhongyu Li and Shanmin Pang and Jun Wang and Lei Chen},
This study investigates the problem of multi-view clustering, where multiple views contain consistent information and each view also includes complementary information. Exploration of all information is crucial for good multi-view clustering. However, most traditional methods blindly or crudely combine multiple views for clustering and are unable to fully exploit the valuable information. Therefore, we propose a method that involves consistent and complementary graph-regularized multi-view… 

Figures and Tables from this paper



Consistent and Specific Multi-View Subspace Clustering

A novel multi-view subspace clustering method (CSMSC), where consistency and specificity are jointly exploited for subspace representation learning, and forms the multi-View self-representation property using a shared consistent representation and a set of specific representations, which better fits the real-world datasets.

Learning a Joint Affinity Graph for Multiview Subspace Clustering

A low-rank representation model is employed to learn a shared sample representation coefficient matrix to generate the affinity graph and diversity regularization is used to learn the optimal weights for each view, which can suppress the redundancy and enhance the diversity among different feature views.

Graph Structure Fusion for Multiview Clustering

The proposed method is based on the assumption that the intrinsic underlying graph structure would assign corresponding connected component in each graph to the same cluster, and obtains better clustering performance than the state-of-the-art methods.

Dual Shared-Specific Multiview Subspace Clustering

A novel dual shared-specific multiview subspace clustering (DSS-MSC) approach that simultaneously learns the correlations between shared information across multiple views and also utilizes view-specific information to depict specific property for each independent view is presented.

Co-regularized Multi-view Spectral Clustering

A spectral clustering framework is proposed that achieves this goal by co-regularizing the clustering hypotheses, and two co- regularization schemes are proposed to accomplish this.

GMC: Graph-Based Multi-View Clustering

The proposed general Graph-based Multi-view Clustering (GMC) takes the data graph matrices of all views and fuses them to generate a unified graph matrix, which helps partition the data points naturally into the required number of clusters.

Generalized Latent Multi-View Subspace Clustering

This work proposes a novel subspace clustering model for multi-view data using a latent representation termed Latent Multi-View Subspace Clustering (LMSC), which explores underlying complementary information from multiple views and simultaneously seeks the underlying latent representation.

Low-Rank Tensor Constrained Multiview Subspace Clustering

A low-rank tensor constraint is introduced to explore the complementary information from multiple views and, accordingly, a novel method called Low-rank Tensor constrained Multiview Subspace Clustering (LT-MSC) is established.

Parameter-Free Auto-Weighted Multiple Graph Learning: A Framework for Multiview Clustering and Semi-Supervised Classification

This paper proposes a novel framework via the reformulation of the standard spectral learning model, which can be used for multiview clustering and semisupervised tasks and achieves comparable performance with the state-of-the-art approaches.