Density peaks clustering with second-order K-nearest neighbors and multi-cluster merging

被引：0
|
作者：
Lyu L. [1 ,2 ]
Zhu M.-Z. [1 ,2 ]
Kang P. [1 ,2 ]
Han L.-Z. [1 ,2 ]
机构：
[1] School of Information Engineering, Nanchang Institute of Technology, Nanchang
[2] Nanchang Key Laboratory of IoT Perception and Collaborative Computing for Smart City, Nanchang Institute of Technology, Nanchang
来源：
Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition) | 2024年 / 54卷 / 05期
关键词：
attractiveness; density peaks clustering; K-nearest neighbor; manifold data; multi-cluster merging strategy; second-order K-nearest neighbors;
D O I：
10.13229/j.cnki.jdxbgxb.20220779
中图分类号：
学科分类号：
摘要：
In the face of manifold data，the local density of density peaks clustering（DPC）algorithm is easy to find the wrong cluster center and the allocation strategy is easy to cause the residual samples far from the cluster center to be misallocation. In view of the above problems，this paper proposes density peaks clustering with second-order K-nearest neighbors and multi-cluster merging. Firstly，the minimum second-order K-nearest neighbor is used to define the local density，highlighting the density difference between the cluster center and the non-cluster center，so as to find the correct cluster center；Secondly，the K-nearest neighbor is used to find the local representative points of the sample and determine the core points，and the core points are used to guide the micro-cluster division；Finally，the inter-cluster attraction defined by the minimum second-order K-nearest neighbor and shared nearest neighbor is used to merge the micro-clusters，which avoids the misallocation of samples away from the cluster center，and the micro-cluster merging process does not require iteration. In this paper，DPC-SKMM algorithm is compared with IDPC-FA，DPCSA，FNDPC，FKNN-DPC，DPC algorithm. Experimental results show that DPC-SKMM algorithm can cluster manifolds and UCI data sets effectively. © 2024 Editorial Board of Jilin University. All rights reserved.
引用
收藏
页码：1417 / 1425
页数：8
相关论文
共 23 条
  • [1] Djenouri Y, Belhadi A, Fournier-Viger P, Et al., Fast and effective cluster-based information retrieval using frequent closed itemsets, Information Sciences, 453, pp. 154-167, (2018)
  • [2] Zhao H, He C., Objective cluster analysis in value-based customer segmentation method, Proceedings of the 2nd International Workshop on Knowledge Discovery and Data Mining, pp. 484-487, (2009)
  • [3] Liu Zhong-min, Li Zhan-ming, Li Bo-hao, Et al., Spectral clustering image segmentation based on sparse matrix, Journal of Jilin University (Engineering and Technology Edition), 47, 4, pp. 1308-1313, (2017)
  • [4] Zhao Jia, Yao Zhan-feng, Lyu Li, Et al., Density peaks clustering based on mutual neighbor degree, Control and Decision, 36, 3, pp. 543-552, (2021)
  • [5] Qu Fu-heng, Pan Yue-tao, Yang Yong, Et al., An efficient global k-means clustering algorithm based on weighted space partitioning, Journal of Jilin University (Engineering and Technology Edition)
  • [6] Liew A W C, Yan H, Yang M., Pattern recognition techniques for the emerging field of bioinformatics: a review, Pattern Recognition, 38, 11, pp. 2055-2073, (2005)
  • [7] Rodriguez A, Lsio A., Clustering by fast search and find of density peaks, Science, 344, 6191, pp. 1492-1496, (2014)
  • [8] Wang Y, Yang Y., Relative density-based clustering algorithm for identifying diverse density clusters effectively, Neural Computing and Applications, 33, 16, pp. 10141-10157, (2021)
  • [9] Li C, Zhang Y., Density peak clustering based on relative density optimization, Mathematical Problems in Engineering, 2020, (2020)
  • [10] Zhao Jia, Wang Gang, Lyu Li, Et al., Density peaks clustering algorithm based on geodesic distance and cosine mutual reverse nearest neighbor for manifold datasets, Acta Electronica Sinica, 50, 11, pp. 2730-2737, (2022)
123