{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T20:03:53Z","timestamp":1776456233333,"version":"3.51.2"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:00:00Z","timestamp":1669680000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:00:00Z","timestamp":1669680000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["62006143"],"award-info":[{"award-number":["62006143"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2020MF152"],"award-info":[{"award-number":["ZR2020MF152"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Many industrial applications require time-consuming and resource-intensive evaluations of suitable solutions within very limited time frames. Therefore, many surrogate-assisted evaluation algorithms (SAEAs) have been widely used to optimize expensive problems. However, due to the curse of dimensionality and its implications, scaling SAEAs to high-dimensional expensive problems is still challenging. This paper proposes a variable surrogate model-based particle swarm optimization (called VSMPSO) to meet this challenge and extends it to solve 200-dimensional problems. Specifically, a single surrogate model constructed by simple random sampling is taken to explore different promising areas in different iterations. Moreover, a variable model management strategy is used to better utilize the current global model and accelerate the convergence rate of the optimizer. In addition, the strategy can be applied to any SAEA irrespective of the surrogate model used. To control the trade-off between optimization results and optimization time consumption of SAEAs, we consider fitness value and running time as a bi-objective problem. Applying the proposed approach to a benchmark test suite of dimensions ranging from 30 to 200 and comparisons with four state-of-the-art algorithms show that the proposed VSMPSO achieves high-quality solutions and computational efficiency for high-dimensional problems.<\/jats:p>","DOI":"10.1007\/s40747-022-00910-7","type":"journal-article","created":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T08:04:52Z","timestamp":1669709092000},"page":"3887-3935","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":61,"title":["Variable surrogate model-based particle swarm optimization for high-dimensional expensive problems"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0545-8091","authenticated-orcid":false,"given":"Jie","family":"Tian","sequence":"first","affiliation":[]},{"given":"Mingdong","family":"Hou","sequence":"additional","affiliation":[]},{"given":"Hongli","family":"Bian","sequence":"additional","affiliation":[]},{"given":"Junqing","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,29]]},"reference":[{"key":"910_CR1","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.neucom.2020.04.079","volume":"406","author":"Y Zhou","year":"2020","unstructured":"Zhou Y, Jin Y, Ding J (2020) Surrogate-assisted evolutionary search of spiking neural architectures in liquid state machines. Neurocomputing 406:12\u201323","journal-title":"Neurocomputing"},{"key":"910_CR2","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/TEVC.2013.2262111","volume":"18","author":"RG Regis","year":"2014","unstructured":"Regis RG (2014) Evolutionary programming for high-dimensional constrained expensive black-box optimization using radial basis functions. IEEE Trans Evol Comput 18:326\u2013347","journal-title":"IEEE Trans Evol Comput"},{"key":"910_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.2307\/3680541","volume":"17","author":"A Horner","year":"1993","unstructured":"Horner A, Beauchamp J, Haken L (1993) Machine tongues XVI: genetic algorithms and their application to FM matching synthesis. Comput Music J 17:17","journal-title":"Comput Music J"},{"key":"910_CR4","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1016\/S0967-0661(02)00081-3","volume":"10","author":"PJ Fleming","year":"2002","unstructured":"Fleming PJ, Purshouse RC (2002) Evolutionary algorithms in control systems engineering: a survey. Control Eng Pract 10:1223\u20131241","journal-title":"Control Eng Pract"},{"key":"910_CR5","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/MCI.2009.933094","volume":"4","author":"Y Jin","year":"2009","unstructured":"Jin Y, Sendhoff B (2009) A systems approach to evolutionary multiobjective structural optimization and beyond. IEEE Comput Intell Mag 4:62\u201376","journal-title":"IEEE Comput Intell Mag"},{"key":"910_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20859-1","volume-title":"Computational optimization, methods and algorithms","author":"S Koziel","year":"2011","unstructured":"Koziel S, Yang X-S (2011) Computational optimization, methods and algorithms. Springer, London"},{"key":"910_CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TEVC.2016.2622301","volume":"22","author":"T Chugh","year":"2018","unstructured":"Chugh T, Jin Y, Miettinen K, Hakanen J, Sindhya K (2018) A surrogate-assisted reference vector guided evolutionary algorithm for computationally expensive many-objective optimization. IEEE Trans Evol Comput 22:129\u2013142","journal-title":"IEEE Trans Evol Comput"},{"key":"910_CR8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.compchemeng.2017.05.025","volume":"106","author":"H Liu","year":"2017","unstructured":"Liu H, Cai J, Ong Y-S (2017) An adaptive sampling approach for kriging metamodeling by maximizing expected prediction error. Comput Chem Eng 106:171\u2013182","journal-title":"Comput Chem Eng"},{"key":"910_CR9","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1109\/TEVC.2013.2248012","volume":"18","author":"B Liu","year":"2014","unstructured":"Liu B, Zhang Q, Gielen GGE (2014) A Gaussian process surrogate model assisted evolutionary algorithm for medium scale expensive optimization problems. IEEE Trans Evol Comput 18:180\u2013192","journal-title":"IEEE Trans Evol Comput"},{"key":"910_CR10","first-page":"330","volume":"5","author":"JE Dennis","year":"1997","unstructured":"Dennis JE, Torczon V (1997) Managing approximation models in optimization. Multidiscip Desi Optim State Art 5:330\u2013347","journal-title":"Multidiscip Desi Optim State Art"},{"key":"910_CR11","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1109\/TEVC.2005.859465","volume":"10","author":"I Paenke","year":"2006","unstructured":"Paenke I, Branke J, Jin Y (2006) Efficient search for robust solutions by means of evolutionary algorithms and fitness approximation. IEEE Trans Evol Comput 10:405\u2013420","journal-title":"IEEE Trans Evol Comput"},{"key":"910_CR12","doi-asserted-by":"crossref","first-page":"1316","DOI":"10.2514\/1.12994","volume":"43","author":"Y Lian","year":"2005","unstructured":"Lian Y, Liou M-S (2005) Multiobjective optimization using coupled response surface model and evolutionary algorithm. AIAA J 43:1316\u20131325","journal-title":"AIAA J"},{"key":"910_CR13","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TNN.2004.836233","volume":"16","author":"S Ferrari","year":"2005","unstructured":"Ferrari S, Stengel RF (2005) Smooth function approximation using neural networks. IEEE Trans Neural Netw 16:24\u201338","journal-title":"IEEE Trans Neural Netw"},{"key":"910_CR14","first-page":"2013","volume":"1\u20139","author":"Y Amaritsakul","year":"2013","unstructured":"Amaritsakul Y, Chao C-K, Lin J (2013) Multiobjective optimization design of spinal pedicle screws using neural networks and genetic algorithm: mathematical models and mechanical validation. Comput Math Methods Med 1\u20139:2013","journal-title":"Comput Math Methods Med"},{"key":"910_CR15","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/TSMCC.2005.855506","volume":"37","author":"Z Zhou","year":"2007","unstructured":"Zhou Z, Ong YS, Nair PB, Keane AJ, Lum KY (2007) Combining global and local surrogate models to accelerate evolutionary optimization. IEEE Trans Syst Man Cybern Part C (Appl Rev) 37:66\u201376","journal-title":"IEEE Trans Syst Man Cybern Part C (Appl Rev)"},{"key":"910_CR16","doi-asserted-by":"crossref","first-page":"1478","DOI":"10.1109\/TNN.2003.820657","volume":"14","author":"J Gonzalez","year":"2003","unstructured":"Gonzalez J, Rojas I, Ortega J, Pomares H, Fernandez J, Diaz A (2003) Multiobjective evolutionary optimization of the size, shape, and position parameters of radial basis function networks for function approximation. IEEE Trans Neural Netw 14:1478\u20131495","journal-title":"IEEE Trans Neural Netw"},{"key":"910_CR17","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1007\/s00500-014-1283-z","volume":"19","author":"C Sun","year":"2014","unstructured":"Sun C, Jin Y, Zeng J, Yang Yu (2014) A two-layer surrogate-assisted particle swarm optimization algorithm. Soft Comput 19:1461\u20131475","journal-title":"Soft Comput"},{"key":"910_CR18","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1109\/TCYB.2018.2809430","volume":"49","author":"Y Wang","year":"2019","unstructured":"Wang Y, Yin D-Q, Yang S, Sun G (2019) Global and local surrogate-assisted differential evolution for expensive constrained optimization problems with inequality constraints. IEEE Trans Cybern 49:1642\u20131656","journal-title":"IEEE Trans Cybern"},{"key":"910_CR19","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/TEVC.2018.2869001","volume":"23","author":"Y Jin","year":"2019","unstructured":"Jin Y, Wang H, Chugh T, Guo D, Miettinen K (2019) Data-driven evolutionary optimization: an overview and case studies. IEEE Trans Evol Comput 23:442\u2013458","journal-title":"IEEE Trans Evol Comput"},{"key":"910_CR20","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1109\/TEVC.2019.2890818","volume":"23","author":"X Wang","year":"2019","unstructured":"Wang X, Wang GG, Song B, Wang P, Wang Y (2019) A novel evolutionary sampling assisted optimization method for high-dimensional expensive problems. IEEE Trans Evol Comput 23:815\u2013827","journal-title":"IEEE Trans Evol Comput"},{"key":"910_CR21","unstructured":"Rana S, Li C, Gupta S, Nguyen V, Venkatesh S (2017) High dimensional Bayesian optimization with elastic Gaussian process. In: Proceedings of the 34th international conference on machine learning, volume\u00a070 of proceedings of machine learning research. PMLR, 06\u201311 Aug, pp 2883\u20132891"},{"key":"910_CR22","doi-asserted-by":"crossref","first-page":"3925","DOI":"10.1109\/TCYB.2020.3008280","volume":"51","author":"J-Y Li","year":"2021","unstructured":"Li J-Y, Zhan Z-H, Wang H, Zhang J (2021) Data-driven evolutionary algorithm with perturbation-based ensemble surrogates. IEEE Trans Cybern 51:3925\u20133937","journal-title":"IEEE Trans Cybern"},{"key":"910_CR23","first-page":"1","volume":"1","author":"M Cui","year":"2021","unstructured":"Cui M, Li L, Zhou M, Abusorrah A (2021) Surrogate-assisted autoencoder-embedded evolutionary optimization algorithm to solve high-dimensional expensive problems. IEEE Trans Evol Comput 1:1","journal-title":"IEEE Trans Evol Comput"},{"issue":"2961\u20132975","key":"910_CR24","first-page":"07","volume":"7","author":"R Xiaodong","year":"2021","unstructured":"Xiaodong R, Daofu G, Zhigang R, Yongshen L, An C (2021) Enhancing hierarchical surrogate-assisted evolutionary algorithm for high-dimensional expensive optimization via random projection. Complex Intell Syst 7(2961\u20132975):07","journal-title":"Complex Intell Syst"},{"key":"910_CR25","doi-asserted-by":"crossref","first-page":"2038","DOI":"10.1080\/0305215X.2017.1419344","volume":"50","author":"AB Mohamed","year":"2018","unstructured":"Mohamed AB, Nathalie B, Regis Rommel G, Abdelkader O, Joseph M (2018) Efficient global optimization for high-dimensional constrained problems by using the kriging models combined with the partial least squares method. Eng Optim 50:2038\u20132053","journal-title":"Eng Optim"},{"key":"910_CR26","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/TEVC.2018.2869247","volume":"23","author":"J Tian","year":"2019","unstructured":"Tian J, Tan Y, Zeng J, Sun C, Jin Y (2019) Multiobjective infill criterion driven Gaussian process-assisted particle swarm optimization of high-dimensional expensive problems. IEEE Trans Evol Comput 23:459\u2013472","journal-title":"IEEE Trans Evol Comput"},{"key":"910_CR27","doi-asserted-by":"crossref","first-page":"2302","DOI":"10.1109\/TAP.2021.3051034","volume":"69","author":"B Liu","year":"2021","unstructured":"Liu B, Akinsolu MO, Song C, Hua Q, Excell P, Xu Q, Huang Y, Imran MA (2021) An efficient method for complex antenna design based on a self adaptive surrogate model-assisted optimization technique. IEEE Trans Antennas Propag 69:2302\u20132315","journal-title":"IEEE Trans Antennas Propag"},{"key":"910_CR28","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/j.asoc.2009.09.001","volume":"10","author":"M Davarynejad","year":"2010","unstructured":"Davarynejad M, Ahn CW, Vrancken J, van den Berg J, Coello Coello CA (2010) Evolutionary hidden information detection by granulation-based fitness approximation. Appl Soft Comput 10:719\u2013729","journal-title":"Appl Soft Comput"},{"key":"910_CR29","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s11277-018-5474-2","volume":"103","author":"J Tian","year":"2018","unstructured":"Tian J, Zeng J, Tan Y, Sun C (2018) Adaptive information granulation in fitness estimation for evolutionary optimization. Wirel Pers Commun 103:741\u2013759","journal-title":"Wirel Pers Commun"},{"key":"910_CR30","doi-asserted-by":"crossref","first-page":"687","DOI":"10.2514\/2.1999","volume":"41","author":"YS Ong","year":"2003","unstructured":"Ong YS, Nair PB, Keane AJ (2003) Evolutionary optimization of computationally expensive problems via surrogate modeling. AIAA J 41:687\u2013696","journal-title":"AIAA J"},{"key":"910_CR31","doi-asserted-by":"crossref","first-page":"2664","DOI":"10.1109\/TCYB.2017.2710978","volume":"47","author":"H Wang","year":"2017","unstructured":"Wang H, Jin Y, Doherty J (2017) Committee-based active learning for surrogate-assisted particle swarm optimization of expensive problems. IEEE Trans Cybern 47:2664\u20132677","journal-title":"IEEE Trans Cybern"},{"key":"910_CR32","doi-asserted-by":"crossref","first-page":"106303","DOI":"10.1016\/j.asoc.2020.106303","volume":"92","author":"F Li","year":"2020","unstructured":"Li F, Shen W, Cai X, Gao L, Gary WG (2020) A fast surrogate-assisted particle swarm optimization algorithm for computationally expensive problems. Appl Soft Comput 92:106303","journal-title":"Appl Soft Comput"},{"key":"910_CR33","first-page":"409","volume":"24","author":"C Yang","year":"2020","unstructured":"Yang C, Ding J, Jin Y, Chai T (2020) Off-line data-driven multi-objective optimization: knowledge transfer between surrogates and generation of final solutions. IEEE Trans Evol Comput 24:409\u2013423","journal-title":"IEEE Trans Evol Comput"},{"key":"910_CR34","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TEVC.2017.2675628","volume":"21","author":"C Sun","year":"2017","unstructured":"Sun C, Jin Y, Cheng R, Ding J, Zeng J (2017) Surrogate-assisted cooperative swarm optimization of high-dimensional expensive problems. IEEE Trans Evol Comput 21:644\u2013660","journal-title":"IEEE Trans Evol Comput"},{"key":"910_CR35","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/j.ins.2020.11.056","volume":"561","author":"J-S Pan","year":"2021","unstructured":"Pan J-S, Liu N, Chu S-C, Lai T (2021) An efficient surrogate-assisted hybrid optimization algorithm for expensive optimization problems. Inf Sci 561:304\u2013325","journal-title":"Inf Sci"},{"key":"910_CR36","unstructured":"Ong Y-S, Zhou Z, Lim D (2006) Curse and blessing of uncertainty in evolutionary algorithm using approximation. In: 2006 IEEE international conference on evolutionary computation, pp 2928\u20132935"},{"key":"910_CR37","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, vol 4, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"910_CR38","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/TEVC.2005.857610","volume":"10","author":"JJ Liang","year":"2006","unstructured":"Liang JJ, Qin AK, Suganthan PN, Baskar S (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evol Comput 10:281\u2013295","journal-title":"IEEE Trans Evol Comput"},{"key":"910_CR39","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1109\/TEVC.2012.2203138","volume":"17","author":"BY Qu","year":"2013","unstructured":"Qu BY, Nagaratnam SP, Swagatam D (2013) A distance-based locally informed particle swarm model for multimodal optimization. IEEE Trans Evol Comput 17:387\u2013402","journal-title":"IEEE Trans Evol Comput"},{"key":"910_CR40","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.ins.2014.08.039","volume":"291","author":"C Ran","year":"2015","unstructured":"Ran C, Yaochu J (2015) A social learning particle swarm optimization algorithm for scalable optimization. Inf Sci 291:43\u201360","journal-title":"Inf Sci"},{"key":"910_CR41","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1109\/TCYB.2014.2322602","volume":"45","author":"YJR Cheng","year":"2015","unstructured":"Cheng YJR (2015) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybern 45:191\u2013204","journal-title":"IEEE Trans Cybern"},{"key":"910_CR42","unstructured":"Powell MJD (1990) The theory of radial basis function approximation in 1990. University of Cambridge, Department of Applied Mathematics and Theoretical Physics"},{"key":"910_CR43","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1006\/jath.2001.3579","volume":"111","author":"H-M Gutmann","year":"2001","unstructured":"Gutmann H-M (2001) On the semi-norm of radial basis function interpolants. J Approx Theory 111:315\u2013328","journal-title":"J Approx Theory"},{"key":"910_CR44","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1023\/A:1011255519438","volume":"19","author":"H-M Gutmann","year":"2001","unstructured":"Gutmann H-M (2001) A radial basis function method for global optimization. J Global Optim 19:201\u2013227","journal-title":"J Global Optim"},{"key":"910_CR45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00158-001-0160-4","volume":"23","author":"R Jin","year":"2001","unstructured":"Jin R, Chen W, Simpson TW (2001) Comparative studies of metamodelling techniques under multiple modelling criteria. Struct Multidiscip Optim 23:1\u201313","journal-title":"Struct Multidiscip Optim"},{"key":"910_CR46","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/00401706.1974.10489157","volume":"16","author":"DM Allen","year":"1974","unstructured":"Allen DM (1974) The relationship between variable selection and data argumentation and a method for prediction. Technometrics 16:125\u2013127","journal-title":"Technometrics"},{"key":"910_CR47","unstructured":"Suganthan P, Hansen N, Liang J, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization"},{"key":"910_CR48","unstructured":"Wu G, Mallipeddi R, Suganthan P (Nov 2016) Problem definitions and evaluation criteria for the CEC 2017 competition and special session on constrained single objective real-parameter optimization. Technical report, Nanyang Technological University, Singapore"},{"key":"910_CR49","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"D Joaqu\u00edn","year":"2011","unstructured":"Joaqu\u00edn D, Salvador G, Daniel M, Francisco H (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1:3\u201318","journal-title":"Swarm Evol Comput"},{"key":"910_CR50","unstructured":"Mueller J (2014) Matsumoto: the matlab surrogate model toolbox for computationally expensive black-box global optimization problems. Preprint arXiv:1404.4261"},{"key":"910_CR51","doi-asserted-by":"crossref","unstructured":"Tian J, Sun C, Zeng J, Yu H, Tan Y, Jin Y (2017) Comparisons of different kernels in kriging-assisted evolutionary expensive optimization. In: 2017 IEEE symposium series on computational intelligence (SSCI), pp 1\u20138","DOI":"10.1109\/SSCI.2017.8285281"},{"key":"910_CR52","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.ejor.2014.04.011","volume":"243","author":"M Mlakar","year":"2015","unstructured":"Mlakar M, Petelin D, Tu\u0161ar T, Filipi\u010d B (2015) Gp-demo: differential evolution for multiobjective optimization based on Gaussian process models. Eur J Oper Res 243:347\u2013361","journal-title":"Eur J Oper Res"},{"key":"910_CR53","unstructured":"Ulmer H, Streichert F, Zell A (2003) Evolution strategies assisted by Gaussian processes with improved preselection criterion. In: The 2003 congress on evolutionary computation, 2003. CEC\u201903, vol 1, pp 692\u2013699"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00910-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00910-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00910-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T13:16:40Z","timestamp":1690463800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00910-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,29]]},"references-count":53,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["910"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00910-7","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,29]]},"assertion":[{"value":"24 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We should emphasize that there is no known conflict of interest in this publication, and there is no significant financial support that can affect its results. We confirm that the manuscript is our own village and has been recognized by all the designated authors. No one else meets the standards of the author, but it is not listed. We confirm that we have provided a valid e-mail address that the author can visit, which was set up to receive e-mail from tianjie1023@outlook.com.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}