๐ŸŽฏ K-Means Clustering

Pointsโ€”
Iteration0
Inertia (WCSS)โ€”
ConvergedNo
Algorithm:
1. Place k centroids randomly
2. Assign each point to nearest centroid
3. Move centroids to cluster mean
4. Repeat until no change
WCSS = ฮฃ|xแตข โˆ’ ฮผ_cluster|ยฒ

Related simulations

๐Ÿค– K-Means Clustering โ€” Machine Learning Visualiser ๐Ÿ“Š Decision Tree Live ๐ŸŽฎ Reinforcement Learning ๐Ÿ—บ๏ธ Self-Organising Map ๐Ÿ“Š PCA & SVD Visualiser โ€” Principal Component Analysis Interactive ๐ŸŽญ Stippling & Pointillism