基于局部密度信息熵均值的密度峰值聚类算法  

Optimized Density peaks Clustering algorithm based on Local Density information entropy

作　　者：唐风扬 覃仁超[1] 熊健 TANG Fengyang;QIN Renchao;XIONG Jian(Southwest University of Science and Technology,Mianyang 621010,China)

机构地区：[1]西南科技大学计算机科学与技术学院,四川绵阳621010

出　　处：《计算机测量与控制》2022年第3期192-197,203,共7页Computer Measurement &Control

基　　金：四川省科技厅重点研发项目(22ZDYF3141)。

摘　　要：针对密度峰值聚类算法(DPC,the density peak clustering algorithm)聚类结果受距离阈值dc参数影响较大的问题,提出一种局部密度捕获范围以及利用局部密度信息熵均值进行加权优化的方法(简称为LDDPC),在DPC算法选取到错误的距离阈值dc时,通过对最大密度邻近点的相对距离进行加权,重新获得正确的分类数量和聚类中心;经典数据集的实验结果表明,基于局部密度信息熵均值加权优化能避免DPC算法中距离阈值dc对聚类结果的影响,提高分类的正确率。Aiming at the problem,the density peak clustering algorithm(DPC) clustering result is greatly affected by the distance threshold dc parameter,a method of local density capture range and weighted optimization is proposed using the mean value of local density information(abbreviated as For LDDPC),when the DPC algorithm selects the wrong distance threshold dc,by weighting the relative distance of the maximum density neighboring points,the correct number of classifications and cluster centers are obtained again.The experimental results of the classic data set show that,based on the mean value of the local density information entropy,the weighted optimization can avoid the influence of the distance threshold dc in the DPC algorithm on the clustering results,and the accuracy of classification is improved.

关 键 词：聚类算法 密度峰值 信息熵 加权 局部密度 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]