Spectral Clustering — Laplacian Embedding

Graph Laplacian eigenvectors reveal cluster structure. Click to add points; watch spectral embedding separate clusters impossible to split linearly.

Data Space
Spectral Embedding
Graph

Spectral Clustering

L = D - W
Lv = λv
k-means on {v₂,...,vₖ}
Points: 0
Click canvas to add