liveBook · Manning

Clustering

As explained in Timeless Algorithms, The Foundational Ideas

Clustering is an unsupervised modeling technique that groups observations according to similarity without predefined labels.

When observations have no predefined labels, clustering seeks structure by grouping similar observations. Unlike supervised methods, it has no known outcome to predict; its groupings can instead support later analysis and decisions. section 5.3.4

Two common approaches construct those groupings differently:

  • K-means assigns observations to their nearest centroid, then iteratively updates centroids until assignments stabilize. section 5.3.4
  • Hierarchical clustering builds a dendrogram of nested groupings, either by successive merging or successive splitting. section 5.3.4

Both approaches group observations through geometric relationships in feature space, aiming for similar members within clusters and distinctions between clusters. Geometry does not directly measure how much uncertainty a grouping removes; information theory reframes evaluation around that question. section 5.3.4 section 5.3

Where clustering can reveal patterns

Applications include grouping customers by purchasing behavior, patients by clinical characteristics, and social-network members into communities. section 5.3.4

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Defines k-means and hierarchical clustering, contrasts their construction, and introduces entropy as an alternative evaluation perspective.
Examples
Illustrates customer purchasing segments, groups of clinically similar patients, and social-network communities.
What you can do after
Understand how clustering groups unlabeled observations and how entropy shifts evaluation toward uncertainty reduction.
How it connects
Connects unsupervised learning and feature-space geometry with k-means, hierarchical clustering, entropy, and information theory.

Also explained in

Compare how 24 books explain 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.