Noisy ℓ^0-Sparse Subspace Clustering on Dimensionality Reduced Data

06/22/2022
by   Yingzhen Yang, et al.
0

Sparse subspace clustering methods with sparsity induced by ℓ^0-norm, such as ℓ^0-Sparse Subspace Clustering (ℓ^0-SSC) <cit.>, are demonstrated to be more effective than its ℓ^1 counterpart such as Sparse Subspace Clustering (SSC) <cit.>. However, the theoretical analysis of ℓ^0-SSC is restricted to clean data that lie exactly in subspaces. Real data often suffer from noise and they may lie close to subspaces. In this paper, we show that an optimal solution to the optimization problem of noisy ℓ^0-SSC achieves subspace detection property (SDP), a key element with which data from different subspaces are separated, under deterministic and semi-random model. Our results provide theoretical guarantee on the correctness of noisy ℓ^0-SSC in terms of SDP on noisy data for the first time, which reveals the advantage of noisy ℓ^0-SSC in terms of much less restrictive condition on subspace affinity. In order to improve the efficiency of noisy ℓ^0-SSC, we propose Noisy-DR-ℓ^0-SSC which provably recovers the subspaces on dimensionality reduced data. Noisy-DR-ℓ^0-SSC first projects the data onto a lower dimensional space by random projection, then performs noisy ℓ^0-SSC on the projected data for improved efficiency. Experimental results demonstrate the effectiveness of Noisy-DR-ℓ^0-SSC.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/05/2013

Noisy Sparse Subspace Clustering

This paper considers the problem of subspace clustering under noise. Spe...
research
10/24/2016

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

Subspace clustering is the problem of partitioning unlabeled data points...
research
04/04/2015

Graph Connectivity in Noisy Sparse Subspace Clustering

Subspace clustering is the problem of clustering data points into a unio...
research
01/11/2013

Robust subspace clustering

Subspace clustering refers to the task of finding a multi-subspace repre...
research
08/05/2016

Sparse Subspace Clustering via Diffusion Process

Subspace clustering refers to the problem of clustering high-dimensional...
research
06/20/2015

Filtrated Algebraic Subspace Clustering

Subspace clustering is the problem of clustering data that lie close to ...
research
02/02/2020

Provable Noisy Sparse Subspace Clustering using Greedy Neighbor Selection: A Coherence-Based Perspective

Sparse subspace clustering (SSC) using greedy-based neighbor selection, ...

Please sign up or login with your details

Forgot password? Click here to reset