• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science

Previous Articles     Next Articles

Optimization of clustering by fast
search and find of density peaks

WANG Pengfei1,YANG Yuwang1,KE Yaqi2   

  1. (1.School of Computer Science and Engineering,Nanjing University of Science and Technology,Nanjing 210094;
    2.College of Horticulture,Nanjing Agricultural University,Nanjing 210095,China)
     
  • Received:2017-03-30 Revised:2017-05-11 Online:2018-08-25 Published:2018-08-25

Abstract:

The cluster center is chosen manually in the decision graph of the clustering by fast search and find of peaks (CFSFDP) algorithm. And when the cluster is divided into cluster core and cluster halo, some points on the edge of the cluster are divided into the cluster halo group, leading to unreasonable division results. To solve the above problem, we propose a clustering algorithm for automatic selection of cluster center and optimization of the division of cluster core and cluster halo. We adopt the idea of anomaly detection to find the anomaly points of the cluster center. The anomaly points are regarded as the cluster center. And local density in the cluster is introduced for the optimization of the division of cluster core and cluster halo. Comparative experiments show that the proposed algorithm is superior to the CFSFDP algorithm in automation effect and the clustering results are more accurate.
 

Key words: clustering, density peak, anomaly detection, cluster center