EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

K-Means Community Detection Algorithm Based on Density Peaks

Hongyan Gao, Jing Han, Yue Liu, Peng Zhang, Bo Yang, Yanqing Zu, Fei Liu, Yu Qian

Entropy · 29.01.2026 · 28 (2) · 152

DOI: 10.3390/e28020152 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Entropy, online erschienen am 29.01.2026. Verfasst von Hongyan Gao und 7 weiteren Autor:innen. Beteiligte Einrichtung: School of Physics and Opto-Electronic Technology, Baoji University of Arts and Sciences, Baoji 721016, China. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 23 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The identification of community structure is pivotal for understanding the functional characteristics of complex networks. To address the limitations of most existing community detection algorithms, which often require predefining the number of communities and lack robustness, this paper proposes a novel community detection algorithm named D-means (K-means community detection algorithm based on density peaks). This algorithm integrates the concept of density peak clustering with K-means spectral clustering, employing Chebyshev’s inequality to automatically determine the number of community centers, thereby enabling unsupervised identification of community quantities. By designing a multi-dimensional evaluation framework, the comparative experiments were conducted on LFR benchmark networks (Lancichinetti-Fortunato-Radicchi benchmark networks) and real-world social network datasets. The results demonstrate that the D-means algorithm outperforms traditional algorithms in terms of ACC (accuracy), ARI (adjusted rand index), and NMI (normalized mutual information) metrics, while also achieving improvements in runtime efficiency, showcasing strong robustness. Finally, the D-means algorithm was applied to the public transportation network of Urumqi. Empirical analysis identified 12 functionally significant transportation communities, providing theoretical support for urban rail transit optimization and commercial facility layout planning.

Schlagwörter

Stichwörter der Autor:innen

D-means algorithmcommunity detection algorithmcomplex networkdensity peak clustering

Autor:innen und Institutionen

  • School of Physics and Opto-Electronic Technology, Baoji University of Arts and Sciences, Baoji 721016, China.
  • Physics Teaching and Research Section, Fugu Middle School of Shaanxi Province, Yulin 719499, China.

Zitieren

APA

Gao, H., Han, J., Liu, Y., Zhang, P., Yang, B., Zu, Y., Liu, F., & Qian, Y. (2026). K-Means Community Detection Algorithm Based on Density Peaks. Entropy, 28(2), 152. https://doi.org/10.3390/e28020152

Vancouver

Gao H, Han J, Liu Y, Zhang P, Yang B, Zu Y, et al. K-Means Community Detection Algorithm Based on Density Peaks. Entropy. 2026;28(2):152. doi:10.3390/e28020152

BibTeX
@article{Gao2026,
  author = {Gao, Hongyan and Han, Jing and Liu, Yue and Zhang, Peng and Yang, Bo and Zu, Yanqing and Liu, Fei and Qian, Yu},
  title = {K-Means Community Detection Algorithm Based on Density Peaks},
  journal = {Entropy},
  year = {2026},
  volume = {28},
  number = {2},
  pages = {152},
  doi = {10.3390/e28020152}
}
Kostenlos starten →