{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T20:36:25Z","timestamp":1781296585838,"version":"3.54.1"},"reference-count":31,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T00:00:00Z","timestamp":1746489600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The density-based spatial clustering of applications with noise (DBSCAN) is able to cluster arbitrarily structured datasets. However, the clustering result of this algorithm is exceptionally sensitive to the neighborhood radius (Eps) and noise points, and it is hard to obtain the best result quickly and accurately with it. To address this issue, a parameter-adaptive DBSCAN clustering algorithm based on the Sparrow Search Algorithm (SSA), referred to as SSA-DBSCAN, is proposed. This method leverages the local fast search ability of SSA, using the optimal number of clusters and the silhouette coefficient of the dataset as the objective functions to iteratively optimize and select the two input parameters of DBSCAN. This avoids the adverse impact of manually inputting parameters, enabling adaptive clustering with DBSCAN. Experiments on typical synthetic datasets, UCI (University of California, Irvine) real-world datasets, and image segmentation tasks have validated the effectiveness of the SSA-DBSCAN algorithm. Comparative analysis with DBSCAN and other related optimization algorithms demonstrates the clustering performance of SSA-DBSCAN.<\/jats:p>","DOI":"10.3390\/a18050273","type":"journal-article","created":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T11:38:06Z","timestamp":1746531486000},"page":"273","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An Improved Density-Based Spatial Clustering of Applications with Noise Algorithm with an Adaptive Parameter Based on the Sparrow Search Algorithm"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-2123-7141","authenticated-orcid":false,"given":"Zicheng","family":"Huang","sequence":"first","affiliation":[{"name":"College of Navigation, Jimei University, Xiamen 361021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4902-3406","authenticated-orcid":false,"given":"Zuopeng","family":"Liang","sequence":"additional","affiliation":[{"name":"College of Navigation, Jimei University, Xiamen 361021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-0342-4638","authenticated-orcid":false,"given":"Shibo","family":"Zhou","sequence":"additional","affiliation":[{"name":"College of Navigation, Jimei University, Xiamen 361021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuntao","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Navigation, Jimei University, Xiamen 361021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2025,5,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10044-024-01298-5","article-title":"A novel two-stage omni-supervised face clustering algorithm","volume":"27","author":"Tan","year":"2024","journal-title":"Pattern Anal. Appl."},{"key":"ref_2","first-page":"8561","article-title":"AENCIC: A method to estimate the number of clusters based on image complexity to be used in fuzzy clustering algorithms for image segmentation","volume":"28","year":"2023","journal-title":"Soft Comput."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"18585","DOI":"10.1007\/s00500-023-09319-x","article-title":"An improved DBSCAN algorithm for hazard recognition of obstacles in unmanned scenes","volume":"27","author":"Zhang","year":"2023","journal-title":"Soft Comput."},{"key":"ref_4","first-page":"20","article-title":"Genetic-Based Keyword Matching DBSCAN in IoT for Discovering Adjacent Clusters","volume":"5","author":"Kim","year":"2023","journal-title":"Comput. Model. Eng. Sci."},{"key":"ref_5","first-page":"226","article-title":"A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise","volume":"96","author":"Ester","year":"1996","journal-title":"Proc. Int. Conf. Knowl. Discov. Data Min."},{"key":"ref_6","first-page":"4","article-title":"A Self-Adaptive Grey DBSCAN Clustering Method","volume":"34","author":"Lu","year":"2022","journal-title":"J. Grey Syst."},{"key":"ref_7","first-page":"4","article-title":"PSO-DBSCAN and SCGAN-Based Unknown Radar Signal Processing Method","volume":"44","author":"Cao","year":"2022","journal-title":"Syst. Eng. Electron."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"107206","DOI":"10.1016\/j.patcog.2020.107206","article-title":"A novel density-based clustering algorithm using the nearest neighbor graph","volume":"102","author":"Li","year":"2020","journal-title":"Pattern Recognit."},{"key":"ref_9","first-page":"45","article-title":"Improved Adaptive Parameter DBSCAN Clustering Algorithm","volume":"56","author":"Wang","year":"2020","journal-title":"Comput. Eng. Appl."},{"key":"ref_10","first-page":"7589","article-title":"GNN-DBSCAN: A new density-based algorithm using grid and the nearest neighbor","volume":"41","author":"Li","year":"2021","journal-title":"J. Intell. Fuzzy Syst."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2939","DOI":"10.1016\/j.eswa.2013.10.025","article-title":"Algorithm to Determine \u03b5-Distance Parameter in Density Based Clustering","volume":"41","author":"Sunita","year":"2014","journal-title":"Expert Syst. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1109\/TKDE.2017.2787640","article-title":"RNN-DBSCAN: A Density-Based Clustering Algorithm Using Reverse Nearest Neighbor Density Estimates","volume":"30","author":"Bryant","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_13","first-page":"1","article-title":"Research on the Method of Self-Adaptive Determination of DBSCAN Algorithm Parameters","volume":"55","author":"Li","year":"2019","journal-title":"Comput. Eng. Appl."},{"key":"ref_14","first-page":"4699573","article-title":"Partition KMNN-DBSCAN Algorithm and Its Application in Extraction of Rail Damage Data","volume":"2022","author":"Li","year":"2022","journal-title":"Math. Probl. Eng."},{"key":"ref_15","first-page":"93","article-title":"An improved adaptive and fast AF-DBSCAN clustering algorithm","volume":"11","author":"Zhou","year":"2016","journal-title":"CAAI Trans. Intell. Syst."},{"key":"ref_16","first-page":"2713","article-title":"Wafer graph preprocessing based on optimized DBSCAN clustering algorithm","volume":"36","author":"Chen","year":"2021","journal-title":"J. Control Decis."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.cja.2020.09.035","article-title":"An unsupervised pattern recognition methodology based on factor analysis and a genetic-DBSCAN algorithm to infer operational conditions from strain measurements in structural applications","volume":"34","author":"Juan","year":"2021","journal-title":"Chin. J. Aeronaut."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"91861","DOI":"10.1109\/ACCESS.2023.3307412","article-title":"WOA-DBSCAN: Application of Whale Optimization Algorithm in DBSCAN Parameter Adaption","volume":"11","author":"Zhang","year":"2023","journal-title":"IEEE Access"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Wang, Z., Ye, Z., Du, Y., Mao, Y., Liu, Y., Wu, Z., and Wang, J. (2022, January 13\u201316). AMD-DBSCAN: An Adaptive Multi-density DBSCAN for datasets of extremely variable density. Proceedings of the 9th IEEE International Conference on Data Science and Advanced Analytics (DSAA), Shenzhen, China.","DOI":"10.1109\/DSAA54385.2022.10032412"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"19566","DOI":"10.1007\/s11227-022-04634-w","article-title":"An Efficient DBSCAN Optimized by Arithmetic Optimization Algorithm with Opposition-Based Learning","volume":"78","author":"Yang","year":"2022","journal-title":"J. Supercomput."},{"key":"ref_21","unstructured":"Xue, J. (2020). Research and Application of a Novel Swarm Intelligence Optimization Technology. [Master\u2019s Thesis, Donghua University]."},{"key":"ref_22","first-page":"8","article-title":"Density Ratio-Based Density Peak Clustering Algorithm","volume":"53","author":"Gao","year":"2017","journal-title":"Comput. Eng. Appl."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Clustering by fast search and find of density peaks","volume":"344","author":"Rodriguez","year":"2014","journal-title":"Science"},{"key":"ref_24","first-page":"5","article-title":"Kernel Density Estimation-Based K-CFSFDP Clustering Algorithm","volume":"45","author":"Dong","year":"2018","journal-title":"Comput. Sci."},{"key":"ref_25","first-page":"6","article-title":"Density Peak Clustering Algorithm for Automatically Determining Cluster Centers","volume":"54","author":"Wang","year":"2018","journal-title":"Comput. Eng. Appl."},{"key":"ref_26","first-page":"100","article-title":"A K-Means clustering algorithm","volume":"28","author":"Hartigan","year":"1979","journal-title":"JR Stat. Soc. Ser. C-Appl. Stat."},{"key":"ref_27","first-page":"e3","article-title":"Unsupervised Approach for Email Spam Filtering using Data Mining","volume":"8","author":"Manaa","year":"2018","journal-title":"EAI Endorsed Trans. Energy Web"},{"key":"ref_28","first-page":"3794844","article-title":"Diagnosis system of microscopic hyperspectral image of hepatobiliary tumors based on convolutional neural network","volume":"2022","author":"Huang","year":"2022","journal-title":"Comput. Intel. Neurosc."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"118682","DOI":"10.1016\/j.apenergy.2022.118682","article-title":"Evaluation of hybrid forecasting methods for organic Rankine cycle: Unsupervised learning-based outlier removal and partial mutual information-based feature selection","volume":"311","author":"Ping","year":"2022","journal-title":"Appl. Energ."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1109\/TPAMI.2007.1046","article-title":"Toward Objective Evaluation of Image Segmentation Algorithms","volume":"29","author":"Unnikrishnan","year":"2007","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_31","first-page":"1399","article-title":"A Global\/Local Affinity Graph for Image Segmentation","volume":"24","author":"Wang","year":"1988","journal-title":"Proc. ACM Conf. Comput. Sci."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/5\/273\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:28:09Z","timestamp":1760030889000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/5\/273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,6]]},"references-count":31,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2025,5]]}},"alternative-id":["a18050273"],"URL":"https:\/\/doi.org\/10.3390\/a18050273","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,6]]}}}