4.7 Article

VDPC: Variational density peak clustering algorithm

期刊

INFORMATION SCIENCES
卷 621, 期 -, 页码 627-651

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2022.11.091

关键词

Density peak clustering; Representatives; Local density analysis

向作者/读者索取更多资源

The VDPC algorithm is proposed to address the limitation of DPC in identifying clusters with variational density. It systematically performs the clustering task on datasets with different density distributions by identifying representatives, constructing initial clusters, and using a unified clustering framework.
The widely applied density peak clustering (DPC) algorithm makes an intuitive cluster for-mation 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 clus-ters 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 den-sity. To address this issue, we propose a variational density peak clustering (VDPC) algo-rithm, 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' prop-erty. 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.(c) 2022 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据