聚类分析
数据库扫描
计算机科学
k-中位数聚类
交叉口(航空)
星团(航天器)
确定数据集中的群集数
算法
离群值
CURE数据聚类算法
模式识别(心理学)
数据挖掘
单连锁聚类
数据点
相关聚类
人工智能
航空航天工程
工程类
程序设计语言
作者
Fuxiang Li,Ming Zhou,Shu Li,Tianhao Yang
出处
期刊:IEEE Access
[Institute of Electrical and Electronics Engineers]
日期:2022-01-01
卷期号:10: 98034-98047
被引量:6
标识
DOI:10.1109/access.2022.3205742
摘要
When the density peak clustering algorithm deals with complex datasets and the problem of multiple density peaks in the same cluster, the subjectively selected cluster centers are not accurate enough, and the allocation of non-cluster centers is prone to joint and several errors. To solve the above problems, we propose a new density peak clustering algorithm based on cluster fusion strategy. First, the algorithm screens out the candidate cluster centers by setting two new thresholds to avoid the influence of noise points and outliers. Second, the remaining data points are allocated according to the density peak clustering algorithm to obtain the initial clusters. Third, considering the structural characteristics and spatial distribution of datasets, the new definitions of boundary points, inter-cluster intersection density and inter-cluster boundary density are provided. To correctly classify the clustering problems with multiple density peaks in the same cluster, a new cluster fusion strategy is proposed, which not only corrects the joint and several errors in the allocation of data points, but also correctly selects the cluster centers. Finally, to test the effectiveness of the proposed clustering algorithm, which is compared with DPC-KNN, DPC, K-means and DBSCAN on nine synthetic datasets and six real datasets. The experimental results demonstrate that the clustering performance of the proposed algorithm outperforms that of other algorithms.
科研通智能强力驱动
Strongly Powered by AbleSci AI