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
Hierarchical clustering
Hierarchical clustering constructs nested groups by successively merging or splitting clusters.
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
-
Data Without LabelsHierarchical clustering is a clustering method that constructs a nested hierarchy of groups by successively merging or splitting clusters.
-
Statistics Slam DunkHierarchical clustering is a clustering method that builds a nested hierarchy of groups based on similarity or distance.
-
Build a Robo-Advisor with Python (From Scratch)Hierarchical clustering is a clustering technique that organizes objects into progressively combined or subdivided groups according to a distance measure.
-
Build AI Drug Discovery PipelinesHierarchical clustering is a clustering technique that builds a hierarchy of nested groups by iteratively merging or splitting clusters.
-
Advanced Algorithms and Data StructuresHierarchical clustering is a clustering technique that forms nested groups by successively merging or dividing clusters.
-
Domain-Specific Small Language ModelsA clustering approach that builds communities through repeated refinement and aggregation of grouped items.
-
Grokking Machine Learning, Second EditionHierarchical clustering is a clustering algorithm that progressively groups the closest data points or existing groups into a hierarchy.
Compare how 8 books explain hierarchical clustering →
Related concepts
- K-means clusteringcontrasts with · K-means clustering is an algorithm that partitions data into a specified number of clusters by iteratively assigning observations to the nearest centroid and updating each centroid to the mean of its assigned observations.
- OPTICSincludes · OPTICS is a density-based clustering algorithm that orders points and computes reachability distances to reveal cluster structure across varying density thresholds.
- unsupervised learningkind of · Unsupervised learning is a machine-learning approach that discovers patterns, structure, or representations in data without labeled target outputs.
- clusteringkind of · Clustering is the process of grouping data items so that items within a group are more similar to one another than to items in other groups.
- agglomerative clusteringincludes · Agglomerative clustering is a bottom-up hierarchical clustering method that starts with individual items as separate clusters and repeatedly merges clusters according to a linkage criterion.
- dendrogramproduces · A dendrogram is a tree diagram that represents hierarchical relationships among items or nested clusters, including the levels at which they merge or split.
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.







