How It Works
K-means clustering is an unsupervised learning algorithm that groups similar data points together. The algorithm works by:
- Randomly initializing K centroids
- Assigning each point to the nearest centroid
- Moving centroids to the average position of their assigned points
- Repeating steps 2-3 until convergence
Interactive Features
- Adjust animation speed to control the clustering process
- Use spray mode to add points by clicking and dragging
- Modify spray density and radius for different point distributions
- Change the number of clusters (K) to see different groupings