Hierarchical clustering algorithms.
The attribute dendrogram_ gives the dendrogram.
A dendrogram is an array of size (n − 1) × 4 representing the successive merges of nodes. Each row gives the two merged nodes, their distance and the size of the resulting cluster. Any new node resulting from a merge takes the first available index (e.g., the first merge corresponds to node n).
sknetwork.hierarchy.Paris
sknetwork.hierarchy.LouvainHierarchy
sknetwork.hierarchy.Ward
sknetwork.hierarchy.dasgupta_cost
sknetwork.hierarchy.dasgupta_score
sknetwork.hierarchy.tree_sampling_divergence
sknetwork.hierarchy.cut_straight
sknetwork.hierarchy.cut_balanced