arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2207.01178cs.LG
收藏

一种改进的基于自然最近邻的密度峰值聚类概率传播算法

An Improved Probability Propagation Algorithm for Density Peak Clustering Based on Natural Nearest Neighborhood

University of Science and Technology of China(中国科学技术大学)

Wendi Zuo, Xinmin Hou

摘要:

通过快速搜索和找到密度峰值(DPC)进行聚类(Since,2014)已被证明是一种有前途的聚类方法,其通过找到密度峰值来有效地发现聚类中心。DPC的精度取决于截断距离($d_c$)、聚类数($k$)和聚类中心的选择。此外,最终的分配策略是敏感的,具有差的容错。上述缺点使得该算法对参数敏感,只适用于某些特定的数据集。针对DPC算法的局限性,提出了一种改进的基于自然最近邻的概率传播密度峰值聚类算法(DPC-PPNNN)。DPC-PPNNN通过引入自然最近邻和概率传播的思想,实现了非参数聚类过程,使算法适用于更复杂的数据集。在几个数据集上的实验中,DPC-PPNNN的性能优于DPC,K-means和DBSCAN。

英文摘要:

Clustering by fast search and find of density peaks (DPC) (Since, 2014) has been proven to be a promising clustering approach that efficiently discovers the centers of clusters by finding the density peaks. The accuracy of DPC depends on the cutoff distance ($d_c$), the cluster number ($k$) and the selection of the centers of clusters. Moreover, the final allocation strategy is sensitive and has poor fault tolerance. The shortcomings above make the algorithm sensitive to parameters and only applicable for some specific datasets. To overcome the limitations of DPC, this paper presents an improved probability propagation algorithm for density peak clustering based on the natural nearest neighborhood (DPC-PPNNN). By introducing the idea of natural nearest neighborhood and probability propagation, DPC-PPNNN realizes the nonparametric clustering process and makes the algorithm applicable for more complex datasets. In experiments on several datasets, DPC-PPNNN is shown to outperform DPC, K-means and DBSCAN.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑