Journal of Northeastern University(Natural Science) ›› 2022, Vol. 43 ›› Issue (6): 761-768.DOI: 10.12068/j.issn.1005-3026.2022.06.001

• Information & Control •     Next Articles

An Adaptive Density Peak Clustering Algorithm

MA Shu-hua, YOU Hai-rong, TANG Liang, HE Ping   

  1. School of Control Engineering, Northeastern University at Qinhuangdao, Qinhuangdao 066004, China.
  • Revised:2021-05-21 Accepted:2021-05-21 Published:2022-07-01
  • Contact: YOU Hai-rong
  • About author:-
  • Supported by:
    -

Abstract: The density peak clustering algorithm cannot adaptively cluster because it cannot adaptively select the clustering center and cutoff distance dc according to data set, so that an adaptive density peak clustering(ADPC) algorithm was proposed. Firstly, a parameter μi that comprehensively considers the local density ρi and cutoff distance δi was proposed, and the cluster center was automatically determined according to the sorting and downtrend of μi. Then, an adaptive selection of dc was made based on the concept of Gini coefficient. Finally, the ADPC algorithm was verified and compared with the DPC and K-means algorithm. The experimental results show that the ADPC algorithm has higher ARI, NMI and AC values, and has a better clustering effect.

Key words: clustering; adaptive; clustering center; cutoff distance; downward trend; Gini coefficient

CLC Number: