liveBook · Manning

K-means clustering

As explained in Timeless Algorithms, The Foundational Ideas

K-means clustering partitions observations into a specified number of groups by assigning them to the nearest centroid and iteratively updating the centroids.

K-means clustering finds groupings in unlabeled data by assigning each observation to its nearest centroid, then iteratively updating the centroids until assignments stabilize. It partitions observations into a specified number of groups, aiming for similar observations within each cluster and distinct observations across clusters. This geometric objective does not directly measure how much uncertainty the clusters eliminate or how informative they are. section 5.3.4

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Explains nearest-centroid assignment, iterative centroid updates, and the geometric goal of within-cluster similarity and between-cluster distinction.
Examples
Illustrates clustering with customer purchasing behavior, patient characteristics, and social-network communities.
What you can do after
Understand how nearest-centroid assignments and iterative updates produce geometric clusters from unlabeled data.
How it connects
Connects k-means to unsupervised learning, centroids, feature-space geometry, hierarchical clustering, and entropy-based evaluation.

Also explained in

Compare how 12 books explain K-means clustering →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Timeless Algorithms, The Foundational Ideas. The section links point to the parts of the book it draws on.