Loading...
Please wait, while we are loading the content...
Similar Documents
HPDBSCAN: highly parallel DBSCAN
| Content Provider | ACM Digital Library |
|---|---|
| Author | Götz, Markus Bodenstein, Christian Riedel, Morris |
| Abstract | Clustering algorithms in the field of data-mining are used to aggregate similar objects into common groups. One of the best-known of these algorithms is called DBSCAN. Its distinct design enables the search for an apriori unknown number of arbitrarily shaped clusters, and at the same time allows to filter out noise. Due to its sequential formulation, the parallelization of DBSCAN renders a challenge. In this paper we present a new parallel approach which we call HPDBSCAN. It employs three major techniques in order to break the sequentiality, empower workload-balancing as well as speed up neighborhood searches in distributed parallel processing environments i) a computation split heuristic for domain decomposition, ii) a data index preprocessing step and iii) a rule-based cluster merging scheme. As a proof-of-concept we implemented HPDBSCAN as an OpenMP/MPI hybrid application. Using real-world data sets, such as a point cloud from the old town of Bremen, Germany, we demonstrate that our implementation is able to achieve a significant speed-up and scale-up in common HPC setups. Moreover, we compare our approach with previous attempts to parallelize DBSCAN showing an order of magnitude improvement in terms of computation time and memory consumption. |
| Starting Page | 1 |
| Ending Page | 10 |
| Page Count | 10 |
| File Format | |
| ISBN | 9781450340069 |
| DOI | 10.1145/2834892.2834894 |
| Language | English |
| Publisher | Association for Computing Machinery (ACM) |
| Publisher Date | 2015-11-15 |
| Publisher Place | New York |
| Access Restriction | Subscribed |
| Subject Keyword | High performance computing Openmp/mpi hybrid Parallel dbscan Scalable clustering Hpdbscan |
| Content Type | Text |
| Resource Type | Article |
