liveBook · Manning

Hierarchical clustering

As explained in Timeless Algorithms, The Foundational Ideas

Hierarchical clustering constructs nested groups by successively merging or splitting clusters.

Hierarchical clustering represents nested groups in a tree-like dendrogram, with progressively finer levels formed by successive merging (agglomerative clustering) or splitting (divisive clustering). Like k-means, it groups similar observations according to their geometric relationships in feature space; clustering does not directly measure uncertainty or informativeness. section 5.3.4

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Defines dendrograms and merging or splitting, but does not detail linkage criteria or implementation.
What you can do after
Understand how nested cluster structures can be formed by successive merging or splitting.
How it connects
Links clustering to k-means, geometric similarity in feature space, and entropy-based evaluation.

Also explained in

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