Spectral Clustering Based on Local PCA

01/09/2013
by   Ery Arias-Castro, et al.
0

We propose a spectral clustering method based on local principal components analysis (PCA). After performing local PCA in selected neighborhoods, the algorithm builds a nearest neighbor graph weighted according to a discrepancy between the principal subspaces in the neighborhoods, and then applies spectral clustering. As opposed to standard spectral methods based solely on pairwise distances between points, our algorithm is able to resolve intersections. We establish theoretical guarantees for simpler variants within a prototypical mathematical framework for multi-manifold clustering, and evaluate our algorithm on various simulated data sets.

READ FULL TEXT
research
01/08/2010

Spectral clustering based on local linear approximations

In the context of clustering, we assume a generative model where each cl...
research
02/22/2023

Refining a k-nearest neighbor graph for a computationally efficient spectral clustering

Spectral clustering became a popular choice for data clustering for its ...
research
09/12/2009

Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions

In the context of clustering, we consider a generative model in a Euclid...
research
10/23/2022

Local and Global Structure Preservation Based Spectral Clustering

Spectral Clustering (SC) is widely used for clustering data on a nonline...
research
02/24/2021

Two-way kernel matrix puncturing: towards resource-efficient PCA and spectral clustering

The article introduces an elementary cost and storage reduction method f...
research
12/03/2010

An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA

Many problems in machine learning and statistics can be formulated as (g...
research
03/04/2014

The Hidden Convexity of Spectral Clustering

In recent years, spectral clustering has become a standard method for da...

Please sign up or login with your details

Forgot password? Click here to reset