{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T20:26:09Z","timestamp":1769631969858,"version":"3.49.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["no.61571149"],"award-info":[{"award-number":["no.61571149"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005046","name":"Natural Science Foundation of Heilongjiang Province","doi-asserted-by":"crossref","award":["no.LH2020F017"],"award-info":[{"award-number":["no.LH2020F017"]}],"id":[{"id":"10.13039\/501100005046","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Initiation Fund for Postdoctoral Research in Heilongjiang Province","award":["no.LBH-Q19098"],"award-info":[{"award-number":["no.LBH-Q19098"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10489-022-03962-x","type":"journal-article","created":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T08:08:23Z","timestamp":1665994103000},"page":"13763-13800","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Underdetermined blind source separation method based on quantum Archimedes optimization algorithm"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8505-6828","authenticated-orcid":false,"given":"Hongyuan","family":"Gao","sequence":"first","affiliation":[]},{"given":"Zhiwei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Shihao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Helin","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"3962_CR1","doi-asserted-by":"publisher","first-page":"101255","DOI":"10.1016\/j.phycom.2020.101255","volume":"45","author":"C Wei","year":"2021","unstructured":"Wei C, Guo SX, Ren L, Yu Y (2021) Underdetermined blind source separation for linear instantaneous mixing system in the non-cooperative wireless communication. Phys Commun 45:101255. https:\/\/doi.org\/10.1016\/J.PHYCOM.2020.101255","journal-title":"Phys Commun"},{"issue":"2","key":"3962_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2020\/2428710 10.1155\/2020\/2428710","volume":"2020","author":"HC Wang","year":"2020","unstructured":"Wang HC, Du WL, Guo LZ (2020) A sparse underdetermined blind source separation method and its application in fault diagnosis of rotating machinery. Complexity 2020(2):1\u201317. https:\/\/doi.org\/10.1155\/2020\/2428710https:\/\/doi.org\/10.1155\/2020\/2428710","journal-title":"Complexity"},{"key":"3962_CR3","doi-asserted-by":"publisher","first-page":"87606","DOI":"10.1109\/ACCESS.2019.2925896","volume":"7","author":"Y Xie","year":"2019","unstructured":"Xie Y, Xie K, Xie S (2019) Underdetermined blind source separation for heart sound using higher-order statistics and sparse representation. IEEE Access 7:87606\u201387616. https:\/\/doi.org\/10.1109\/ACCESS.2019.2925896https:\/\/doi.org\/10.1109\/ACCESS.2019.2925896","journal-title":"IEEE Access"},{"issue":"11","key":"3962_CR4","doi-asserted-by":"publisher","first-page":"2353","DOI":"10.1016\/S0165-1684(01)00120-7","volume":"81","author":"P Bofill","year":"2001","unstructured":"Bofill P, Zibulevsky M (2001) Underdetermined blind source separation using sparse representations. Signal Process 81(11):2353\u20132362. https:\/\/doi.org\/10.1016\/S0165-1684(01)00120-7","journal-title":"Signal Process"},{"issue":"4","key":"3962_CR5","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1109\/TNN.2005.849840","volume":"16","author":"G Pando","year":"2005","unstructured":"Pando G, Fabian T, Andrzej C (2005) Sparse component analysis and blind source separation of underdetermined mixtures. IEEE Trans Neural Netw 16(4):992\u2013996. https:\/\/doi.org\/10.1109\/TNN.2005.849840https:\/\/doi.org\/10.1109\/TNN.2005.849840","journal-title":"IEEE Trans Neural Netw"},{"issue":"1","key":"3962_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Genetic algorithms. Sci Am 267(1):66\u201372. https:\/\/doi.org\/10.1038\/scientificamerican0792-66","journal-title":"Sci Am"},{"key":"3962_CR7","doi-asserted-by":"publisher","unstructured":"Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: MHS\u201995. proceedings of the sixth international symposium on micro machine and human science, 1995, Nagoya, Japan. https:\/\/doi.org\/10.1109\/MHS.1995.494215","DOI":"10.1109\/MHS.1995.494215"},{"key":"3962_CR8","doi-asserted-by":"publisher","unstructured":"Dorigo M, Di GC (1999) Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 congress on evolutionary computation, 1999 CEC 99. https:\/\/doi.org\/10.1109\/CEC.1999.782657https:\/\/doi.org\/10.1109\/CEC.1999.782657","DOI":"10.1109\/CEC.1999.782657 10.1109\/CEC.1999.782657"},{"issue":"1","key":"3962_CR9","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Basturk B (2008) On the performance of artificial bee colony (abc) algorithm. Appl Soft Comput 8(1):687\u2013697. https:\/\/doi.org\/10.1016\/j.asoc.2007.05.007","journal-title":"Appl Soft Comput"},{"issue":"4","key":"3962_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00034-020-01621-5","volume":"2021","author":"R Wang","year":"2021","unstructured":"Wang R (2021) Blind source separation based on adaptive artificial bee colony optimization and kurtosis. Circ Syst Signal Process 2021(4):1\u201317. https:\/\/doi.org\/10.1007\/s00034-020-01621-5","journal-title":"Circ Syst Signal Process"},{"key":"3962_CR11","doi-asserted-by":"publisher","first-page":"107635","DOI":"10.1016\/j.asoc.2021.107635","volume":"111","author":"NK Sreelaja","year":"2021","unstructured":"Sreelaja NK (2021) Ant colony optimization based light weight binary search for efficient signature matching to filter ransomware. Appl Soft Comput 111:107635. https:\/\/doi.org\/10.1016\/J.ASOC.2021.107635https:\/\/doi.org\/10.1016\/J.ASOC.2021.107635","journal-title":"Appl Soft Comput"},{"issue":"C","key":"3962_CR12","doi-asserted-by":"publisher","first-page":"107291","DOI":"10.1016\/j.measurement.2019.107291","volume":"152","author":"AH Zaji","year":"2020","unstructured":"Zaji AH, Bonakdari H, Khameneh HZ, Khodashenas SR (2020) Application of optimized artificial and radial basis neural networks by using modified genetic algorithm on discharge coefficient prediction of modified labyrinth side weir with two and four cycles. Measurement 152(C):107291. https:\/\/doi.org\/10.1016\/j.measurement.2019.107291https:\/\/doi.org\/10.1016\/j.measurement.2019.107291","journal-title":"Measurement"},{"issue":"2016","key":"3962_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95(2016):51\u201367. https:\/\/doi.org\/10.1016\/j.advengsoft.2016.01.008https:\/\/doi.org\/10.1016\/j.advengsoft.2016.01.008","journal-title":"Adv Eng Softw"},{"issue":"21","key":"3962_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.compstruc.2016.03.001","volume":"169","author":"A Askarzadeh","year":"2016","unstructured":"Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 169(21):1\u201312. https:\/\/doi.org\/10.1016\/j.compstruc.2016.03.001https:\/\/doi.org\/10.1016\/j.compstruc.2016.03.001","journal-title":"Comput Struct"},{"key":"3962_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361. https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007","journal-title":"Adv Eng Softw"},{"key":"3962_CR16","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"AA Heidari","year":"2019","unstructured":"Heidari AA, Mirjalili S, Faris H, Alijarah I, Mafarja M, H C (2019) Harris hawks optimization: algorithm and applications. Futur Gener Comput Syst 97:849\u2013872. https:\/\/doi.org\/10.1016\/j.future.2019.02.028https:\/\/doi.org\/10.1016\/j.future.2019.02.028","journal-title":"Futur Gener Comput Syst"},{"key":"3962_CR17","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.future.2020.03.055","volume":"111","author":"S Li","year":"2020","unstructured":"Li S, Chen M, Wang M, Heidari AA, Mirjalili S (2020) Slime mould algorithm: a new method for stochastic optimization. Futur Gener Comput Syst 111:300\u2013323. https:\/\/doi.org\/10.1016\/j.future.2020.03.055https:\/\/doi.org\/10.1016\/j.future.2020.03.055","journal-title":"Futur Gener Comput Syst"},{"key":"3962_CR18","doi-asserted-by":"publisher","first-page":"106347","DOI":"10.1016\/j.asoc.2020.106347","volume":"95","author":"MA Elaziz","year":"2020","unstructured":"Elaziz MA, Heidari AA, Fujita H, Moayedi H (2020) A competitive chain-based harris hawks optimizer for global optimization and multi-level image thresholding problems. Appl Soft Comput 95:106347. https:\/\/doi.org\/10.1016\/j.asoc.2020.106347","journal-title":"Appl Soft Comput"},{"key":"3962_CR19","doi-asserted-by":"publisher","unstructured":"Suresha HS, Parthasarathy SS (2021) Detection of alzheimer\u2019s disease using grey wolf optimization based clustering algorithm and deep neural network from magnetic resonance images. Distrib Parallel Databases :1\u201329. https:\/\/doi.org\/10.1007\/S10619-021-07345-Yhttps:\/\/doi.org\/10.1007\/S10619-021-07345-Y","DOI":"10.1007\/S10619-021-07345-Y 10.1007\/S10619-021-07345-Y"},{"key":"3962_CR20","doi-asserted-by":"publisher","unstructured":"Necira A, Naimi D, Salhi A, Salhi S, Menani S (2021) Dynamic crow search algorithm based on adaptive parameters for large-scale global optimization. Evol Intell :1\u201317. https:\/\/doi.org\/10.1007\/S12065-021-00628-4https:\/\/doi.org\/10.1007\/S12065-021-00628-4","DOI":"10.1007\/S12065-021-00628-4 10.1007\/S12065-021-00628-4"},{"key":"3962_CR21","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1007\/s10489-020-01893-z","volume":"51","author":"FA Hashim","year":"2020","unstructured":"Hashim FA, Hussain K, Houssein EH, Mabrouk MS, Al-Atabany W (2020) Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems. Appl Intell 51:1531\u20131551. https:\/\/doi.org\/10.1007\/s10489-020-01893-z","journal-title":"Appl Intell"},{"issue":"13","key":"3962_CR22","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) Gsa: a gravitational search algorithm. Inf Sci 179(13):2232\u20132248. https:\/\/doi.org\/10.1016\/j.ins.2009.03.004","journal-title":"Inf Sci"},{"key":"3962_CR23","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) Sca: a sine cosine algorithm for solving optimization problems. Knowl Based Syst 96:120\u2013133. https:\/\/doi.org\/10.1016\/j.knosys.2015.12.022https:\/\/doi.org\/10.1016\/j.knosys.2015.12.022","journal-title":"Knowl Based Syst"},{"issue":"3","key":"3962_CR24","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/TEVC.2009.2033580","volume":"14","author":"AYS Lam","year":"2010","unstructured":"Lam AYS, Li VOK (2010) Chemical-reaction-inspired metaheuristic for optimization. IEEE Trans Evol Comput 14(3):381\u2013399. https:\/\/doi.org\/10.1109\/TEVC.2009.2033580","journal-title":"IEEE Trans Evol Comput"},{"key":"3962_CR25","doi-asserted-by":"publisher","unstructured":"Precup R, David R, Petriu EM, Preitl S, Paul AS (2011) Gravitational search algorithm-based tuning of fuzzy control systems with a reduced parametric sensitivity. In: Gaspar-Cunha A, Takahashi R, Schaefer G, Costa L (eds) Soft Computing in Industrial Applications. Advances in Intelligent and Soft Computing. https:\/\/doi.org\/10.1007\/978-3-642-20505-7_12, vol 96. Springer, Berlin","DOI":"10.1007\/978-3-642-20505-7_12"},{"key":"3962_CR26","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ins.2021.10.070","volume":"583","author":"LA Zamfirache","year":"2022","unstructured":"Zamfirache LA, Precup R, Roman R, Petriu EM (2022) Reinforcement learning-based control using q-learning and gravitational search algorithm with experimental validation on a nonlinear servo system. Inf Sci 583:99\u2013120. https:\/\/doi.org\/10.1016\/j.ins.2021.10.070","journal-title":"Inf Sci"},{"key":"3962_CR27","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s11235-021-00804-y","volume":"78","author":"S Zhang","year":"2021","unstructured":"Zhang S, Fan F, Li W, Chu S, Pan J (2021) A parallel compact sine cosine algorithm for tdoa localization of wireless sensor network. Telecommun Syst 78:213\u2013223. https:\/\/doi.org\/10.1007\/s11235-021-00804-y","journal-title":"Telecommun Syst"},{"issue":"9","key":"3962_CR28","doi-asserted-by":"publisher","first-page":"1762","DOI":"10.1016\/j.sigpro.2009.03.017","volume":"89","author":"VG Reju","year":"2009","unstructured":"Reju VG, Koh SN, Soon IY (2009) An algorithm for mixing matrix estimation in instantaneous blind source separation. Signal Process 89(9):1762\u20131773. https:\/\/doi.org\/10.1016\/j.sigpro.2009.03.017","journal-title":"Signal Process"},{"key":"3962_CR29","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.neucom.2015.08.008","volume":"173","author":"JD Sun","year":"2016","unstructured":"Sun JD, Li YX, Wen JT, Yan SN (2016) Novel mixing matrix estimation approach in underdetermined blind source separation. Neurocomputing 173:623\u2013632. https:\/\/doi.org\/10.1016\/j.neucom.2015.08.008","journal-title":"Neurocomputing"},{"issue":"1","key":"3962_CR30","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3390\/sym10010021","volume":"10","author":"Q Guo","year":"2018","unstructured":"Guo Q, Li C, Ruan GQ (2018) Mixing matrix estimation of underdetermined blind source separation based on data field and improved fcm clustering. Symmetry 10(1):21\u201332. https:\/\/doi.org\/10.3390\/sym10010021","journal-title":"Symmetry"},{"issue":"8","key":"3962_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2020\/6136298","volume":"2020","author":"HY Gao","year":"2020","unstructured":"Gao HY, Zhang SB, Su YM, Diao M (2020) Energy harvesting and information transmission mode design for cooperative eh-abled iot applications in beyond 5g networks. Wirel Commun Mob Comput 2020(8):1\u201317. https:\/\/doi.org\/10.1155\/2020\/6136298","journal-title":"Wirel Commun Mob Comput"},{"key":"3962_CR32","doi-asserted-by":"publisher","first-page":"103198","DOI":"10.1016\/j.dsp.2021.103198","volume":"117","author":"HY Gao","year":"2021","unstructured":"Gao HY, Chen MH, Du YN, Jakobsson A (2021) Monostatic mimo radar direction finding in impulse noise. Digit Signal Process 117:103198. https:\/\/doi.org\/10.1016\/j.dsp.2021.103198","journal-title":"Digit Signal Process"},{"key":"3962_CR33","doi-asserted-by":"publisher","first-page":"1496156","DOI":"10.1155\/2021\/1496156","volume":"2021","author":"ZW Zhang","year":"2021","unstructured":"Zhang ZW, Gao HY, Ma JY, Wang SH, Sun HL (2021) Blind source separation based on quantum slime mould algorithm in impulse noise. Math Probl Eng 2021:1496156. https:\/\/doi.org\/10.1155\/2021\/1496156","journal-title":"Math Probl Eng"},{"issue":"12","key":"3962_CR34","doi-asserted-by":"publisher","first-page":"5695","DOI":"10.1109\/TSP.2007.900760","volume":"55","author":"M Elad","year":"2007","unstructured":"Elad M (2007) Optimized projections for compressed sensing. IEEE Trans Signal Process 55 (12):5695\u20135702. https:\/\/doi.org\/10.1109\/TSP.2007.900760","journal-title":"IEEE Trans Signal Process"},{"issue":"1","key":"3962_CR35","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TSP.2008.2007606","volume":"57","author":"H Mohimani","year":"2009","unstructured":"Mohimani H, Babaie-Zadeh M, Jutten C (2009) A fast approach for overcomplete sparse decomposition based on smoothed l-0 norm. IEEE Trans Signal Process 57(1):289\u2013301. https:\/\/doi.org\/10.1109\/TSP.2008.2007606","journal-title":"IEEE Trans Signal Process"},{"key":"3962_CR36","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.neunet.2014.10.010","volume":"63","author":"L Vidya","year":"2015","unstructured":"Vidya L, Vivekanand V, Shyamkumar U, Mishra D (2015) Rbf network based sparse signal recovery algorithm for compressed sensing reconstruction. Neural Netw 63:66\u201378. https:\/\/doi.org\/10.1016\/j.neunet.2014.10.010","journal-title":"Neural Netw"},{"issue":"1","key":"3962_CR37","doi-asserted-by":"publisher","first-page":"94","DOI":"10.13190\/j.jbupt.2017.01.017","volume":"40","author":"WH Fu","year":"2017","unstructured":"Fu WH, Nong B, Chen JH, Liu NA (2017) Source recovery in underdetermined blind source separation based on rbf network. J Beijing Univ Posts Telecommun 40(1):94\u201398. https:\/\/doi.org\/10.13190\/j.jbupt.2017.01.017","journal-title":"J Beijing Univ Posts Telecommun"},{"issue":"1","key":"3962_CR38","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/CC.2018.8290813","volume":"15","author":"WH Fu","year":"2018","unstructured":"Fu WH, Nong B, Zhou XB, Liu J, Li CL (2018) Source recovery in underdetermined blind source separation based on artificial neural network. China Commun 15(1):140\u2013154. https:\/\/doi.org\/10.1109\/CC.2018.8290813","journal-title":"China Commun"},{"key":"3962_CR39","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ins.2021.03.055","volume":"571","author":"BC Wang","year":"2021","unstructured":"Wang BC, Li HX, Feng YS, Wen J (2021) An adaptive fuzzy penalty method for constrained evolutionary optimization. Inf Sci 571:358\u2013374. https:\/\/doi.org\/10.1016\/j.ins.2021.03.055","journal-title":"Inf Sci"},{"key":"3962_CR40","doi-asserted-by":"publisher","first-page":"107417","DOI":"10.1016\/j.asoc.2021.107417","volume":"107","author":"R Tao","year":"2021","unstructured":"Tao R, Meng Z, Zhou HL (2021) A self-adaptive strategy based firefly algorithm for constrained engineering design problems. Appl Soft Comput 107:107417. https:\/\/doi.org\/10.1016\/J.ASOC.2021.107417","journal-title":"Appl Soft Comput"},{"key":"3962_CR41","doi-asserted-by":"publisher","first-page":"113762","DOI":"10.1016\/j.enconman.2020.113762","volume":"230","author":"S Zheng","year":"2021","unstructured":"Zheng S, Ding RQ, Zhang JH, Xu B (2021) Global energy efficiency improvement of redundant hydraulic manipulator with dynamic programming. Energy Convers Manag 230:113762. https:\/\/doi.org\/10.1016\/j.enconman.2020.113762","journal-title":"Energy Convers Manag"},{"issue":"6","key":"3962_CR42","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1109\/LSP.2013.2260822","volume":"20","author":"XP Du","year":"2013","unstructured":"Du XP, Cheng LZ, Liu LF (2013) A swarm intelligence algorithm for joint sparse recovery. IEEE Signal Process Lett 20(6):611\u2013614. https:\/\/doi.org\/10.1109\/LSP.2013.2260822","journal-title":"IEEE Signal Process Lett"},{"key":"3962_CR43","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.asoc.2017.03.034","volume":"57","author":"Q Lin","year":"2017","unstructured":"Lin Q, Hu B, Tang Y, Zhang LY, Chen J, Wang X, Ming Z (2017) A local search enhanced differential evolutionary algorithm for sparse recovery. Appl Soft Comput 57:144\u2013163. https:\/\/doi.org\/10.1016\/j.asoc.2017.03.034","journal-title":"Appl Soft Comput"},{"issue":"2","key":"3962_CR44","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.jestch.2020.09.006","volume":"24","author":"ME Erko","year":"2021","unstructured":"Erko ME, Karaboa N (2021) Sparse signal reconstruction by swarm intelligence algorithms. Eng Sci Technol Int J 24(2):319\u2013330. https:\/\/doi.org\/10.1016\/j.jestch.2020.09.006","journal-title":"Eng Sci Technol Int J"},{"issue":"4","key":"3962_CR45","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1162\/089976601300014385","volume":"13","author":"M Zibulevsky","year":"2001","unstructured":"Zibulevsky M, Pearlmutter BA (2001) Blind source separation by sparse decomposition in a signal dictionary. Neural Comput 13(4):863\u2013882. https:\/\/doi.org\/10.1162\/089976601300014385","journal-title":"Neural Comput"},{"issue":"10","key":"3962_CR46","doi-asserted-by":"publisher","first-page":"4723","DOI":"10.1109\/TIT.2009.2027527","volume":"55","author":"N Hurley","year":"2009","unstructured":"Hurley N, Rickard S (2009) Comparing measures of sparsity. IEEE Trans Inf Theory 55 (10):4723\u20134741. https:\/\/doi.org\/10.1109\/TIT.2009.2027527","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"3962_CR47","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/LSP.2011.2181945","volume":"19","author":"M Kleinsteuber","year":"2012","unstructured":"Kleinsteuber M, Shen H (2012) Blind source separation with compressively sensed linear mixtures. IEEE Signal Process Lett 19(2):107\u2013110. https:\/\/doi.org\/10.1109\/LSP.2011.2181945","journal-title":"IEEE Signal Process Lett"},{"issue":"1","key":"3962_CR48","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","unstructured":"Clerc M, Kennedy J (2002) The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58\u201373. https:\/\/doi.org\/10.1109\/4235.985692","journal-title":"IEEE Trans Evol Comput"},{"key":"3962_CR49","unstructured":"Molga M, Smutnicki C (2005) Test functions for optimization needs. Comput Inform Sci :1\u201343"},{"issue":"2","key":"3962_CR50","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1504\/IJMMNO.2013.055204","volume":"4","author":"M Jamil","year":"2013","unstructured":"Jamil M, Yang XS (2013) A literature survey of benchmark functions for global optimization problems. Int J Math Model Numer Optim 4 (2):150\u2013194. https:\/\/doi.org\/10.1504\/IJMMNO.2013.055204","journal-title":"Int J Math Model Numer Optim"},{"key":"3962_CR51","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.swevo.2015.07.003","volume":"26","author":"BY Qu","year":"2016","unstructured":"Qu BY, Liang JJ, Wang ZY, Chen Q, Suganthan PN (2016) Novel benchmark functions for continuous multimodal optimization with comparative results. Swarm Evol Comput 26:23\u201334. https:\/\/doi.org\/10.1016\/j.swevo.2015.07.003","journal-title":"Swarm Evol Comput"},{"key":"3962_CR52","unstructured":"Wu G, Mallipeddi R, Suganthan PN (2017) Problem Definitions and Evaluation Criteria for the CEC 2017 Competition and Special Session on Constrained Single Objective Real-Parameter Optimization. http:\/\/www.ntu.edu.sg\/home\/EPNSugan\/indexfiles\/CEC2017"},{"issue":"5","key":"3962_CR53","doi-asserted-by":"publisher","first-page":"388","DOI":"10.14569\/IJACSA.2019.0100548","volume":"10","author":"R Masadeh","year":"2019","unstructured":"Masadeh R, Mahafzah BA, Sharieh A (2019) Sea lion optimization algorithm. Int J Adv Comput Sci Appl (IJACSA) 10(5):388\u2013395. https:\/\/doi.org\/10.14569\/IJACSA.2019.0100548","journal-title":"Int J Adv Comput Sci Appl (IJACSA)"},{"key":"3962_CR54","doi-asserted-by":"publisher","unstructured":"Tan Y, Zhu YC (2010) Fireworks algorithm for optimization. In: Tan Y, Shi YH, Tan KC (eds) Advances in Swarm Intelligence, vol 6145. Springer, pp 355\u2013364. https:\/\/doi.org\/10.1007\/978-3-642-13495-1_44","DOI":"10.1007\/978-3-642-13495-1_44"},{"key":"3962_CR55","doi-asserted-by":"crossref","unstructured":"Xie Y, Xie K, Wu ZZ, Xie SL (2019) Underdetermined blind source separation of speech mixtures based on k-means clustering. In: 2019 Chinese control conference (CCC), IEEE, vol. 1, Shanghai Systems Science Press, pp 59\u201363","DOI":"10.23919\/ChiCC.2019.8865385"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03962-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03962-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03962-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T12:22:46Z","timestamp":1685535766000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03962-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":55,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["3962"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03962-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,17]]},"assertion":[{"value":"4 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}