The Clustering Playground

Discover hidden structures in data using the K-Means algorithm.

Status: Ready

Iterations: 0

Total Inertia: 0.00

K-Means Intuition

  • Goal: Partition data into K clusters to minimize the variance within each cluster.
  • Step 1 (Assignment): Assign each point to the nearest centroid.
  • Step 2 (Update): Move centroids to the average position of their assigned points.
  • Interactive: Click on the canvas to add your own data points!