How deeply does Domain-Specific Small Language Models cover hierarchical clustering?

Explains the move-refine-aggregate loop and modularity gain, but stops short of a full validated implementation.

Hierarchical clustering

As explained in Domain-Specific Small Language Models

A clustering approach that builds communities through repeated refinement and aggregation of grouped items.

Builds communities by starting from singleton partitions, moving nodes to improve quality, refining the partition, then aggregating and repeating until improvement stops. section 14.1 section 14.1

Here, it serves community detection for GraphRAG indexing, where better-separated clusters support later summarization and query answering. section 14.1 section 14.1

Key implementation points shown here:

Starts from a singleton partition with each node in its own community. section 14.1
Moves nodes between communities using modularity gain as the score. section 14.1
Refines the partition before building the aggregated network. section 14.1
Repeats move and aggregate steps until no further improvement is possible. section 14.1

GraphRAG community detection

A Python implementation computes modularity gain, aggregates communities, runs Leiden on the combined graph, then groups nodes into community text for summarization. section 14.1 section 14.1

How Domain-Specific Small Language Models covers it

Cover of Domain-Specific Small Language Models

liveBook manning.com

Read Domain-Specific Small Language Models on liveBook Get the book at manning.com

Also explained in

liveBook manning.com

Data Without LabelsHierarchical clustering is a clustering method that constructs a nested hierarchy of groups by successively merging or splitting clusters.
liveBook manning.com

Statistics Slam DunkHierarchical clustering is a clustering method that builds a nested hierarchy of groups based on similarity or distance.
liveBook manning.com

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.
liveBook manning.com

Advanced Algorithms and Data StructuresHierarchical clustering is a clustering technique that forms nested groups by successively merging or dividing clusters.

Compare how 5 books explain hierarchical clustering →

Related concepts

K-means clusteringcontrasts with · K-means clustering partitions data into a specified number of groups by assigning observations to representative centers and iteratively updating those centers to reduce within-group distances.
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 technique of grouping data items according to similarity or shared characteristics.
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.

This explainer was generated by Manning's knowledge graph from the text of Domain-Specific Small Language Models. The section links point to the parts of the book it draws on.