论文信息 - Experiments in Parallel Clustering with DBSCAN

Experiments in Parallel Clustering with DBSCAN

We present a new result concerning the parallelisation of DBSCAN, a Data Mining algorithm for density-based spatial clustering. The overall structure of DBSCAN has been mapped to a skeletonstructured program that performs parallel exploration of each cluster. The approach is useful to improve performance on high-dimensional data, and is general w.r.t. the spatial index structure used. We report preliminary results of the application running on a Beowulf with good efficiency.

Massimo Coppola | Domenica Arlia | M. Coppola | Domenica Arlia

[1] Massimo Coppola,et al. High-performance data mining with skeleton-based structured parallel programming , 2001, Parallel Comput..

[2] Jonathan Goldstein,et al. When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.

[3] Marco Danelutto,et al. SkIE: A heterogeneous environment for HPC applications , 1999, Parallel Comput..

[4] Hans-Peter Kriegel,et al. OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.

[5] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[6] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[7] Daniel A. Keim,et al. Clustering techniques for large data sets—from the past to the future , 1999, KDD '99.