liveBook · Manning

Dendrogram

As explained in Advanced Algorithms and Data Structures

A dendrogram is a tree diagram that represents the hierarchical arrangement of clusters.

A dendrogram represents hierarchical clustering as a tree-like, stratified structure. Unlike a flat clustering, it preserves multiple partitioning levels, allowing you to inspect a selected section and recover the clustering associated with that level. section 12.4.4

Use the structure to reason about clustering choices:

  • Read merges as increasingly broad clusters formed from smaller units. section 12.4.4
  • Select a threshold or section to obtain a flat clustering at that level. section 12.4.4
  • Apply different thresholds to different branches when one global threshold cannot preserve every desired separation. section 12.4.4

OPTICS clustering

For an example dataset, OPTICS uses ϵMAX=2.0 and minPoints=3 to produce a dendrogram. Clusters formed at ϵ=0.5 serve as basic units, while larger super-clusters represent later merges. section 12.4.4

Figure 12.23 The dendrogram built from the result produced by OPTICS, on our example dataset, with parameters ϵMAX=2.0 and minPoints=3. For the sake of clarity, we omit the bottom portion of the dendrogram for ϵ<0.5. Here we apply two different thresholds in two branches of the dendrogram.

Inspect how two different thresholds are applied in separate dendrogram branches. section 12.4.4

How Advanced Algorithms and Data Structures covers it

How deep it goes
Explains tree structure, cluster merges, threshold selection, and branch-specific thresholds, without detailing construction internals.
Examples
Uses an OPTICS result with ϵMAX=2.0, minPoints=3, clusters C1–C7, and super-clusters CA–CF.
What it assumes
Assumes familiarity with clustering, while relating hierarchical results to flat clustering and OPTICS outputs.
What you can do after
Evaluate hierarchical cluster structure and select flat clusterings by inspecting sections or applying thresholds.
How it connects
Connects hierarchical clustering with OPTICS, reachability plots, flat clustering, thresholds, and DBSCAN.

Also explained in

Compare how 3 books explain dendrogram →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Advanced Algorithms and Data Structures. The section links point to the parts of the book it draws on.