返回
A three-way clustering method based on improved density peaks algorithm and boundary detection graph
DOI:10.1016/j.ijar.2022.12.002.png)
摘要
En 中文
Density Peaks Clustering (DPC) is a classic density-based clustering algorithm that has been successfully applied in various areas. However, it assigns samples based on their nearest neighbors with higher density which may lead to an error propagation problem. Besides, it can not detect fringe and overlapping samples. To handle these defects, we improve the density measurement of DPC to make it more adaptive to different shapes and varying densities. Furthermore, we extend DPC to three-way clustering which means a sample in the positive region certainly belongs to the cluster, a sample in the boundary region belongs to the cluster partially and a sample in the negative region certainly does not belong to the cluster. In this paper, we propose a three-way clustering method called TW-RDPC. It mainly consists of three steps: (1) Identify cluster centers and assign other samples based on relative Cauchy kernel density to get initial clusters. (2) Detect potential boundary samples through boundary detection graph. (3) Determine whether potential boundary samples belong to multiple clusters based on the subordinate relationship to their k nearest neighbors. In order to validate TW-RDPC, we compare it to 7 algorithms on 10 synthetic datasets and 8 real-world datasets. Experimental results indicate that TW-RDPC is competitive with the compared 7 algorithms.(c) 2022 Elsevier Inc. All rights reserved.
Keyword:
Three-way clustering
Density peaks clustering
Density-based clustering
Three-way decision theory
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
引用论文
Quantile-based fuzzy C-means clustering of multivariate time series: Robust techniques基于分位数的多元时间序列模糊C均值聚类: 鲁棒技术
Study on density peaks clustering based on k-nearest neighbors and principal component analysis基于k近邻和主成分分析的密度峰聚类研究

