Spectral Clustering

hard
Unit 20 · Clustering & Regression0/0 to milestone

k-means can only find round blobs. Spectral clustering (Ng, Jordan & Weiss) clusters by graph connectivity instead, so it can separate two concentric rings.

Pro problem

Unlock this and every premium problem across all tracks — plus hidden-test grading, advanced AI engineering modules and new content every week.

Start 7-day free trial
solution.py · Python 3.13
Run your code to see results. ⌘↵ to run · ⌘⇧↵ to submit
Spectral Clustering · TechGradify