Multi-View Subspace Clustering
For many computer vision applications, the data sets distribute on certain low-dimensional subspaces. Subspace clustering is to find such underlying subspaces and cluster the data points correctly. In this paper, we propose a novel multi-view subspace clustering method. The proposed method performs clustering on the subspace representation of each view simultaneously. Meanwhile, we propose to use a common cluster structure to guarantee the consistence among different views. In addition, an efficient algorithm is proposed to solve the problem. Experiments on four benchmark data sets have been performed to validate our proposed method. The promising results demonstrate the effectiveness of our method.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringMulti-view Subspace ClusteringSimilar Papers 제목 키워드 기반
Multi-view Subspace Clustering Networks with Local and Global Graph Information
This study investigates the problem of multi-view subspace clustering, the goal of which is to explore the underlying grouping structure of data collected from different fields or measurements. Since data do not always c…
ClusteringMulti-view Subspace ClusteringMulti-view Subspace Adaptive Learning via Autoencoder and Attention
Multi-view learning can cover all features of data samples more comprehensively, so multi-view learning has attracted widespread attention. Traditional subspace clustering methods, such as sparse subspace clustering (SSC…
ClusteringMULTI-VIEW LEARNINGEnriched Robust Multi-View Kernel Subspace Clustering
Subspace clustering is to find underlying low-dimensional subspaces and cluster the data points correctly. In this paper, we propose a novel multi-view subspace clustering method. Most existing methods suffer from two cr…
ClusteringMulti-view Subspace ClusteringSeeking Commonness and Inconsistencies: A Jointly Smoothed Approach to Multi-view Subspace Clustering
Multi-view subspace clustering aims to discover the hidden subspace structures from multiple views for robust clustering, and has been attracting considerable attention in recent years. Despite significant progress, most…
ClusteringMulti-view Subspace ClusteringRepresentation LearningMulti-view Low-rank Sparse Subspace Clustering
Most existing approaches address multi-view subspace clustering problem by constructing the affinity matrix on each view separately and afterwards propose how to extend spectral clustering algorithm to handle multi-view …
ClusteringMulti-view Subspace Clustering