> ML_ALGORITHM // HIERARCHICAL-AGGLOMERATIVE-CLUSTERING_v1.0
Hierarchical Agglomerative Clustering (Ward / Complete Linkage)
Bottom-up hierarchical clustering that iteratively merges nearest cluster pairs based on variance-minimizing linkage criteria.
Hierarchical Clusteringclassical-unsupervisedhigh-intrinsicsmall (<1k)
Back to All AlgorithmsComputational Complexity
Training Complexity:O(n^2) memory and O(n^2 * log n) time
Inference Complexity:Non-parametric tree traversal
Hardware Profile
CPU Friendly:Yes
Requires GPU:No
Memory Footprint:high
Interpretability & Data
Interpretability Tier:high-intrinsic
Training Data Needs:small (<1k)
Interpretability Assessment
Dendrogram tree visualization reveals the full multi-scale hierarchy of data groupings.
Suitable Tasks & Supported Modalities
Suitable Tasks:
clusteringtaxonomy induction
Supported Modalities:
tabular
Implementing Libraries
Foundational Literature
Common Pitfalls & Warnings
- Attempting to fit on datasets exceeding 50,000 samples causes severe O(n^2) RAM out-of-memory crashes