Accelerated Sparse Subspace Clustering

10/31/2017
by   Abolfazl Hashemi, et al.
0

State-of-the-art algorithms for sparse subspace clustering perform spectral clustering on a similarity matrix typically obtained by representing each data point as a sparse combination of other points using either basis pursuit (BP) or orthogonal matching pursuit (OMP). BP-based methods are often prohibitive in practice while the performance of OMP-based schemes are unsatisfactory, especially in settings where data points are highly similar. In this paper, we propose a novel algorithm that exploits an accelerated variant of orthogonal least-squares to efficiently find the underlying subspaces. We show that under certain conditions the proposed algorithm returns a subspace-preserving solution. Simulation results illustrate that the proposed method compares favorably with BP-based method in terms of running time while being significantly more accurate than OMP-based schemes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/01/2019

Restricted Connection Orthogonal Matching Pursuit For Sparse Subspace Clustering

Sparse Subspace Clustering (SSC) is one of the most popular methods for ...
research
08/16/2017

Active Orthogonal Matching Pursuit for Sparse Subspace Clustering

Sparse Subspace Clustering (SSC) is a state-of-the-art method for cluste...
research
12/02/2015

Innovation Pursuit: A New Approach to Subspace Clustering

In subspace clustering, a group of data points belonging to a union of s...
research
08/16/2011

Exact Reconstruction Conditions for Regularized Modified Basis Pursuit

In this correspondence, we obtain exact recovery conditions for regulari...
research
03/05/2019

A Novel Efficient Approach with Data-Adaptive Capability for OMP-based Sparse Subspace Clustering

Orthogonal Matching Pursuit (OMP) plays an important role in data scienc...
research
08/22/2020

A Modified Orthogonal Matching Pursuit for Construction of Sparse Probabilistic Boolean Networks

The probabilistic Boolean network plays a remarkable role in the modelli...
research
04/24/2013

Locally linear representation for image clustering

It is a key to construct a similarity graph in graph-oriented subspace l...

Please sign up or login with your details

Forgot password? Click here to reset