DPC clustering algorithm based on K-nearest neighbors and kernel density estimation

作者：Yu Zhou, Hao Xia, Liu Hongyu, Qi Bai · 发表于：Scientific insights and discoveries review · 年份：2024 · DOI：10.59782/sidr.v5i1.90 · 被引用次数：2 · 研究领域：Advanced Clustering Algorithms Research、Advanced Data Compression Techniques、Face and Expression Recognition

Clustering by fast search and find of density peaks (DPC) is a density-based clustering algorithm. This algorithm does not require iteration and too many parameter settings, but it cannot identify cluster centers with small cluster density because the local structure of the data is not considered when calculating the local density. To address the above problems, a DPC clustering algorithm (KKDPC) based on K-reciprocal Neighbors (KN) and Kernel Density Estimation (KDE) is proposed. First, the number of reciprocal neighbors and local kernel density of data points are obtained by nearest neighbor and kernel density estimation methods ; second, the number of K reciprocal neighbors is added to the local kernel density to obtain a new local density; finally, the relative distance is obtained according to the local density of the data points, and the cluster center is selected and the non-center point is allocated by constructing a decision graph. Experiments are conducted using artificial and real data sets, and compared with seven clustering algorithms: DPC, DBSCAN, K-means, FCM, DPC-KNN, DPC-NN, and DPC-FWSN. The performance of the KKDPC clustering algorithm is verified by calculating the adjusted mutual information (AMI), adjusted Rand index (ARI), and normalized mutual information (NMI). The experimental results show that this method can more accurately identify the cluster center and effectively improve the clustering accuracy.