Density Peak Clustering Algorithm Based on Natural and Weighted Shared Nearest Neighbors
DOI:
CSTR:
Author:
Affiliation:

School of Science, East China Jiaotong University, Nanchang 330013 , China

Clc Number:

TP181

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Density peak clustering (DPC) has been widely used as an efficient and non-iterative clustering algorithm. However, studies have found that DPC struggles to select correct cluster centers, especially in datasets with non-spherical clusters and non-uniform density. Moreover, DPC is heavily influenced by the truncation distance parameter. In order to address the issue of poor performance of DPC on datasets with uneven density distributions, a density peak clustering algorithm based on natural and weighted shared nearest neighbors is proposed. It first introduced natural nearest neighbor computations to calculate weights. Then, it redefined the similarity between data objects based on the definitions of first-order and second-order shared nearest neighbors. Subsequently, by fusing the definitions of shared nearest neighbor similarity and natural nearest neighbor weights, relative density and relative distance were calculated. Finally, a novel strategy for distributing cluster centers was designed.

    Reference
    Related
    Cited by
Get Citation

王森,陈翔,詹小秦,等. 基于自然和加权共享最近邻的密度峰值聚类算法[J]. 华东交通大学学报,2025,42(4): 120-126.

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 19,2024
  • Revised:
  • Adopted:
  • Online: September 16,2025
  • Published:
Article QR Code