Theory of Spectral Method for Union of Subspaces-Based Random Geometry Graph

07/25/2019
by   Gen Li, et al.
0

Spectral Method is a commonly used scheme to cluster data points lying close to Union of Subspaces by first constructing a Random Geometry Graph, called Subspace Clustering. This paper establishes a theory to analyze this method. Based on this theory, we demonstrate the efficiency of Subspace Clustering in fairly broad conditions. The insights and analysis techniques developed in this paper might also have implications for other random graph problems. Numerical experiments demonstrate the effectiveness of our theoretical study.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/15/2015

Group-Invariant Subspace Clustering

In this paper we consider the problem of group invariant subspace cluste...
research
06/11/2022

Convergence and Recovery Guarantees of the K-Subspaces Method for Subspace Clustering

The K-subspaces (KSS) method is a generalization of the K-means method f...
research
06/07/2020

Self-Representation Based Unsupervised Exemplar Selection in a Union of Subspaces

Finding a small set of representatives from an unlabeled dataset is a co...
research
11/11/2018

Analysis vs Synthesis with Structure - An Investigation of Union of Subspace Models on Graphs

We consider the problem of characterizing the `duality gap' between spar...
research
07/14/2019

Compressed Subspace Learning Based on Canonical Angle Preserving Property

A standard way to tackle the challenging task of learning from high-dime...
research
04/25/2018

RULLS: Randomized Union of Locally Linear Subspaces for Feature Engineering

Feature engineering plays an important role in the success of a machine ...
research
10/08/2020

A Critique of Self-Expressive Deep Subspace Clustering

Subspace clustering is an unsupervised clustering technique designed to ...

Please sign up or login with your details

Forgot password? Click here to reset