返回
Optimization of Density Peak Clustering Algorithm Based on Improved Black Widow Algorithm
DOI:10.3390/biomimetics9010003.png)
摘要
En 中文
Clustering is an unsupervised learning method. Density Peak Clustering (DPC), a density-based algorithm, intuitively determines the number of clusters and identifies clusters of arbitrary shapes. However, it cannot function effectively without the correct parameter, referred to as the cutoff distance (dc). The traditional DPC algorithm exhibits noticeable shortcomings in the initial setting of dc when confronted with different datasets, necessitating manual readjustment. To solve this defect, we propose a new algorithm where we integrate DPC with the Black Widow Optimization Algorithm (BWOA), named Black Widow Density Peaks Clustering (BWDPC), to automatically optimize dc for maximizing accuracy, achieving automatic determination of dc. In the experiment, BWDPC is used to compare with three other algorithms on six synthetic data and six University of California Irvine (UCI) datasets. The results demonstrate that the proposed BWDPC algorithm more accurately identifies density peak points (cluster centers). Moreover, BWDPC achieves superior clustering results. Therefore, BWDPC represents an effective improvement over DPC.
Keyword:
clustering
density peak clustering
cutoff distance
black widow algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
B
IF:
3.9
论文数:
3.2K
被引数:
5.1K
机构
引用论文
Synergetic information bottleneck for joint multi-view and ensemble clustering
INFORMATION FUSION
IF15.5
Diseases of the tooth: the genetic and molecular basis of inherited anomalies affecting the dentition牙齿疾病: 影响牙列的遗传异常的遗传和分子基础

