AI engineering glossary · Classical ML algorithms
What is spectral clustering?
Spectral clustering: A clustering method that builds a graph of point similarities, computes eigenvectors of its Laplacian matrix, and runs k-means on those eigenvectors. It can separate non-convex shapes such as intertwined rings that k-means cannot.
Spectral clustering: an example
Two concentric circles of points are separated correctly, though a straight-line centre method would mix them.
Related terms
- K-means
- Eigenvalue
- Graph Laplacian
- Hierarchical clustering
More Classical ML algorithms terms
- Stacking
- Support
- Support vector
- Support vector machine
- Support vector regression
- t-SNE
- Tree pruning
- Truncated SVD
Where you learn it
Spectral clustering is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.