Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
This paper presents new parallel algorithms for generating Euclidean minimum spanning trees and spatial clustering hierarchies (known as HDBSCAN$^*$). Our approach is based on generating a well-separated pair decomposition followed by using Kruskal's minimum spanning tree algorithm and bichr...
| Huvudupphovsmän: | , , , |
|---|---|
| Materialtyp: | Artikel |
| Språk: | English |
| Publicerad: |
Association for Computing Machinery (ACM)
2022
|
| Länkar: | https://hdl.handle.net/1721.1/143884 |