Clustering and latent structure · MLD-1151
Spectral clustering
Clustering using eigenvectors of a similarity graph's matrix representation.
Original reference page · detailed expansion pending. Original definitions, examples, notes and citations are preserved below. New examples are illustrative, not benchmark results.
Original example
Separate nonconvex clusters with graph connectivity.
Original caveat
Similarity construction and matrix size are important bottlenecks.
Context and aliases
Level: Intermediate. Stages: Training · Data · Evaluation.
Tags: ML · DL.
Aliases: None recorded.
Related concepts
Concepts linking here
Original references
- scikit-learn: clustering ↗ · Reference link
- scikit-learn: matrix decomposition ↗ · Reference link
- scikit-learn: manifold learning ↗ · Reference link
- scikit-learn: novelty and outlier detection ↗ · Reference link
- Original reference URL ↗