罗岚,詹凤,周传华,等.自适应引力密度峰值聚类优化算法[J]. 微电子学与计算机,2024,41(3):21-28. doi: 10.19304/J.ISSN1000-7180.2023.0199
引用本文: 罗岚,詹凤,周传华,等.自适应引力密度峰值聚类优化算法[J]. 微电子学与计算机,2024,41(3):21-28. doi: 10.19304/J.ISSN1000-7180.2023.0199
LUO L,ZHAN F,ZHOU C H,et al. Optimized adaptive gravitational density peak clustering algorithm[J]. Microelectronics & Computer,2024,41(3):21-28. doi: 10.19304/J.ISSN1000-7180.2023.0199
Citation: LUO L,ZHAN F,ZHOU C H,et al. Optimized adaptive gravitational density peak clustering algorithm[J]. Microelectronics & Computer,2024,41(3):21-28. doi: 10.19304/J.ISSN1000-7180.2023.0199

自适应引力密度峰值聚类优化算法

Optimized adaptive gravitational density peak clustering algorithm

  • 摘要: 针对密度峰值聚类(Density Peak Clustering, DPC)算法对截断距离的取值较为敏感,密度度量标准不统一且人为选取聚类中心存在主观性的问题,提出了一种自适应引力密度峰值聚类优化(Optimized Adaptive Gravitational Density Peak Clustering Algorithm, OAGDPC)算法。首先采用模糊加权K-近邻技术(Fuzzy Weighted K- Nearest Neighbors Density Peak Clustering, FKNN-DPC ) 重新定义了局部密度,统一了密度度量的标准;然后提出一种自适应选择聚类中心的策略,结合基于引力的密度峰值(Gravitational Density Peak Clustering, GDPC)算法中牛顿万有引力定律与DPC算法的参数映射,使用引力类比距离,并设置综合考虑局部密度和引力的决策参数,依据决策参数降序折线图的顶角变化自适应确定聚类中心;最后聚集非中心点并识别异常点。实验选取DPC、GDPC、FKNN-DPC和OAGDPC在人工和UCI数据集上进行测试,结果表明,OAGDPC算法在各数据集上都有良好的表现,特别在聚类结果准确性、自适应能力、鲁棒性方面相对于对比算法具有明显优势。

     

    Abstract: Aiming to address the issues of sensitivity to truncation distance, lack of unified density measurement standard, and subjective selection of cluster center in Density Peak Clustering algorithm (DPC) , we propose an Optimized Adaptive Gravitational Density Peak Clustering algorithm (OAGDPC). Firstly, we employ the Fuzzy Weighted K-Nearest Neighbors Density Peak Clustering (FKNN-DPC) to redefine local density and establish a unified density measurement standard. Then, an adaptive strategy for selecting cluster centers is introduced. This is achieved by incorporating the parameter mapping between Newton's law of gravity and the Gravitational Density Peak Clustering (GDPC) algorithm, utilizing the gravitational analogy distance and considering both local density and gravity in decision parameter settings, it achieves adaptive determination of clustering centers through monitoring changes in the top angle of the descending broken line graph formed by these decision parameters. Subsequently, non-center points are gathered, and abnormal points are identified. The experiments select DPC, GPDC, FKNN-DPC and OAGDPC to test on artificial and UCI data sets. The results show that OAGDPC algorithm has good performance on all data sets, especially in the accuracy, adaptive ability and robustness of the clustering results compared with the comparison algorithms.

     

/

返回文章
返回