{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T04:30:55Z","timestamp":1780893055737,"version":"3.54.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T00:00:00Z","timestamp":1710720000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T00:00:00Z","timestamp":1710720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61976108"],"award-info":[{"award-number":["61976108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Feature selection can be seen as a multi-objective task, where the goal is to select a subset of features that exhibit minimal correlation among themselves while maximizing their correlation with the target label. Multi-objective particle swarm optimization algorithm (MOPSO) has been extensively utilized for feature selection and has achieved good performance. However, most MOPSO-based feature selection methods are random and lack knowledge guidance in the initialization process, ignoring certain valuable prior information in the feature data, which may lead to the generated initial population being far from the true Pareto front (PF) and influence the population\u2019s rate of convergence. Additionally, MOPSO has a propensity to become stuck in local optima during the later iterations. In this paper, a novel feature selection method (fMOPSO-FS) is proposed. Firstly, with the aim of improving the initial solution quality and fostering the interpretability of the selected features, a novel initialization strategy that incorporates prior information during the initialization process of the particle swarm is proposed. Furthermore, an adaptive hybrid mutation strategy is proposed to avoid the particle swarm from getting stuck in local optima and to further leverage prior information. The experimental results demonstrate the superior performance of the proposed algorithm compared to the comparison algorithms. It yields a superior feature subset on nine UCI benchmark datasets and six gene expression profile datasets.<\/jats:p>","DOI":"10.1007\/s11063-024-11553-9","type":"journal-article","created":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T11:02:26Z","timestamp":1710759746000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A Feature Selection Method Based on Feature-Label Correlation Information and Self-Adaptive MOPSO"],"prefix":"10.1007","volume":"56","author":[{"given":"Fei","family":"Han","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fanyu","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qinghua","family":"Ling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henry","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianyi","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zijian","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haonan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,18]]},"reference":[{"key":"11553_CR1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2022.3218345","author":"R Jiao","year":"2022","unstructured":"Jiao R, Xue B, Zhang M (2022) Benefiting from single-objective feature selection to multiobjective feature selection: a multiform approach. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2022.3218345","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"11553_CR2","doi-asserted-by":"publisher","first-page":"56","DOI":"10.38094\/jastt1224","volume":"1","author":"R Zebari","year":"2020","unstructured":"Zebari R, Abdulazeez A, Zeebaree D, Zebari D, Saeed J (2020) A comprehensive review of dimensionality reduction techniques for feature selection and feature extraction. J Appl Sci Technol Trends 1(2):56\u201370. https:\/\/doi.org\/10.38094\/jastt1224","journal-title":"J Appl Sci Technol Trends"},{"key":"11553_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s11047-005-1625-y","volume":"5","author":"JJ Liang","year":"2006","unstructured":"Liang JJ, Baskar S, Suganthan PN, Qin AK (2006) Performance evaluation of multiagent genetic algorithm. Nat Comput 5:83\u201396. https:\/\/doi.org\/10.1007\/s11047-005-1625-y","journal-title":"Nat Comput"},{"key":"11553_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101291","volume":"78","author":"H Qiu","year":"2023","unstructured":"Qiu H, Xia X, Li Y, Deng X (2023) A dynamic multipopulation genetic algorithm for multiobjective workflow scheduling based on the longest common sequence. Swarm Evol Comput 78:101291. https:\/\/doi.org\/10.1016\/j.swevo.2023.101291","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"11553_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/TEVC.2016.2631279","volume":"22","author":"Q Lin","year":"2016","unstructured":"Lin Q, Liu S, Zhu Q, Tang C, Song R, Chen J, Zhang J (2016) Particle swarm optimization with a balanceable fitness estimation for many-objective optimization problems. IEEE Trans Evol Comput 22(1):32\u201346. https:\/\/doi.org\/10.1109\/TEVC.2016.2631279","journal-title":"IEEE Trans Evol Comput"},{"key":"11553_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.knosys.2019.01.018","volume":"171","author":"P Niu","year":"2019","unstructured":"Niu P, Niu S, Chang L (2019) The defect of the Grey Wolf optimization algorithm and its verification method. Knowl-Based Syst 171:37\u201343. https:\/\/doi.org\/10.1016\/j.knosys.2019.01.018","journal-title":"Knowl-Based Syst"},{"key":"11553_CR7","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995-international conference on neural networks, vol 4, pp 1942\u20131948. IEEE. https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"key":"11553_CR8","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.ins.2022.04.053","volume":"602","author":"F Wang","year":"2022","unstructured":"Wang F, Wang X, Sun S (2022) A reinforcement learning level-based particle swarm optimization algorithm for large-scale optimization. Inf Sci 602:298\u2013312. https:\/\/doi.org\/10.1016\/j.ins.2022.04.053","journal-title":"Inf Sci"},{"key":"11553_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105696","volume":"195","author":"Z Xiang","year":"2020","unstructured":"Xiang Z, Shao X, Wu H, Ji D, Yu F, Li Y (2020) An adaptive integral separated proportional-integral controller based strategy for particle swarm optimization. Knowl-Based Syst 195:105696. https:\/\/doi.org\/10.1016\/j.knosys.2020.105696","journal-title":"Knowl-Based Syst"},{"key":"11553_CR10","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2022.3227464","author":"X Xia","year":"2022","unstructured":"Xia X, Song H, Zhang Y, Gui L, Xu X, Li K, Li Y (2022) A particle swarm optimization with adaptive learning weights tuned by a multiple-input multiple-output fuzzy logic controller. IEEE Trans Fuzzy Syst. https:\/\/doi.org\/10.1109\/TFUZZ.2022.3227464","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"11553_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107394","volume":"107","author":"P Dhal","year":"2021","unstructured":"Dhal P, Azad C (2021) A multi-objective feature selection method using newton\u2019s law based pso with gwo. Appl Soft Comput 107:107394. https:\/\/doi.org\/10.1016\/j.asoc.2021.107394","journal-title":"Appl Soft Comput"},{"key":"11553_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ins.2015.02.031","volume":"307","author":"Z Wang","year":"2015","unstructured":"Wang Z, Li M, Li J (2015) A multi-objective evolutionary algorithm for feature selection based on mutual information with a new redundancy measure. Inf Sci 307:73\u201388. https:\/\/doi.org\/10.1016\/j.ins.2015.02.031","journal-title":"Inf Sci"},{"issue":"1","key":"11553_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.3233\/ICA-210664","volume":"29","author":"Y Xue","year":"2022","unstructured":"Xue Y, Zhu H, Neri F (2022) A self-adaptive multi-objective feature selection approach for classification problems. Integr Comput-Aided Eng 29(1):3\u201321. https:\/\/doi.org\/10.3233\/ICA-210664","journal-title":"Integr Comput-Aided Eng"},{"key":"11553_CR14","doi-asserted-by":"publisher","first-page":"33301","DOI":"10.1109\/ACCESS.2022.3162074","volume":"10","author":"J Feng","year":"2022","unstructured":"Feng J, Gong Z (2022) A novel feature selection method with neighborhood rough set and improved particle swarm optimization. IEEE Access 10:33301\u201333312. https:\/\/doi.org\/10.1109\/ACCESS.2022.3162074","journal-title":"IEEE Access"},{"issue":"3","key":"11553_CR15","doi-asserted-by":"publisher","first-page":"3545","DOI":"10.1007\/s10489-022-03465-9","volume":"53","author":"F Han","year":"2023","unstructured":"Han F, Wang T, Ling Q (2023) An improved feature selection method based on angle-guided multi-objective PSO and feature-label mutual information. Appl Intell 53(3):3545\u20133562. https:\/\/doi.org\/10.1007\/s10489-022-03465-9","journal-title":"Appl Intell"},{"issue":"1","key":"11553_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.32604\/jbd.2021.010364","volume":"3","author":"S Wang","year":"2021","unstructured":"Wang S, Yu X, Jia W (2021) A new population initialization of particle swarm optimization method based on pca for feature selection. J Big Data 3(1):1. https:\/\/doi.org\/10.32604\/jbd.2021.010364","journal-title":"J Big Data"},{"key":"11553_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110558","author":"X Li","year":"2023","unstructured":"Li X, Fu Q, Li Q, Ding W, Lin F, Zheng Z (2023) Multi-objective binary grey wolf optimization for feature selection based on guided mutation strategy. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2023.110558","journal-title":"Appl Soft Comput"},{"key":"11553_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02413-3","author":"S Zhou","year":"2022","unstructured":"Zhou S, Sha L, Zhu S, Wang L (2022) Adaptive hierarchical update particle swarm optimization algorithm with a multi-choice comprehensive learning strategy. Appl Intell. https:\/\/doi.org\/10.1007\/s10489-021-02413-3","journal-title":"Appl Intell"},{"key":"11553_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-020-00891-w","author":"B Wei","year":"2021","unstructured":"Wei B, Wang X, Xia X, Jiang M, Ding Z, Huang Y (2021) Novel self-adjusted particle swarm optimization algorithm for feature selection. Computing. https:\/\/doi.org\/10.1007\/s00607-020-00891-w","journal-title":"Computing"},{"key":"11553_CR20","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.ins.2019.06.042","volume":"502","author":"Z Xiang","year":"2019","unstructured":"Xiang Z, Ji D, Zhang H, Wu H, Li Y (2019) A simple PID-based strategy for particle swarm optimization algorithm. Inf Sci 502:558\u2013574. https:\/\/doi.org\/10.1016\/j.ins.2019.06.042","journal-title":"Inf Sci"},{"key":"11553_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101398","volume":"83","author":"S Li","year":"2023","unstructured":"Li S, Wang F, He Q, Wang X (2023) Deep reinforcement learning for multi-objective combinatorial optimization: a case study on multi-objective traveling salesman problem. Swarm Evol Comput 83:101398. https:\/\/doi.org\/10.1016\/j.swevo.2023.101398","journal-title":"Swarm Evol Comput"},{"key":"11553_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108640","volume":"245","author":"A Rashno","year":"2022","unstructured":"Rashno A, Shafipour M, Fadaei S (2022) Particle ranking: an efficient method for multi-objective particle swarm optimization feature selection. Knowl-Based Syst 245:108640. https:\/\/doi.org\/10.1016\/j.knosys.2022.108640","journal-title":"Knowl-Based Syst"},{"key":"11553_CR23","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.neunet.2019.12.005","volume":"123","author":"J Jiang","year":"2020","unstructured":"Jiang J, Han F, Ling Q, Wang J, Li T, Han H (2020) Efficient network architecture search via multiobjective particle swarm optimization based on decomposition. Neural Netw 123:305\u2013316. https:\/\/doi.org\/10.1016\/j.neunet.2019.12.005","journal-title":"Neural Netw"},{"key":"11553_CR24","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.asoc.2017.08.022","volume":"61","author":"P Liu","year":"2017","unstructured":"Liu P, Liu J (2017) Multi-leader PSO (MLPSO): a new PSO variant for solving global optimization problems. Appl Soft Comput 61:256\u2013263. https:\/\/doi.org\/10.1016\/j.asoc.2017.08.022","journal-title":"Appl Soft Comput"},{"key":"11553_CR25","unstructured":"Bonnlander BV, Weigend AS (1994) Selecting input variables using mutual information and nonparametric density estimation. In: Proceedings of the 1994 international symposium on artificial neural networks (ISANN\u201994), pp 42\u201350. https:\/\/citeseerx.ist.psu.edu\/document?repid=rep1 &type=pdf &doi=0cbb68b53c3a079545790e1e97e9f14bb4d613a9"},{"key":"11553_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100847","volume":"62","author":"F Han","year":"2021","unstructured":"Han F, Chen WT, Ling QH, Han H (2021) Multi-objective particle swarm optimization with adaptive strategies for feature selection. Swarm Evol Comput 62:100847. https:\/\/doi.org\/10.1016\/j.swevo.2021.100847","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"11553_CR27","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TCBB.2015.2476796","volume":"14","author":"Y Zhang","year":"2015","unstructured":"Zhang Y, Gong DW, Cheng J (2015) Multi-objective particle swarm optimization approach for cost-based feature selection in classification. IEEE\/ACM Trans Comput Biol Bioinf 14(1):64\u201375. https:\/\/doi.org\/10.1109\/TCBB.2015.2476796","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"11553_CR28","doi-asserted-by":"publisher","unstructured":"Zapotecas Mart\u00ednez S, Coello Coello CA (2011) A multi-objective particle swarm optimizer based on decomposition. In: Proceedings of the 13th annual conference on Genetic and evolutionary computation, pp 69\u201376 https:\/\/doi.org\/10.1145\/2001576.2001587","DOI":"10.1145\/2001576.2001587"},{"key":"11553_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-023-08090-3","author":"S Chauhan","year":"2023","unstructured":"Chauhan S, Singh M, Aggarwal AK (2023) Investigative analysis of different mutation on diversity-driven multi-parent evolutionary algorithm and its application in area coverage optimization of WSN. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-023-08090-3","journal-title":"Soft Comput"},{"issue":"5","key":"11553_CR30","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1007\/s00500-021-06495-6","volume":"26","author":"S Khalfi","year":"2022","unstructured":"Khalfi S, Iacca G, Draa A (2022) On the use of single non-uniform mutation in lightweight metaheuristics. Soft Comput 26(5):2259\u20132275. https:\/\/doi.org\/10.1007\/s00500-021-06495-6","journal-title":"Soft Comput"},{"issue":"1","key":"11553_CR31","doi-asserted-by":"publisher","first-page":"116","DOI":"10.11992\/tis.202106018","volume":"17","author":"J Zhao","year":"2022","unstructured":"Zhao J, Chen DD, Xiao R (2022) A heterogeneous variation firefly algorithm with maximin strategy. CAAI Trans Intell Syst 17(1):116\u2013130. https:\/\/doi.org\/10.11992\/tis.202106018","journal-title":"CAAI Trans Intell Syst"},{"issue":"3","key":"11553_CR32","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/TEVC.2004.826067","volume":"8","author":"CAC Coello","year":"2004","unstructured":"Coello CAC, Pulido GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization. IEEE Trans Evol Comput 8(3):256\u2013279. https:\/\/doi.org\/10.1109\/TEVC.2004.826067","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"11553_CR33","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2013","unstructured":"Deb K, Jain H (2013) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans Evol Comput 18(4):577\u2013601. https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"11553_CR34","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731. https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans Evol Comput"},{"key":"11553_CR35","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.eswa.2018.07.013","volume":"113","author":"M Amoozegar","year":"2018","unstructured":"Amoozegar M, Minaei-Bidgoli B (2018) Optimizing multi-objective PSO based feature selection method using a feature elitism mechanism. Expert Syst Appl 113:499\u2013514. https:\/\/doi.org\/10.1016\/j.eswa.2018.07.013","journal-title":"Expert Syst Appl"},{"key":"11553_CR36","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ins.2020.05.004","volume":"532","author":"Y Zhou","year":"2020","unstructured":"Zhou Y, Kang J, Guo H (2020) Many-objective optimization of feature selection based on two-level particle cooperation. Inf Sci 532:91\u2013109. https:\/\/doi.org\/10.1016\/j.ins.2020.05.004","journal-title":"Inf Sci"},{"issue":"1","key":"11553_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2020.3013290","volume":"25","author":"K Shang","year":"2020","unstructured":"Shang K, Ishibuchi H, He L, Pang LM (2020) A survey on the hypervolume indicator in evolutionary multiobjective optimization. IEEE Trans Evol Comput 25(1):1\u201320. https:\/\/doi.org\/10.1109\/TEVC.2020.3013290","journal-title":"IEEE Trans Evol Comput"},{"issue":"7","key":"11553_CR38","doi-asserted-by":"publisher","first-page":"3738","DOI":"10.1109\/TCYB.2019.2949204","volume":"51","author":"B Wu","year":"2019","unstructured":"Wu B, Hu W, Hu J, Yen GG (2019) Adaptive multiobjective particle swarm optimization based on evolutionary state estimation. IEEE Trans Cybern 51(7):3738\u20133751. https:\/\/doi.org\/10.1109\/TCYB.2019.2949204","journal-title":"IEEE Trans Cybern"},{"key":"11553_CR39","unstructured":"Dua D Karra Taniskidou E (2017) UCI Machine Learning Repository. Irvine: University of California, School of Information and Computer Science. https:\/\/archive.ics.uci.edu\/ml"},{"issue":"11","key":"11553_CR40","doi-asserted-by":"publisher","first-page":"3236","DOI":"10.1016\/j.patcog.2007.02.007","volume":"40","author":"Z Zhu","year":"2007","unstructured":"Zhu Z, Ong YS, Dash M (2007) Markov blanket-embedded genetic algorithm for gene selection. Pattern Recogn 40(11):3236\u20133248. https:\/\/doi.org\/10.1016\/j.patcog.2007.02.007","journal-title":"Pattern Recogn"},{"issue":"4","key":"11553_CR41","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.stem.2015.09.011","volume":"17","author":"AA Kolodziejczyk","year":"2015","unstructured":"Kolodziejczyk AA, Kim JK, Tsang JC, Ilicic T, Henriksson J, Natarajan KN, Teichmann SA (2015) Single cell RNA-sequencing of pluripotent states unlocks modular transcriptional variation. Cell Stem Cell 17(4):471\u2013485. https:\/\/doi.org\/10.1016\/j.stem.2015.09.011","journal-title":"Cell Stem Cell"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11553-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11063-024-11553-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11553-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T16:38:21Z","timestamp":1715877501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11063-024-11553-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,18]]},"references-count":41,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,4]]}},"alternative-id":["11553"],"URL":"https:\/\/doi.org\/10.1007\/s11063-024-11553-9","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3348206\/v1","asserted-by":"object"}]},"ISSN":["1573-773X"],"issn-type":[{"value":"1573-773X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,18]]},"assertion":[{"value":"10 February 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2024","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"}},{"value":"This article does not contain any studies with human participants or animals performed, and the datasets used are publicly available online.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}],"article-number":"110"}}