ParChain: a framework for parallel hierarchical agglomerative clustering using nearest-neighbor chain
<jats:p>This paper studies the hierarchical clustering problem, where the goal is to produce a dendrogram that represents clusters at varying scales of a data set. We propose the ParChain framework for designing parallel hierarchical agglomerative clustering (HAC) algorithms, and using the fra...
Main Authors: | Yu, Shangdi, Wang, Yiqiu, Gu, Yan, Dhulipala, Laxman, Shun, Julian |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
VLDB Endowment
2022
|
Online Access: | https://hdl.handle.net/1721.1/143883 |
Similar Items
-
ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
by: Yu, Shangdi
Published: (2022) -
ParGeo: A Library for Parallel Computational Geometry
by: Wang, Yiqiu, et al.
Published: (2022) -
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering
by: Tseng, Tom, et al.
Published: (2022) -
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
by: Wang, Yiqiu, et al.
Published: (2022) -
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
by: Wang, Yiqiu, et al.
Published: (2022)