HPDBSCAN
Authors:
Open Access
- 15 November 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-10
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 consumptionKeywords
This publication has 15 references indexed in Scilit:
- A new scalable parallel DBSCAN algorithm using the disjoint-set data structure2012
- MR-DBSCAN: An Efficient Parallel Density-Based Clustering Algorithm Using MapReduce2011
- Research on Parallel DBSCAN Algorithm Design Based on MapReduceAdvanced Materials Research, 2011
- Coefficient of Variation2010
- Parallel Density-Based Clustering of Complex Objects2006
- Experiments in Parallel Clustering with DBSCAN2001
- Approaches for scaling DBSCAN algorithm to large spatial databasesJournal of Computer Science and Technology, 2000
- OpenMP: an industry standard API for shared-memory programmingIEEE Computational Science and Engineering, 1998
- Data Structures for Range SearchingACM Computing Surveys, 1979
- Validity of the single processor approach to achieving large scale computing capabilities1967