Skip to content
Ephizen logo ephizen / wiki

k-Means Clustering

An unsupervised algorithm that partitions n points into k clusters by iteratively assigning points to the nearest centroid and moving centroids to the mean of their cluster.

Classical ML
BACKLOG · WORK IN PROGRESS

This term is being written.

The metadata and shape of this page are stable, but the body content isn't ready yet. We'll publish it once it meets the bar of teaching something new with worked examples and real tools.

Back to wiki Track progress on GitHub