计算机科学与探索2019，Vol.13Issue(4)：711-720,10.DOI:10.3778/j.issn.1673-9418.1804033
自然最近邻优化的密度峰值聚类算法*
Optimized Density Peak Clustering Algorithm by Natural Nearest Neighbor*
摘要
Abstract
Aiming at the problem that the existing density-based clustering algorithm is sensitive to parameters and the clustering result of aspheric data and complex manifold data is bad, a new clustering algorithm based on density peak is proposed. The algorithm first determines the local density of data based on the natural nearest neighbor, and then determines the clustering center based on which density peaks have the highest local density and are divided by sparse regions. Finally, a new concept of similarity between clusters is proposed to solve complex manifold problems. In the experiment, the performance of this algorithm is better than that of DPC (clustering by fast search and find of density peaks), DBSCAN (density-based spatial clustering of applications with noise) and K-means in synthetic and actual data sets, and the advantages of aspheric data and complex manifold data are particularly superior.关键词
密度峰/自然最近邻居/局部密度/稀疏区域/类簇间相似度Key words
density peak/ natural nearest neighbor/ local density/ sparse regions/ similarity between clusters分类
信息技术与安全科学引用本文复制引用
金辉,钱雪忠..自然最近邻优化的密度峰值聚类算法*[J].计算机科学与探索,2019,13(4):711-720,10.基金项目
The National Natural Science Foundation of China under Grant No. 61673193 (国家自然科学基金) （国家自然科学基金）
the Fundamental Research Funds for the Central Universities of China under Grant Nos. JUSRP51635B, JUSRP51510 (中央高校基本科研业务费专项资金). （中央高校基本科研业务费专项资金）
