2023
Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs
ICML 2023poster
This paper presents two efficient hierarchical clustering (HC) algorithms with respect to Dasgupta's cost function. For any input graph $G$ with a clear cluster-structure, our designed algorithms run in nearly-linear time in the input size of $G$, and return an $O(1)$-approximate HC tree with respec…