Multi-view Low-rank Sparse Subspace Clustering

08/29/2017
by   Maria Brbic, et al.
0

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 data. This paper presents an approach to multi-view subspace clustering that learns a joint subspace representation by constructing affinity matrix shared among all views. Relying on the importance of both low-rank and sparsity constraints in the construction of the affinity matrix, we introduce the objective that balances between the agreement across different views, while at the same time encourages sparsity and low-rankness of the solution. Related low-rank and sparsity constrained optimization problem is for each view solved using the alternating direction method of multipliers. Furthermore, we extend our approach to cluster data drawn from nonlinear subspaces by solving the corresponding problem in a reproducing kernel Hilbert space. The proposed algorithm outperforms state-of-the-art multi-view subspace clustering algorithms on one synthetic and four real-world datasets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/30/2019

Feature Concatenation Multi-view Subspace Clustering

Many multi-view clustering methods have been proposed with the popularit...
research
05/21/2022

Enriched Robust Multi-View Kernel Subspace Clustering

Subspace clustering is to find underlying low-dimensional subspaces and ...
research
01/01/2022

Multi-view Subspace Adaptive Learning via Autoencoder and Attention

Multi-view learning can cover all features of data samples more comprehe...
research
12/16/2019

Latent Complete Row Space Recovery for Multi-view Subspace Clustering

Multi-view subspace clustering has been applied to applications such as ...
research
01/01/2018

Error-Robust Multi-View Clustering

In the era of big data, data may come from multiple sources, known as mu...
research
03/21/2019

Latent Simplex Position Model: High Dimensional Multi-view Clustering with Uncertainty Quantification

High dimensional data often contain multiple facets, and several cluster...
research
08/23/2020

Unsupervised Multi-view Clustering by Squeezing Hybrid Knowledge from Cross View and Each View

Multi-view clustering methods have been a focus in recent years because ...

Please sign up or login with your details

Forgot password? Click here to reset