DBSCAN-PSM: an improvement method of DBSCAN algorithm on Spark. (16th April 2019)

• Record Type: Journal Article
• Authors: Chen, Guangsheng; Cheng, Yiqun; Jing, Weipeng
• Is Part Of: International journal of high performance computing and networking. Volume 13:Number 4(2019)
• Page Start: 417
• Page End: 426
• Publication Date: 2019-04-16
• Subjects: big data -- DBSCAN -- data partitioning -- data merging; High performance computing -- Periodicals; Computer networks -- Periodicals; High performance computing; Periodicals; 004.05
• Languages: English
• ISSNs: 1740-0562

Abstract

DBSCAN is a density-based data clustering algorithm; in image processing, data mining, machine learning and other fields are widely used. With the increasing of the size of clusters, the parallel DBSCAN algorithm is widely used. However, we consider current partitioning method of DBSCAN is too simple and steps of GETNEIGHBORS query repeatedly access the dataset on Spark. So we proposed DBSCAN-PSM which applies new data partitioning and merging method. In the first stage of our method, we import the KD-tree, combine the partitioning and GETNEIGHBORS query, reduce the number of access to the dataset and decrease the influence of I/O in the algorithm. In the second stage of our method, we use the feature of points in merging so as to avoid the time costing of the global label. Experimental results showed that our new method can improve the parallel efficiency and the clustering algorithm performance.