EUVIMEDEUVIMED entdecken
Crossref

Density Peaks Clustering Algorithm Based on Minimum Spanning Tree and Skeleton Construction

Baohong Liu, Zimeng Dang, Jiazhen Hou, Wenfeng Wang, Renxian Zeng

Concurrency and Computation: Practice and Experience · 2026-07 · 38 (14)

DOI: 10.1002/cpe.70858 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Concurrency and Computation: Practice and Experience, online erschienen am 15.07.2026. Verfasst von Baohong Liu und 4 weiteren Autor:innen. Die Arbeit nennt 29 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The density peaks clustering (DPC) algorithm suffers from two limitations on density‐inhomogeneous datasets: incorrect cluster‐center selection and the “domino effect” caused by its single‐step assignment strategy. To address these issues, this paper proposes DPC‐MSTSC, which integrates MST‐based local density refinement with cluster‐skeleton construction. First, a local minimum spanning tree built on K‐nearest neighbors is pruned to eliminate cross‐cluster edges, producing density estimates that accurately adapt to heterogeneous densities and enable reliable center identification. Second, K‐fully mutual nearest‐neighbor (K‐FMNN) points are identified as cluster cores, and cluster skeletons are constructed through second‐order KNN expansion, which simultaneously determines the cluster centers and the number of clusters without manual input. Noncore points are then assigned to the closest skeleton via an attractiveness function that combines shared‐neighbor overlap, spatial proximity, and density similarity, effectively blocking error propagation. Experiments on synthetic and real‐world datasets demonstrate that DPC‐MSTSC accurately identifies cluster structures and achieves highly competitive performance.

Zitieren

APA

Liu, B., Dang, Z., Hou, J., Wang, W., & Zeng, R. (2026). Density Peaks Clustering Algorithm Based on Minimum Spanning Tree and Skeleton Construction. Concurrency and Computation: Practice and Experience, 38(14). https://doi.org/10.1002/cpe.70858

Vancouver

Liu B, Dang Z, Hou J, Wang W, Zeng R. Density Peaks Clustering Algorithm Based on Minimum Spanning Tree and Skeleton Construction. Concurrency and Computation: Practice and Experience. 2026;38(14). doi:10.1002/cpe.70858

BibTeX
@article{Liu2026,
  author = {Liu, Baohong and Dang, Zimeng and Hou, Jiazhen and Wang, Wenfeng and Zeng, Renxian},
  title = {Density Peaks Clustering Algorithm Based on Minimum Spanning Tree and Skeleton Construction},
  journal = {Concurrency and Computation: Practice and Experience},
  year = {2026},
  volume = {38},
  number = {14},
  doi = {10.1002/cpe.70858}
}
Kostenlos starten →