{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T03:31:59Z","timestamp":1769571119973,"version":"3.49.0"},"reference-count":31,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:00:00Z","timestamp":1743120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/fi17040150","type":"journal-article","created":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:06:35Z","timestamp":1743141995000},"page":"150","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["GraphDBSCAN: Optimized DBSCAN for Noise-Resistant Community Detection in Graph Clustering"],"prefix":"10.3390","volume":"17","author":[{"given":"Danial","family":"Ahmadzadeh","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Ne.C., Islamic Azad University, Neyshabur 9319975853, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2465-4933","authenticated-orcid":false,"given":"Mehrdad","family":"Jalali","sequence":"additional","affiliation":[{"name":"Institute of Functional Interfaces, Karlsruhe Institute of Technology (KIT), Hermann-von Helmholtz-Platz 1, 76344 Eggenstein-Leopoldshafen, Germany"},{"name":"Department of Applied Data Science and Artificial Intelligence, SRH University Heidelberg, 69123 Heidelberg, Germany"},{"name":"Department of Computer Engineering, Ma.C., Islamic Azad University, Mashhad 9187147578, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Ghaemi","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Qu.C., Islamic Azad University, Quchan 9479176135, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maryam","family":"Kheirabadi","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Ne.C., Islamic Azad University, Neyshabur 9319975853, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,3,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community detection in graphs","volume":"486","author":"Fortunato","year":"2010","journal-title":"Phys. Rep."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"100286","DOI":"10.1016\/j.cosrev.2020.100286","article-title":"Community detection in node-attributed social networks: A survey","volume":"37","author":"Chunaev","year":"2020","journal-title":"Comput. Sci. Rev."},{"key":"ref_3","unstructured":"Ester, M., Kriegel, H.P., Sander, J., and Xu, X. (1996, January 2\u20134). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, KDD 1996, Portland, OR, USA."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3068335","article-title":"DBSCAN revisited, revisited: Why and how you should (still) use DBSCAN","volume":"42","author":"Schubert","year":"2017","journal-title":"ACM Trans. Database Syst."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1023\/A:1009745219419","article-title":"Density-based clustering in spatial databases: The algorithm and its applications","volume":"2","author":"Sander","year":"2018","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2733381","article-title":"Hierarchical density estimates for data clustering, visualization, and outlier detection","volume":"10","author":"Campello","year":"2015","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","article-title":"Community detection in networks: A user guide","volume":"659","author":"Fortunato","year":"2016","journal-title":"Phys. Rep."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3172867","article-title":"Community discovery in dynamic networks: A survey","volume":"51","author":"Rossetti","year":"2018","journal-title":"ACM Comput. Surv."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Moosavi, S.A., and Jalali, M. (2014, January 4\u20136). Community detection in online social networks using actions of users. Proceedings of the 2014 Iranian Conference on Intelligent Systems, ICIS 2014, Bam, Iran.","DOI":"10.1109\/IranianCIS.2014.6802552"},{"key":"ref_10","first-page":"22407","article-title":"Faster DBSCAN via subsampled similarity queries","volume":"Volume 33","author":"Jiang","year":"2020","journal-title":"Advances in Neural Information Processing System"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Nia, R.G.N.N., Jalali, M., and Houshmand, M. (2022). A Graph-Based k-Nearest Neighbor (KNN) Approach for Predicting Phases in High-Entropy Alloys. Appl. Sci., 12.","DOI":"10.3390\/app12168021"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"12978","DOI":"10.1021\/acsomega.2c00317","article-title":"Machine Learning Approach to Community Detection in a High-Entropy Alloy Interaction Network","volume":"7","author":"Nia","year":"2022","journal-title":"ACS Omega"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10115-016-0970-8","article-title":"Community detection in social networks using user frequent pattern mining","volume":"51","author":"Moosavi","year":"2017","journal-title":"Knowl. Inf. Syst."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Traag, V.A., Waltman, L., and van Eck, N.J. (2019). From Louvain to Leiden: Guaranteeing well-connected communities. Sci. Rep., 9.","DOI":"10.1038\/s41598-019-41695-z"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"056117","DOI":"10.1103\/PhysRevE.80.056117","article-title":"Community detection algorithms: A comparative analysis","volume":"80","author":"Lancichinetti","year":"2009","journal-title":"Phys. Rev. E Stat. Nonlin. Soft Matter Phys."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"11816","DOI":"10.1007\/s11227-024-05904-5","article-title":"Label propagation algorithm for community discovery based on centrality and common neighbours","volume":"80","author":"Douadi","year":"2024","journal-title":"J. Supercomput."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"110366","DOI":"10.1016\/j.patcog.2024.110366","article-title":"Survey of spectral clustering based on graph theory","volume":"151","author":"Ding","year":"2024","journal-title":"Pattern Recognit."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"015014","DOI":"10.1088\/2632-072X\/ad28fe","article-title":"Transfer operators on graphs: Spectral clustering and beyond","volume":"5","author":"Klus","year":"2024","journal-title":"J. Phys. Complex."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Hussain, I., Sinaga, K.P., and Yang, M.S. (2023). Unsupervised Multiview Fuzzy C-Means Clustering Algorithm. Electronics, 12.","DOI":"10.3390\/electronics12214467"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1109\/TFUZZ.2021.3058572","article-title":"Weighted Multiview Possibilistic C-Means Clustering with L2 Regularization","volume":"30","author":"Benjamin","year":"2022","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"066122","DOI":"10.1103\/PhysRevE.84.066122","article-title":"Limits of modularity maximization in community detection","volume":"84","author":"Lancichinetti","year":"2011","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","article-title":"Resolution Limit in Community Detection","volume":"104","author":"Fortunato","year":"2007","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"120616","DOI":"10.1109\/ACCESS.2019.2936248","article-title":"Community Detection and Visualization in Complex Network by the Density-Canopy-Kmeans Algorithm and MDS Embedding","volume":"7","author":"Li","year":"2019","journal-title":"IEEE Access"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Bhattacharjee, P., and Mitra, P. (2021). A survey of density based clustering algorithms. Front. Comput. Sci., 15.","DOI":"10.1007\/s11704-019-9059-3"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"You, T., Shia, B.-C., and Zhang, Z.-Y. (2015). Community Detection in Complex Networks Using Density-based Clustering Algorithm. arXiv.","DOI":"10.1016\/j.physa.2016.07.025"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"012056","DOI":"10.1088\/1742-6596\/1229\/1\/012056","article-title":"Adaptive DBSCAN algorithm based on sample density gradient","volume":"1229","author":"Xie","year":"2019","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","article-title":"Finding community structure in very large networks","volume":"70","author":"Clauset","year":"2004","journal-title":"Phys. Rev. E\u2014Stat. Nonlinear Soft Matter Phys."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"126094","DOI":"10.1016\/j.chemer.2024.126094","article-title":"A comprehensive evaluation of OPTICS, GMM and K-means clustering methodologies for geochemical anomaly detection connected with sample catchment basins","volume":"84","author":"Hajihosseinlou","year":"2024","journal-title":"Geochemistry"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s13278-019-0554-1","article-title":"An efficient method to detect communities in social networks using DBSCAN algorithm","volume":"9","author":"Khatoon","year":"2019","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Jalali, M., Tsotsalas, M., and W\u00f6ll, C. (2022). MOFSocialNet: Exploiting Metal-Organic Framework Relationships via Social Network Analysis. Nanomaterials, 12.","DOI":"10.3390\/nano12040704"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1186\/s13321-023-00764-2","article-title":"MOFGalaxyNet: A social network analysis for predicting guest accessibility in metal\u2013organic frameworks utilizing graph convolutional networks","volume":"15","author":"Jalali","year":"2023","journal-title":"J. Cheminform."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/17\/4\/150\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:04:13Z","timestamp":1760029453000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/17\/4\/150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,28]]},"references-count":31,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["fi17040150"],"URL":"https:\/\/doi.org\/10.3390\/fi17040150","relation":{},"ISSN":["1999-5903"],"issn-type":[{"value":"1999-5903","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,28]]}}}