.png){kind=icon}
返回
Graph-based density peak merging for identifying multi-peak clusters
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2023.110657.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Density peaks clustering (DPC), which is short for clustering by fast search-and-find of density peaks, is a recently developed density-based clustering method that is widely used because of its effective detection of isolated high-density regions. However, it often fails to identify true cluster structures from data owing to its intrinsic assumption that a cluster has a unique and high-density center, because a single cluster can contain several peaks. We call this the multi-peak problem. To overcome this, we propose a peak merging method for clustering. In the proposed algorithm, a valley and its local density are defined to identify the intersection between two adjoined peaks. These are used to construct directed and connected subgraphs, using which we merge multiple peaks if needed. Unlike DPC and its variants, the proposed method is capable of identifying highly complex shaped clusters with no interpretation of the decision graph. Numerical experiments based on synthetic and real datasets demonstrated that our method outperformed the benchmarking methods.& COPY; 2023 Elsevier B.V. All rights reserved.
Keyword:
Clustering
Local density peak
Multi-peak cluster
Fast merging
Directed graph
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
分享收藏
Study on density peaks clustering based on k-nearest neighbors and principal component analysis基于k近邻和主成分分析的密度峰聚类研究
PREAI
分享收藏
查看更多内容