Playground / Unsupervised
Clustering
k-means, e-means, DBSCAN, Gaussian mixtures and agglomerative clustering. Read the theory →
Puzzle: k-means meets two moons. Press Train and watch it cut them in half, then find a model that follows density instead.
Click the plot to add a point.
Train a model to see its loss curve.
| Step - | train ━ | test ┅ |
|---|
colour = cluster · ✕ = noise · ● train ○ test
Press Train. The verdict appears here.