EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

GraphDBSCAN: Optimized DBSCAN for Noise-Resistant Community Detection in Graph Clustering

Danial Ahmadzadeh, Mehrdad Jalali, Reza Ghaemi, Maryam Kheirabadi

Future Internet · 28.03.2025 · 17 (4) · 150

DOI: 10.3390/fi17040150 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Future Internet, online erschienen am 28.03.2025. Verfasst von Danial Ahmadzadeh und 3 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Community detection in complex networks remains a significant challenge due to noise, outliers, and the dependency on predefined clustering parameters. This study introduces GraphDBSCAN, an adaptive community detection framework that integrates an optimized density-based clustering method with an enhanced graph partitioning approach. The proposed method refines clustering accuracy through three key innovations: (1) a K-nearest neighbor (KNN)-based strategy for automatic parameter tuning in density-based clustering, eliminating the need for manual selection; (2) a proximity-based feature extraction technique that enhances node representations while preserving network topology; and (3) an improved edge removal strategy in graph partitioning, incorporating additional centrality measures to refine community structures. GraphDBSCAN is evaluated on real-world and synthetic datasets, demonstrating improvements in modularity, noise reduction, and clustering robustness. Compared to existing methods, GraphDBSCAN consistently enhances structural coherence, reduces sensitivity to outliers, and improves community separation without requiring fixed parameter assumptions. The proposed method offers a scalable, data-driven approach to community detection, making it suitable for large-scale and heterogeneous networks.

Zitieren

APA

Ahmadzadeh, D., Jalali, M., Ghaemi, R., & Kheirabadi, M. (2025). GraphDBSCAN: Optimized DBSCAN for Noise-Resistant Community Detection in Graph Clustering. Future Internet, 17(4), 150. https://doi.org/10.3390/fi17040150

Vancouver

Ahmadzadeh D, Jalali M, Ghaemi R, Kheirabadi M. GraphDBSCAN: Optimized DBSCAN for Noise-Resistant Community Detection in Graph Clustering. Future Internet. 2025;17(4):150. doi:10.3390/fi17040150

BibTeX
@article{Ahmadzadeh2025,
  author = {Ahmadzadeh, Danial and Jalali, Mehrdad and Ghaemi, Reza and Kheirabadi, Maryam},
  title = {GraphDBSCAN: Optimized DBSCAN for Noise-Resistant Community Detection in Graph Clustering},
  journal = {Future Internet},
  year = {2025},
  volume = {17},
  number = {4},
  pages = {150},
  doi = {10.3390/fi17040150}
}
Kostenlos starten →