Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering

04/02/2021
by   Yiqiu Wang, et al.
0

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 bichromatic closest pair computations. We introduce a new notion of well-separation to reduce the work and space of our algorithm for HDBSCAN^*. We also present a parallel approximate algorithm for OPTICS based on a recent sequential algorithm by Gan and Tao. Finally, we give a new parallel divide-and-conquer algorithm for computing the dendrogram and reachability plots, which are used in visualizing clusters of different scale that arise for both EMST and HDBSCAN^*. We show that our algorithms are theoretically efficient: they have work (number of operations) matching their sequential counterparts, and polylogarithmic depth (parallel time). We implement our algorithms and propose a memory optimization that requires only a subset of well-separated pairs to be computed and materialized, leading to savings in both space (up to 10x) and time (up to 8x). Our experiments on large real-world and synthetic data sets using a 48-core machine show that our fastest algorithms outperform the best serial algorithms for the problems by 11.13–55.89x, and existing parallel algorithms by at least an order of magnitude.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/12/2019

Theoretically-Efficient and Practical Parallel DBSCAN

The DBSCAN method for spatial clustering has received significant attent...
research
07/11/2014

Density Adaptive Parallel Clustering

In this paper we are going to introduce a new nearest neighbours based a...
research
05/14/2020

Parallel Minimum Spanning Tree Algorithms and Evaluation

Minimum Spanning Tree (MST) is an important graph algorithm that has wid...
research
01/19/2018

Minimum spanning tree release under differential privacy constraints

We investigate the problem of nodes clustering under privacy constraints...
research
03/10/2023

Clustering with minimum spanning trees: How good can it be?

Minimum spanning trees (MSTs) provide a convenient representation of dat...
research
12/23/2019

Graph-Based Parallel Large Scale Structure from Motion

While Structure from Motion (SfM) achieves great success in 3D reconstru...
research
03/02/2015

Grouping and Recognition of Dot Patterns with Straight Offset Polygons

When the boundary of a familiar object is shown by a series of isolated ...

Please sign up or login with your details

Forgot password? Click here to reset