liveBook · Manning

Dendrogram

As explained in Statistics Slam Dunk

A dendrogram is a branching diagram that represents hierarchical relationships or nested cluster structure.

A dendrogram is an upside-down tree that displays the hierarchy formed by clustering similar observations. Hierarchical clustering begins with one cluster per observation, repeatedly merges clusters, and ends with one overall cluster. The diagram makes those nested relationships visible without requiring an outcome variable. section 3.9

NBA draft picks and career success

A dendrogram can group first-round NBA draft selections according to pick number and average career win shares. In the resulting plot, the leaves identify selection numbers, while branch height indicates Euclidean distance. Cutting the tree into two groups with rect.hclust(..., k = 2) highlights a broad segmentation of picks based on those two measures. The analysis is useful for discovering structure, but hierarchical clustering can become slow on large data sets. section 3.9

How Statistics Slam Dunk covers it

How deep it goes
Explains the merge process, Euclidean distances, complete linkage, plotting, and cluster cuts without deriving clustering internals.
Examples
Uses NBA first-round pick numbers, average career win shares, a distance matrix, and a two-cluster dendrogram.
What it assumes
Assumes basic data exploration and introduces segmentation as grouping observations by shared characteristics.
What you can do after
Build it from scratch in R by preparing variables, calculating distances, fitting hierarchical clustering, plotting the tree, and selecting clusters.
How it connects
Connects dendrograms with hierarchical clustering, unsupervised learning, Euclidean distance, segmentation analysis, and k-means.

Also explained in

Compare how 3 books explain dendrogram →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Statistics Slam Dunk. The section links point to the parts of the book it draws on.