基于共享近邻相似度的密度峰聚类算法

摘要

Density peaks clustering is an efficient density-based clustering algorithm.However,it is sensitive to the global parameter dc.Furthermore,artificial intervention is needed for decision graph to select clustering centers.To solve these problems,a new density peaks clustering algorithm based on shared near neighbors similarity was proposed.Firstly,the Euclidean distance and shared near neighbors similarity were combined to define the local density of a sample,which avoided the setting of parameter dc of the original density peaks clustering algorithm.Secondly,the selection process of clustering centers was optimized to select initial clustering centers adaptively.Finally,each sample was assigned to the cluster as its nearest neighbor with higher density samples.The experimental results show that,compared with the original density peaks clustering algorithm on the UCI datasets and the artificial datasets,the average values of accuracy,Normalized Mutual Information (NMI) and F-Measure of the proposed algorithm are respectively increased by about 22.3％,35.7％ and 16.6％.The proposed algorithm can effectively improve the accuracy of clustering and the quality of clustering results.%密度峰聚类是一种基于密度的高效聚类方法,但存在对全局参数de敏感和需要人工干预决策图进行聚类中心选择的缺陷.针对上述问题,提出了一种基于共享近邻相似度的密度峰聚类算法.首先,该算法结合欧氏距离和共享近邻相似度进行样本局部密度的定义,避免了原始密度峰聚类算法中参数dc的设置;其次,优化聚类中心的选择过程,能够自适应地进行聚类中心的选择;最后,将样本分配至距其最近并拥有较高密度的样本所在的簇中.实验结果表明,在UCI数据集和模拟数据集上,该算法与原始的密度峰聚类算法相比,准确率、标准化互信息(NMI)和F-Measure指标分别平均提高约22.3％、35.7％和16.6％.该算法能有效地提高聚类的准确性和聚类结果的质量.