关键词: 聚类, 密度峰值聚类, 标签传播, 最近邻

Abstract:

Dynamic graph-based label propagation for density peaks clustering (DPC-DLP) is an improved algo-rithm of density peaks clustering (DPC). The related parameters involved in the algorithm are too complex and the algorithm uses labeled data in each iteration, which will lead to the expansion of label errors and the deterioration of clustering effect due to too many iterations. To solve the above problems, this paper proposes a nearest neighbor label propagation for density peak clustering (DPC-NLP), which mainly has three steps. Firstly, the local density and the minimum distance are used to score the sample points and the clustering center is determined according to the score. Then, the clustering backbone is formed by the labels of the clustering center in its nearest neighbor. Finally, the label propagation method based on the nearest neighbor is used to propagate the labels of the clustering back-bone to the remaining samples and the final clustering results are formed. The nearest neighbor label propagation algorithm takes full account of the structural association between samples, constantly updates the state of data in the process of propagation, and uses more sufficient information to improve the accuracy of allocation. The algorithm is verified on the synthetic and real-world datasets and compared with the current mainstream clustering algorithms. Ex-perimental results show that DPC-NLP is superior in performance and robustness and can deal with complex data such as manifold and nonlinear data.

Key words: clustering, density peaks clustering, label propagation, nearest neighbor