← Back to Study Guide

K-Means Clustering

Interactive clustering with animated centroid updates

Chapter 22 · Clustering

How It Works

K-Means alternates between two steps: assign each point to the nearest centroid, then update each centroid to the mean of its assigned points. The algorithm converges when no points change assignment. Use Step to watch each iteration, or Run to animate the full process.

Iteration
0
WCSS (Inertia)
--
Converged
No
K
3
Event Log