Work

Peak Density Clustering Algorithm Combining Natural and Shared Nearest Neighbor

Year: 2021
Type: article
Abstract: The clustering by fast search and find of density peaks (DPC) has the advantages of no iteration and fewer parameters, but it still has some shortcomings: the need to manually select the cutoff distance parameter and the processing effect is not good on the manifold data set. In response to these problems, an improved density peak clustering algorithm is proposed. The algorithm combines the natural and shared nearest neighbor algorithm, redefines the calculation method of cut-off distance and local density. It integrates the concept of candidate cluster center calculation, selects different candidate cluster centers through the algorithm, uses these candidate centers as a new data set, and starts density peak clustering again. Finally, the remaining points are assigned to the clusters where the corresponding candidate center points are located. The improved algorithm is verified on the synthetic data set and UCI data set rows, and compared with the K-means, DBSCAN (density-based algorithm for discovering clusters in large spatial databases with noise) and DPC algorithm. Experimental results show that the algorithm proposed in this paper has significant improvement in performance.
Authors: BAI Exiang, LUO Ke, LUO Xiao
Language: English
Open Access status: green
OpenAlex ID: W4297779332
FWCI: 0.073
Cites:
Cited by: 1
Related to: 10