AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Spectral Clustering Based on Local PCA

Ery Arias-Castro, Gilad Lerman, Teng Zhang

JMLR 2017 · Learning theory and algorithms › Clustering · approach: Spectral clustering algorithms

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
decrease the intersection angle between two curves from pi/2 to pi/8Local PCA spectral clustering (Algorithm 4) · Two intersecting curvesmedian misclustering rate: 2.08% -> 27.87%Hurt
decrease intersection angle from pi/4 to pi/6Local PCA spectral clustering (Algorithm 4) · Two intersecting curvesrepeats with misclustering below 5%: 92 -> 32Hurt
use local PCA affinity (Algorithm 5) instead of SMCEface clustering · Extended Yale Face B, two subjectsmisclustering rate: 8.59% vs 8.59% on [1,2]; 11.72% vs 11.72% on [1,3]No clear effect
use local PCA affinity (Algorithm 5) instead of SMCE or LLEtwo intersecting curves · Two intersecting curves (300 points)qualitative clustering resultImproved
harder problems (monkey saddle, paraboloids) versus easier onesLocal PCA spectral clustering (Algorithm 4) · Artificial data setsmedian misclustering rate: 1.16% -> 9.73% and 10.42%Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy