← Search

Jakub Lacki

3 accepted papers

2024

Efficient Centroid-Linkage Clustering

NeurIPS 2024poster

We give an algorithm for Centroid-Linkage Hierarchical Agglomerative Clustering (HAC), which computes a $c$-approximate clustering in roughly $n^{1+O(1/c^2)}$ time. We obtain our result by combining a new centroid-linkage HAC algorithm with a novel fully dynamic data structure for nearest neighbor s…

Cited by 1SourcePDFScholar
2022

Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth

NeurIPS 2022accept

Obtaining scalable algorithms for \emph{hierarchical agglomerative clustering} (HAC) is of significant interest due to the massive size of real-world datasets. At the same time, efficiently parallelizing HAC is difficult due to the seemingly sequential nature of the algorithm. In this paper, we addr…

Cited by 17SourcePDFScholar