Search Results for author:
Found 2 papers, 1 papers with code
Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs
This paper presents two efficient hierarchical clustering (HC) algorithms with respect to Dasgupta's cost function.
Hierarchical Clustering: $O(1)$-Approximation for Well-Clustered Graphs
Hierarchical clustering studies a recursive partition of a data set into clusters of successively smaller size, and is a fundamental problem in data analysis.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
