DeepAI AI Chat
Log In Sign Up

Achieving stable subspace clustering by post-processing generic clustering results

by   Duc-Son Pham, et al.

We propose an effective subspace selection scheme as a post-processing step to improve results obtained by sparse subspace clustering (SSC). Our method starts by the computation of stable subspaces using a novel random sampling scheme. Thus constructed preliminary subspaces are used to identify the initially incorrectly clustered data points and then to reassign them to more suitable clusters based on their goodness-of-fit to the preliminary model. To improve the robustness of the algorithm, we use a dominant nearest subspace classification scheme that controls the level of sensitivity against reassignment. We demonstrate that our algorithm is convergent and superior to the direct application of a generic alternative such as principal component analysis. On several popular datasets for motion segmentation and face clustering pervasively used in the sparse subspace clustering literature the proposed method is shown to reduce greatly the incidence of clustering errors while introducing negligible disturbance to the data points already correctly clustered.


page 1

page 2

page 3

page 4


Graph Connectivity in Noisy Sparse Subspace Clustering

Subspace clustering is the problem of clustering data points into a unio...

A Theoretical Analysis of Noisy Sparse Subspace Clustering on Dimensionality-Reduced Data

Subspace clustering is the problem of partitioning unlabeled data points...

Unbiased Sparse Subspace Clustering By Selective Pursuit

Sparse subspace clustering (SSC) is an elegant approach for unsupervised...

Segmentation of Facial Expressions Using Semi-Definite Programming and Generalized Principal Component Analysis

In this paper, we use semi-definite programming and generalized principa...

Non-Negative Local Sparse Coding for Subspace Clustering

Subspace sparse coding (SSC) algorithms have proven to be beneficial to ...

Subspace Clustering with Active Learning

Subspace clustering is a growing field of unsupervised learning that has...

A highly likely clusterable data model with no clusters

We propose a model for a dataset in R^D that does not contain any clust...