Accelerating Density Peak Clustering Algorithm
AbstractThe Density Peak Clustering (DPC) algorithm is a new density-based clustering method. It spends most of its execution time on calculating the local density and the separation distance for each data point in a dataset. The purpose of this study is to accelerate its computation. On average, the DPC algorithm scans half of the dataset to calculate the separation distance of each data point. We propose an approach to calculate the separation distance of a data point by scanning only the neighbors of the data point. Additionally, the purpose of the separation distance is to assist in choosing the density peaks, which are the data points with both high local density and high separation distance. We propose an approach to identify non-peak data points at an early stage to avoid calculating their separation distances. Our experimental results show that most of the data points in a dataset can benefit from the proposed approaches to accelerate the DPC algorithm. View Full-Text
Share & Cite This Article
Lin, J.-L. Accelerating Density Peak Clustering Algorithm. Symmetry 2019, 11, 859.
Lin J-L. Accelerating Density Peak Clustering Algorithm. Symmetry. 2019; 11(7):859.Chicago/Turabian Style
Lin, Jun-Lin. 2019. "Accelerating Density Peak Clustering Algorithm." Symmetry 11, no. 7: 859.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.