{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T17:59:35Z","timestamp":1777658375183,"version":"3.51.4"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61873130"],"award-info":[{"award-number":["61873130"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61833011"],"award-info":[{"award-number":["61833011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Australian Research Council project","award":["DP160104292"],"award-info":[{"award-number":["DP160104292"]}]},{"DOI":"10.13039\/501100001793","name":"Queensland University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001793","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>As unsupervised learning algorithm, clustering algorithm is widely used in data processing field. Density-based spatial clustering of applications with noise algorithm (DBSCAN), as a common unsupervised learning algorithm, can achieve clusters via finding high-density areas separated by low-density areas based on cluster density. Different from other clustering methods, DBSCAN can work well for any shape clusters in the spatial database and can effectively cluster exceptional data. However, in the employment of DBSCAN, the parameters, EPS and MinPts, need to be preset for different clustering object, which greatly influences the performance of the DBSCAN. To achieve automatic optimization of parameters and improve the performance of DBSCAN, we proposed an improved DBSCAN optimized by arithmetic optimization algorithm (AOA) with opposition-based learning (OBL) named OBLAOA-DBSCAN. In details, the reverse search capability of OBL is added to AOA for obtaining proper parameters for DBSCAN, to achieve adaptive parameter optimization. In addition, our proposed OBLAOA optimizer is compared with standard AOA and several latest meta heuristic algorithms based on 8 benchmark functions from CEC2021, which validates the exploration improvement of OBL. To validate the clustering performance of the OBLAOA-DBSCAN, 5 classical clustering methods with 10 real datasets are chosen as the compare models according to the computational cost and accuracy. Based on the experimental results, we can obtain two conclusions: (1) the proposed OBLAOA-DBSCAN can provide highly accurately clusters more efficiently; and (2) the OBLAOA can significantly improve the exploration ability, which can provide better optimal parameters.<\/jats:p>","DOI":"10.1007\/s11227-022-04634-w","type":"journal-article","created":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T16:02:56Z","timestamp":1656259376000},"page":"19566-19604","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["An efficient DBSCAN optimized by arithmetic optimization algorithm with opposition-based learning"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8706-2831","authenticated-orcid":false,"given":"Yang","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haomiao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuchao","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2388-3614","authenticated-orcid":false,"given":"Jinran","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3686-0451","authenticated-orcid":false,"given":"Chan-Juan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7272-046X","authenticated-orcid":false,"given":"Shangrui","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,26]]},"reference":[{"issue":"6","key":"4634_CR1","doi-asserted-by":"publisher","first-page":"4556","DOI":"10.1007\/s11227-018-2526-z","volume":"76","author":"N Yuvaraj","year":"2020","unstructured":"Yuvaraj N, Suresh Ghana Dhas C (2020) High-performance link-based cluster ensemble approach for categorical data clustering. J Supercomput 76(6):4556\u20134579","journal-title":"J Supercomput"},{"issue":"8","key":"4634_CR2","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1109\/TMI.2019.2894349","volume":"38","author":"S Hussein","year":"2019","unstructured":"Hussein S, Kandel P, Bolan CW, Wallace MB, Bagci U (2019) Lung and pancreatic tumor characterization in the deep learning era: novel supervised and unsupervised learning approaches. IEEE Trans Med Imag 38(8):1777\u20131787","journal-title":"IEEE Trans Med Imag"},{"key":"4634_CR3","doi-asserted-by":"publisher","first-page":"113340","DOI":"10.1016\/j.eswa.2020.113340","volume":"149","author":"J Wu","year":"2020","unstructured":"Wu J, Wang YG, Burrage K, Tian YC, Lawson B, Ding Z (2020) An improved firefly algorithm for global continuous optimization problems. Expert Syst Appl 149:113340","journal-title":"Expert Syst Appl"},{"key":"4634_CR4","doi-asserted-by":"publisher","first-page":"113612","DOI":"10.1016\/j.eswa.2020.113612","volume":"158","author":"H Chen","year":"2020","unstructured":"Chen H, Li W, Yang X (2020) A whale optimization algorithm with chaos mechanism based on quasi-opposition for global optimization problems. Expert Syst Appl 158:113612","journal-title":"Expert Syst Appl"},{"issue":"8","key":"4634_CR5","doi-asserted-by":"publisher","first-page":"5679","DOI":"10.1007\/s11227-019-02953-z","volume":"76","author":"P Edwin Dhas","year":"2020","unstructured":"Edwin Dhas P, Sankara Gomathi B (2020) A novel clustering algorithm by clubbing GHFCM and GWO for microarray gene data. J Supercomput 76(8):5679\u20135693","journal-title":"J Supercomput"},{"key":"4634_CR6","doi-asserted-by":"publisher","first-page":"113017","DOI":"10.1016\/j.cma.2020.113017","volume":"366","author":"C Wang","year":"2020","unstructured":"Wang C, Koh JM, Yu T, Xie NG, Cheong KH (2020) Material and shape optimization of bi-directional functionally graded plates by GIGA and an improved multi-objective particle swarm optimization algorithm. Computer Methods Appl Mech Eng 366:113017","journal-title":"Computer Methods Appl Mech Eng"},{"key":"4634_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2013.11.003","volume":"16","author":"SJ Nanda","year":"2014","unstructured":"Nanda SJ, Panda G (2014) A survey on nature inspired metaheuristic algorithms for partitional clustering. Swarm Evol Comput 16:1\u201318","journal-title":"Swarm Evol Comput"},{"issue":"4","key":"4634_CR8","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1093\/bioinformatics\/btaa775","volume":"37","author":"L Hu","year":"2021","unstructured":"Hu L, Zhang J, Pan X, Yan H, You ZH (2021) HiSCF: leveraging higher-order structures for clustering analysis in biological networks. Bioinformatics. 37(4):542\u2013550","journal-title":"Bioinformatics."},{"key":"4634_CR9","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ajem.2021.07.004","volume":"50","author":"YJ Chen","year":"2021","unstructured":"Chen YJ, Chen MZ, Zhang HW, Wu GS, Guo SR (2021) Effect of Guo Qing Yi Tang combined with Western medicine cluster therapy on acute pancreatitis. Am J Emergency Med 50:66\u201370","journal-title":"Am J Emergency Med"},{"issue":"4","key":"4634_CR10","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1556\/2006.8.2019.58","volume":"8","author":"L Rochat","year":"2019","unstructured":"Rochat L, Bianchi-Demicheli F, Aboujaoude E, Khazaal Y (2019) The psychology of swiping: a cluster analysis of the mobile dating app Tinder. J Behav Addict 8(4):804\u2013813","journal-title":"J Behav Addict"},{"issue":"7","key":"4634_CR11","doi-asserted-by":"publisher","first-page":"182234","DOI":"10.1371\/journal.pone.0182234","volume":"12","author":"S Kim","year":"2017","unstructured":"Kim S, Jung I (2017) Optimizing the maximum reported cluster size in the spatial scan statistic for ordinal data. PLoS One 12(7):182234","journal-title":"PLoS One"},{"key":"4634_CR12","volume-title":"Partitional clustering algorithms","author":"ME Celebi","year":"2014","unstructured":"Celebi ME (2014) Partitional clustering algorithms. Springer, New York"},{"key":"4634_CR13","first-page":"142","volume":"99","author":"J Medov\u00e1","year":"2019","unstructured":"Medov\u00e1 J, Bakusov\u00e1 J (2019) Application of hierarchical cluster analysis in educational research: Distinguishing between transmissive and constructivist oriented mathematics teachers. Statistika: Stat Econ J 99:142\u2013150","journal-title":"Statistika: Stat Econ J"},{"key":"4634_CR14","doi-asserted-by":"publisher","first-page":"153610","DOI":"10.1016\/j.aeue.2021.153610","volume":"132","author":"W Gong","year":"2021","unstructured":"Gong W, Pang L, Wang J, Xia M, Zhang Y (2021) A social-aware K means clustering algorithm for D2D multicast communication under SDN architecture. AEU-Int J Electron Commun 132:153610","journal-title":"AEU-Int J Electron Commun"},{"key":"4634_CR15","doi-asserted-by":"crossref","unstructured":"Raj S, Improved Ghosh D, Optimal DBSCAN, for Embedded Applications Using High-Resolution Automotive Radar. In, (2020) 21st International Radar Symposium (IRS). IEEE 2020:343\u2013346","DOI":"10.23919\/IRS48640.2020.9253774"},{"key":"4634_CR16","doi-asserted-by":"publisher","first-page":"102837","DOI":"10.1016\/j.bspc.2021.102837","volume":"69","author":"K Mardani","year":"2021","unstructured":"Mardani K, Maghooli K (2021) Enhancing retinal blood vessel segmentation in medical images using combined segmentation modes extracted by DBSCAN and morphological reconstruction. Biomed Signal Process Control 69:102837","journal-title":"Biomed Signal Process Control"},{"issue":"5","key":"4634_CR17","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1002\/wics.1510","volume":"12","author":"F Fouedjio","year":"2020","unstructured":"Fouedjio F (2020) Clustering of multivariate geostatistical data. Wiley Interdiscipl Rev: Comput Stat 12(5):1510","journal-title":"Wiley Interdiscipl Rev: Comput Stat"},{"key":"4634_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.comcom.2021.03.021","volume":"174","author":"L Wang","year":"2021","unstructured":"Wang L, Wang H, Han X, Zhou W (2021) A novel adaptive density-based spatial clustering of application with noise based on bird swarm optimization algorithm. Computer Commun 174:205\u2013214","journal-title":"Computer Commun"},{"issue":"1","key":"4634_CR19","doi-asserted-by":"publisher","first-page":"172","DOI":"10.3390\/s19010172","volume":"19","author":"C Wang","year":"2019","unstructured":"Wang C, Ji M, Wang J, Wen W, Li T, Sun Y (2019) An improved DBSCAN method for LiDAR data segmentation with automatic Eps estimation. Sensors 19(1):172","journal-title":"Sensors"},{"key":"4634_CR20","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ins.2021.06.062","volume":"576","author":"Z Jian","year":"2021","unstructured":"Jian Z, Zhu G (2021) Affine invariance of meta-heuristic algorithms. Inf Sci 576:37\u201353","journal-title":"Inf Sci"},{"key":"4634_CR21","doi-asserted-by":"publisher","first-page":"10237","DOI":"10.1007\/s00500-021-05973-1","volume":"25","author":"P Agarwal","year":"2021","unstructured":"Agarwal P, Mehta S, Abraham A (2021) A meta-heuristic density-based subspace clustering algorithm for high-dimensional data. Soft Comput 25:10237\u201310256","journal-title":"Soft Comput"},{"key":"4634_CR22","doi-asserted-by":"publisher","first-page":"102195","DOI":"10.1016\/j.resourpol.2021.102195","volume":"73","author":"H Zhang","year":"2021","unstructured":"Zhang H, Nguyen H, Bui XN, Pradhan B, Mai NL, Vu DA (2021) Proposing two novel hybrid intelligence models for forecasting copper price based on extreme learning machine and meta-heuristic algorithms. Resour Policy 73:102195","journal-title":"Resour Policy"},{"key":"4634_CR23","first-page":"1","volume":"55","author":"H Singh","year":"2021","unstructured":"Singh H, Singh B, Kaur M (2021) An improved elephant herding optimization for global optimization problems. Eng Computers 55:1\u201333","journal-title":"Eng Computers"},{"key":"4634_CR24","doi-asserted-by":"publisher","first-page":"104085","DOI":"10.1109\/ACCESS.2019.2931334","volume":"7","author":"W Lai","year":"2019","unstructured":"Lai W, Zhou M, Hu F, Bian K, Song Q (2019) A new DBSCAN parameters determination method based on improved MVO. IEEE Access 7:104085\u2013104095","journal-title":"IEEE Access"},{"key":"4634_CR25","doi-asserted-by":"crossref","unstructured":"Jian S, Li D, Yu Y (2021) Research on Taxi Operation Characteristics by Improved DBSCAN Density Clustering Algorithm and K-means Clustering Algorithm. In: Journal of Physics: Conference Series. vol. 1952. IOP Publishing; p. 042103","DOI":"10.1088\/1742-6596\/1952\/4\/042103"},{"key":"4634_CR26","doi-asserted-by":"publisher","first-page":"115054","DOI":"10.1016\/j.eswa.2021.115054","volume":"178","author":"Q Zhu","year":"2021","unstructured":"Zhu Q, Tang X, Elahi A (2021) Application of the novel harmony search optimization algorithm for DBSCAN clustering. Expert Syst Appl 178:115054","journal-title":"Expert Syst Appl"},{"key":"4634_CR27","doi-asserted-by":"publisher","first-page":"115763","DOI":"10.1016\/j.eswa.2021.115763","volume":"186","author":"L Hu","year":"2021","unstructured":"Hu L, Liu H, Zhang J, Liu A (2021) KR-DBSCAN: a density-based clustering algorithm based on reverse nearest neighbor and influence space. Expert Syst Appl 186:115763","journal-title":"Expert Syst Appl"},{"key":"4634_CR28","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.comcom.2020.12.019","volume":"167","author":"M Li","year":"2021","unstructured":"Li M, Bi X, Wang L, Han X (2021) A method of two-stage clustering learning based on improved DBSCAN and density peak algorithm. Computer Commun 167:75\u201384","journal-title":"Computer Commun"},{"key":"4634_CR29","doi-asserted-by":"publisher","first-page":"113609","DOI":"10.1016\/j.cma.2020.113609","volume":"376","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Diabat A, Mirjalili S, Abd Elaziz M, Gandomi AH (2021) The arithmetic optimization algorithm. Computer Methods Appl Mech Eng 376:113609","journal-title":"Computer Methods Appl Mech Eng"},{"issue":"3","key":"4634_CR30","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s10589-019-00127-4","volume":"74","author":"JJ Brust","year":"2019","unstructured":"Brust JJ, Marcia RF, Petra CG (2019) Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints. Comput Optim Appl 74(3):669\u2013701","journal-title":"Comput Optim Appl"},{"issue":"1","key":"4634_CR31","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00366-018-0590-x","volume":"35","author":"MA Bouhlel","year":"2019","unstructured":"Bouhlel MA, Martins JR (2019) Gradient-enhanced kriging for high-dimensional problems. Eng Computers 35(1):157\u2013173","journal-title":"Eng Computers"},{"key":"4634_CR32","doi-asserted-by":"publisher","first-page":"1424590","DOI":"10.1155\/2019\/1424590","volume":"2019","author":"G Fu","year":"2019","unstructured":"Fu G, Wang C, Zhang D, Zhao J, Wang H (2019) A multiobjective particle swarm optimization algorithm based on multipopulation coevolution for weapon-target assignment. Math Probl Eng 2019:1424590","journal-title":"Math Probl Eng"},{"issue":"6","key":"4634_CR33","doi-asserted-by":"publisher","first-page":"68","DOI":"10.3390\/computation9060068","volume":"9","author":"ZM Elgamal","year":"2021","unstructured":"Elgamal ZM, Yasin NM, Sabri AQM, Sihwail R, Tubishat M, Jarrah H (2021) Improved equilibrium optimization algorithm using elite opposition-based learning and new local search strategy for feature selection in medical datasets. Computation 9(6):68","journal-title":"Computation"},{"issue":"8","key":"4634_CR34","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1002\/tee.23405","volume":"16","author":"D Lei","year":"2021","unstructured":"Lei D, You T, Cai L (2021) Parameter identification of roll motion equation of ship in regular wave using opposition based learning gaussian bare bone imperialist competition algorithm. IEEJ Trans Electr Electron Eng 16(8):1086\u20131092","journal-title":"IEEJ Trans Electr Electron Eng"},{"key":"4634_CR35","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1007\/s11227-021-03814-4","volume":"78","author":"A Nekooei-Joghdani","year":"2021","unstructured":"Nekooei-Joghdani A, Safi-Esfahani F (2021) Dynamic scheduling of independent tasks in cloud computing applying a new hybrid metaheuristic algorithm including Gabor filter, opposition-based learning, multi-verse optimizer, and multi-tracker optimization algorithms. J Supercomput 78:1182\u20131243","journal-title":"J Supercomput"},{"key":"4634_CR36","unstructured":"Ester M, Kriegel H, Sander J, Xu X, Idrissov A, Nascimento M et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD. vol. 2. ACM Press. p. 49\u201360"},{"issue":"11","key":"4634_CR37","doi-asserted-by":"publisher","first-page":"8823","DOI":"10.1007\/s00521-022-06906-1","volume":"34","author":"L Abualigah","year":"2022","unstructured":"Abualigah L, Ewees AA, Al-qaness MAA, Elaziz MA, Yousri D, Ibrahim RA et al (2022) Boosting arithmetic optimization algorithm by sine cosine algorithm and levy flight distribution for solving engineering optimization problems. Neural Comput Appl 34(11):8823\u20138852","journal-title":"Neural Comput Appl"},{"key":"4634_CR38","doi-asserted-by":"crossref","unstructured":"Kamil AT, Saleh HM, Abd-Alla IH (2021) A multi-swarm structure for particle swarm optimization: Solving the welded beam design problem. In: Journal of Physics: Conference Series. vol. 1804. IOP Publishing. p. 01201","DOI":"10.1088\/1742-6596\/1804\/1\/012012"},{"key":"4634_CR39","first-page":"1","volume":"87","author":"S Gupta","year":"2021","unstructured":"Gupta S (2021) Enhanced harmony search algorithm with non-linear control parameters for global optimization and engineering design problems. Eng Computers 87:1\u201324","journal-title":"Eng Computers"},{"key":"4634_CR40","doi-asserted-by":"publisher","first-page":"100064","DOI":"10.1016\/j.rico.2021.100064","volume":"5","author":"N Kumar","year":"2021","unstructured":"Kumar N, Mahato SK, Bhunia AK (2021) Design of an efficient hybridized CS-PSO algorithm and its applications for solving constrained and bound constrained structural engineering design problems. Results Control Optim 5:100064","journal-title":"Results Control Optim"},{"issue":"20","key":"4634_CR41","doi-asserted-by":"publisher","first-page":"15529","DOI":"10.1007\/s00500-020-04881-0","volume":"24","author":"MH Rad","year":"2020","unstructured":"Rad MH, Abdolrazzagh-Nezhad M (2020) A new hybridization of DBSCAN and fuzzy earthworm optimization algorithm for data cube clustering. Soft Comput 24(20):15529\u201315549","journal-title":"Soft Comput"},{"issue":"6","key":"4634_CR42","doi-asserted-by":"publisher","first-page":"6214","DOI":"10.1007\/s11227-020-03524-3","volume":"77","author":"N Gholizadeh","year":"2021","unstructured":"Gholizadeh N, Saadatfar H, Hanafi N (2021) K-DBSCAN: an improved DBSCAN algorithm for big data. J Supercomput 77(6):6214\u20136235","journal-title":"J Supercomput"},{"key":"4634_CR43","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.neucom.2019.09.023","volume":"377","author":"H Zhang","year":"2020","unstructured":"Zhang H, Guo H, Wang X, Ji Y, Wu QJ (2020) Clothescounter: a framework for star-oriented clothes mining from videos. Neurocomputing 377:38\u201348","journal-title":"Neurocomputing"},{"issue":"6","key":"4634_CR44","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/TKDE.2017.2787640","volume":"30","author":"A Bryant","year":"2017","unstructured":"Bryant A, Cios K (2017) RNN-DBSCAN: a density-based clustering algorithm using reverse nearest neighbor density estimates. IEEE Trans Knowl Data Eng 30(6):1109\u20131121","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4634_CR45","first-page":"6691724","volume":"2021","author":"J Jiang","year":"2021","unstructured":"Jiang J, Feng T, Liu C (2021) An improved nonlinear grey bernoulli model based on the whale optimization algorithm and its application. Math Probl Eng 2021:6691724","journal-title":"Math Probl Eng"},{"issue":"5","key":"4634_CR46","doi-asserted-by":"publisher","first-page":"4027","DOI":"10.1007\/s00500-020-05431-4","volume":"25","author":"S Abd El-sattar","year":"2021","unstructured":"Abd El-sattar S, Kamel S, Ebeed M, Jurado F (2021) An improved version of salp swarm algorithm for solving optimal power flow problem. Soft Comput 25(5):4027\u20134052","journal-title":"Soft Comput"},{"key":"4634_CR47","doi-asserted-by":"publisher","first-page":"102505","DOI":"10.1016\/j.yofte.2021.102505","volume":"63","author":"N Chouhan","year":"2021","unstructured":"Chouhan N, Bhatt UR, Upadhyay R (2021) Weighted salp swarm and salp swarm algorithms in fiWi access network: a new paradigm for ONU placement. Opt Fiber Technol 63:102505","journal-title":"Opt Fiber Technol"},{"key":"4634_CR48","first-page":"1","volume":"45","author":"R Mohakud","year":"2022","unstructured":"Mohakud R, Dash R (2022) Skin cancer image segmentation utilizing a novel EN-GWO based hyper-parameter optimized FCEDN. J King Saud Univ-Computer Inf Sci 45:1\u201316","journal-title":"J King Saud Univ-Computer Inf Sci"},{"key":"4634_CR49","doi-asserted-by":"publisher","first-page":"2332","DOI":"10.1016\/j.egyr.2021.04.042","volume":"7","author":"YP Xu","year":"2021","unstructured":"Xu YP, Tan JW, Zhu DJ, Ouyang P, Taheri B (2021) Model identification of the proton exchange membrane fuel cells by extreme learning machine and a developed version of arithmetic optimization algorithm. Energy Rep 7:2332\u20132342","journal-title":"Energy Rep"},{"key":"4634_CR50","doi-asserted-by":"crossref","unstructured":"Kaveh A, Hamedani KB (2022) Improved arithmetic optimization algorithm and its application to discrete structural optimization. In: Structures. vol. 35. Elsevier; p. 748\u2013764","DOI":"10.1016\/j.istruc.2021.11.012"},{"key":"4634_CR51","doi-asserted-by":"publisher","first-page":"105659","DOI":"10.1016\/j.knosys.2020.105659","volume":"195","author":"P Karczmarek","year":"2020","unstructured":"Karczmarek P, Kiersztyn A, Pedrycz W, Al E (2020) K-Means-based isolation forest. Knowl-Based Syst 195:105659","journal-title":"Knowl-Based Syst"},{"key":"4634_CR52","doi-asserted-by":"crossref","unstructured":"Allab K, Labiod L, Nadif M (2016) Power simultaneous spectral data embedding and clustering. In: Proceedings of the 2016 SIAM International Conference on Data Mining. SIAM; p. 270\u2013278","DOI":"10.1137\/1.9781611974348.31"},{"issue":"1","key":"4634_CR53","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/s11227-018-2380-z","volume":"75","author":"JH Kim","year":"2019","unstructured":"Kim JH, Choi JH, Yoo KH, Nasridinov A (2019) AA-DBSCAN: an approximate adaptive DBSCAN for finding clusters with varying densities. J Supercomput 75(1):142\u2013169","journal-title":"J Supercomput"},{"issue":"6191","key":"4634_CR54","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492\u20131496","journal-title":"Science"},{"key":"4634_CR55","first-page":"1","volume":"89","author":"W Guo","year":"2022","unstructured":"Guo W, Xu P, Dai F, Hou Z (2022) Harris hawks optimization algorithm based on elite fractional mutation for data clustering. Appl Intell 89:1\u201327","journal-title":"Appl Intell"},{"issue":"4","key":"4634_CR56","doi-asserted-by":"publisher","first-page":"2031","DOI":"10.1007\/s10489-020-01926-7","volume":"51","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Ding S, Wang L, Wang Y, Ding L (2021) Chameleon algorithm based on mutual k-nearest neighbors. Appl Intell 51(4):2031\u20132044","journal-title":"Appl Intell"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04634-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04634-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04634-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T03:18:31Z","timestamp":1668309511000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04634-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":56,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["4634"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04634-w","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,26]]},"assertion":[{"value":"26 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}