Explore modules

K-Means Clustering

Partitioning data into clusters by iteratively assigning points and updating centroids.

Free theory article

Partitioning data into clusters by iteratively assigning points and updating centroids.

Concept & interpretation

K-Means is the most widely used unsupervised learning algorithm. Given a set of unlabeled data points, it partitions them into k groups (clusters) such that points within each cluster are as close as possible to the cluster's center (centroid). The algorithm is remarkably simple — alternating between two steps: assigning each point to its nearest centroid, then moving each centroid to the mean of its assigned points — yet it is powerful enough to reveal structure in complex datasets.

Read the full free theory article