mlsanityData to 7 Oct 2026

Spectral Clustering Based on Local PCA

arXiv 1301.2007 ↗First posted 9 Jan 2013stat.MLcited by 15

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Jan 2013.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 2; 2023: 3; 2024: 1; 2025: 2; 2026: 3.

15 papers.

Sort: