arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.00641cs.LGcs.AI
收藏

VDPC:变密度峰值聚类算法

VDPC: Variational Density Peak Clustering Algorithm

College of Information Engineering, Yangzhou University(扬州大学信息工程学院);Institute of Scientific and Technical Information of China(中国科学技术信息研究所);School of Computer Science and Engineering, Nanyang Technological University(南洋理工大学计算机科学与工程学院);College of Computer Science and Technology, Jilin University(吉林大学计算机科学与技术学院);Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly, Nanyang Technological University(南洋理工大学-不列颠哥伦比亚大学老年人积极生活卓越联合研究中心);Joint NTU-WeBank Research Centre on Fintech, Nanyang Technological University(南洋理工大学-微众银行金融科技联合研究中心)

Yizhang Wang, Di Wang, You Zhou, Xiaofeng Zhang, Chai Quek

摘要:

广泛应用的密度峰值聚类(DPC)算法提出了一个直观的聚类形成假设,即聚类中心通常被具有较低局部密度的数据点包围,并且远离其他具有较高局部密度的数据点。然而,这种假设受到一个限制,即当识别具有较低密度的集群时,它通常是有问题的,因为它们可能很容易合并到具有较高密度的其他集群中。因此,DPC可能无法识别具有变化密度的聚类。为了解决这个问题,我们提出了一个变分密度峰值聚类(VDPC)算法,它的目的是系统和自主地执行聚类任务的数据集与各种类型的密度分布。具体而言,我们首先提出了一种新的方法来确定所有数据点之间的代表,并构建初始聚类的基础上确定的代表进一步分析的集群的属性。此外,我们将所有的数据点划分为不同的级别,根据其局部密度,并提出了一个统一的聚类框架,结合DPC和DBSCAN的优点。因此,系统地处理跨越不同密度水平的所有识别的初始聚类以形成最终聚类。为了评估所提出的VDPC算法的有效性,我们进行了广泛的实验,使用20个数据集,包括8个合成,6个真实世界和6个图像数据集。实验结果表明,VDPC算法优于两种经典算法(即,DPC和DBSCAN)和四种最先进的扩展DPC算法。

英文摘要:

The widely applied density peak clustering (DPC) algorithm makes an intuitive cluster formation assumption that cluster centers are often surrounded by data points with lower local density and far away from other data points with higher local density. However, this assumption suffers from one limitation that it is often problematic when identifying clusters with lower density because they might be easily merged into other clusters with higher density. As a result, DPC may not be able to identify clusters with variational density. To address this issue, we propose a variational density peak clustering (VDPC) algorithm, which is designed to systematically and autonomously perform the clustering task on datasets with various types of density distributions. Specifically, we first propose a novel method to identify the representatives among all data points and construct initial clusters based on the identified representatives for further analysis of the clusters' property. Furthermore, we divide all data points into different levels according to their local density and propose a unified clustering framework by combining the advantages of both DPC and DBSCAN. Thus, all the identified initial clusters spreading across different density levels are systematically processed to form the final clusters. To evaluate the effectiveness of the proposed VDPC algorithm, we conduct extensive experiments using 20 datasets including eight synthetic, six real-world and six image datasets. The experimental results show that VDPC outperforms two classical algorithms (i.e., DPC and DBSCAN) and four state-of-the-art extended DPC algorithms.

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

↑