{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T16:10:16Z","timestamp":1730304616542,"version":"3.28.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T00:00:00Z","timestamp":1725926400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T00:00:00Z","timestamp":1725926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2022YFB3205800","2022YFC2905700"],"award-info":[{"award-number":["2022YFB3205800","2022YFC2905700"]}]},{"name":"Fundamental Research Programs of Shanxi Province","award":["202203021221106"],"award-info":[{"award-number":["202203021221106"]}]},{"name":"Shanxi Water Conservancy Science and Technology Research and Promotion Project","award":["2023GM31","2023GM31"],"award-info":[{"award-number":["2023GM31","2023GM31"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"DOI":"10.1007\/s11063-024-11684-z","type":"journal-article","created":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T04:02:02Z","timestamp":1725940922000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Clustering Pruning Method Based on Multidimensional Channel Information"],"prefix":"10.1007","volume":"56","author":[{"given":"Sun","family":"Chuanmeng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Jiaxin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wu","family":"Zhibo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Yong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ma","family":"Tiehua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,10]]},"reference":[{"key":"11684_CR1","doi-asserted-by":"publisher","unstructured":"Raffel C, Shazeer N, Roberts A, Lee K, Narang S, Matena M, Zhou Y, Li W, Liu PJ (2019) Exploring the limits of transfer learning with a unified text-to-text transformer. arXiv:1910.10683. https:\/\/doi.org\/10.48550\/arXiv.1910.10683","DOI":"10.48550\/arXiv.1910.10683"},{"key":"11684_CR2","doi-asserted-by":"publisher","unstructured":"Strubell E, Ganesh A, McCallum A (2019) Energy and policy considerations for deep learning in NLP. arXiv:1906.02243. https:\/\/doi.org\/10.48550\/arXiv.1906.02243","DOI":"10.48550\/arXiv.1906.02243"},{"issue":"12","key":"11684_CR3","doi-asserted-by":"publisher","first-page":"2889","DOI":"10.1109\/TPAMI.2018.2873305","volume":"41","author":"S Lin","year":"2019","unstructured":"Lin S, Ji R, Chen C, Tao D, Luo J (2019) Holistic CNN compression via low-rank decomposition with knowledge transfer. IEEE Trans Pattern Anal Mach Intell 41(12):2889\u20132905. https:\/\/doi.org\/10.1109\/TPAMI.2018.2873305","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"11684_CR4","first-page":"5552","volume":"32","author":"K Hayashi","year":"2019","unstructured":"Hayashi K, Yamaguchi T, Sugawara Y, Maeda S-I (2019) Exploring unexplored tensor network decompositions for convolutional neural networks. Adv Neural Inf Process Syst 32:5552\u20135562","journal-title":"Adv Neural Inf Process Syst"},{"issue":"1","key":"11684_CR5","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/s11263-019-01227-8","volume":"128","author":"Z Liu","year":"2020","unstructured":"Liu Z, Luo W, Wu B, Yang X, Liu W, Cheng K-T (2020) Bi-real net: binarizing deep network towards real-network performance. Int J Comput Vis 128(1):202\u2013219. https:\/\/doi.org\/10.1007\/s11263-019-01227-8","journal-title":"Int J Comput Vis"},{"key":"11684_CR6","doi-asserted-by":"publisher","unstructured":"Hinton G, Vinyals O, Dean J (2015) Distilling the knowledge in a neural network. arXiv:1503.02531. https:\/\/doi.org\/10.48550\/arXiv.1503.02531","DOI":"10.48550\/arXiv.1503.02531"},{"key":"11684_CR7","doi-asserted-by":"publisher","unstructured":"Cheng Y, Wang D, Zhou P, Zhang T (2017) A survey of model compression and acceleration for deep neural networks. arXiv:1710.09282. https:\/\/doi.org\/10.48550\/arXiv.1710.09282","DOI":"10.48550\/arXiv.1710.09282"},{"key":"11684_CR8","doi-asserted-by":"publisher","unstructured":"He Y, Kang G, Dong X, Fu Y, Yang Y (2018) Soft filter pruning for accelerating deep convolutional neural networks. arXiv:1808.06866. https:\/\/doi.org\/10.48550\/arXiv.1808.06866","DOI":"10.48550\/arXiv.1808.06866"},{"key":"11684_CR9","doi-asserted-by":"publisher","unstructured":"Mousa-Pasandi M, Hajabdollahi M, Karimi N, Samavi S, Shirani S (2020) Convolutional neural network pruning using filter attenuation. In: 2020 IEEE international conference on image processing (ICIP), pp 2905\u20132909. https:\/\/doi.org\/10.1109\/ICIP40778.2020.9191098","DOI":"10.1109\/ICIP40778.2020.9191098"},{"key":"11684_CR10","doi-asserted-by":"publisher","unstructured":"He Y, Liu P, Wang Z, Hu Z, Yang Y (2018) Filter pruning via geometric median for deep convolutional neural networks acceleration. arXiv:1811.00250. https:\/\/doi.org\/10.48550\/arXiv.1811.00250","DOI":"10.48550\/arXiv.1811.00250"},{"key":"11684_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.neucom.2022.07.051","volume":"507","author":"C Yang","year":"2022","unstructured":"Yang C, Liu H (2022) Channel pruning based on convolutional neural network sensitivity. Neurocomputing 507:97\u2013106. https:\/\/doi.org\/10.1016\/j.neucom.2022.07.051","journal-title":"Neurocomputing"},{"key":"11684_CR12","doi-asserted-by":"publisher","first-page":"17557","DOI":"10.1007\/s10489-022-03229-5","volume":"52","author":"SS Sawant","year":"2022","unstructured":"Sawant SS, Bauer J, Erick FX, Ingaleshwar S, Holzer N, Ramming A, Lang EW, G\u00f6tz T (2022) An optimal-score-based filter pruning for deep convolutional neural networks. Appl Intell 52:17557\u201317579","journal-title":"Appl Intell"},{"key":"11684_CR13","doi-asserted-by":"publisher","unstructured":"Lin M, Ji R, Wang Y, Zhang Y, Zhang B, Tian Y, Shao L (2020) Hrank: filter pruning using high-rank feature map. In: 2020 IEEE\/CVF conference on computer vision and pattern recognition (CVPR), pp 1526\u20131535. https:\/\/doi.org\/10.1109\/CVPR42600.2020.00160","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"11684_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.neucom.2021.07.034","volume":"461","author":"J Wang","year":"2021","unstructured":"Wang J, Jiang T, Cui Z, Cao Z (2021) Filter pruning with a feature map entropy importance criterion for convolution neural networks compressing. Neurocomputing 461:41\u201354. https:\/\/doi.org\/10.1016\/j.neucom.2021.07.034","journal-title":"Neurocomputing"},{"key":"11684_CR15","doi-asserted-by":"publisher","first-page":"107876","DOI":"10.1016\/j.knosys.2021.107876","volume":"238","author":"Y Chen","year":"2022","unstructured":"Chen Y, Wen X, Zhang Y, He Q (2022) FPC: filter pruning via the contribution of output feature map for deep convolutional neural networks acceleration. Knowl Based Syst 238:107876. https:\/\/doi.org\/10.1016\/j.knosys.2021.107876","journal-title":"Knowl Based Syst"},{"key":"11684_CR16","doi-asserted-by":"publisher","unstructured":"Suau X, Zappella L, Apostoloff N (2018) Filter distillation for network compression. arXiv:1807.10585. https:\/\/doi.org\/10.48550\/arXiv.1807.10585","DOI":"10.48550\/arXiv.1807.10585"},{"key":"11684_CR17","doi-asserted-by":"publisher","unstructured":"Wang D, Zhou L, Zhang X, Bai X, Zhou J (2018) Exploring linear relationship in feature map subspace for ConvNets compression. arXiv:1803.05729. https:\/\/doi.org\/10.48550\/arXiv.1803.05729","DOI":"10.48550\/arXiv.1803.05729"},{"key":"11684_CR18","doi-asserted-by":"publisher","first-page":"126297","DOI":"10.1016\/j.neucom.2023.126297","volume":"544","author":"Y Liu","year":"2023","unstructured":"Liu Y, Fan K, Wu D, Zhou W (2023) Filter pruning by quantifying feature similarity and entropy of feature maps. Neurocomputing 544:126297. https:\/\/doi.org\/10.1016\/j.neucom.2023.126297","journal-title":"Neurocomputing"},{"key":"11684_CR19","doi-asserted-by":"publisher","first-page":"106220","DOI":"10.1016\/j.neunet.2024.106220","volume":"174","author":"T Yuan","year":"2024","unstructured":"Yuan T, Li Z, Liu B, Tang Y, Liu Y (2024) ARPruning: an automatic channel pruning based on attention map ranking. Neural Netw 174:106220. https:\/\/doi.org\/10.1016\/j.neunet.2024.106220","journal-title":"Neural Netw"},{"key":"11684_CR20","doi-asserted-by":"publisher","unstructured":"Huang Z, Wang N (2017) Data-driven sparse structure selection for deep neural networks. arXiv:1707.01213. https:\/\/doi.org\/10.48550\/arXiv.1707.01213","DOI":"10.48550\/arXiv.1707.01213"},{"key":"11684_CR21","doi-asserted-by":"publisher","unstructured":"Liu Z, Li J, Shen Z, Huang G, Yan S, Zhang C (2017) Learning efficient convolutional networks through network slimming. arXiv:1708.06519. https:\/\/doi.org\/10.48550\/arXiv.1708.06519","DOI":"10.48550\/arXiv.1708.06519"},{"issue":"2","key":"11684_CR22","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1109\/TNNLS.2019.2906563","volume":"31","author":"S Lin","year":"2020","unstructured":"Lin S, Ji R, Li Y, Deng C, Li X (2020) Toward compact convnets via structure-sparsity regularized filter pruning. IEEE Trans Neural Netw Learn Syst 31(2):574\u2013588. https:\/\/doi.org\/10.1109\/TNNLS.2019.2906563","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"2","key":"11684_CR23","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1109\/TNNLS.2020.2979517","volume":"32","author":"Z Chen","year":"2021","unstructured":"Chen Z, Xu T-B, Du C, Liu C-L, He H (2021) Dynamical channel pruning by conditional accuracy change for deep neural networks. IEEE Trans Neural Netw Learn Syst 32(2):799\u2013813. https:\/\/doi.org\/10.1109\/TNNLS.2020.2979517","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"11684_CR24","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.neunet.2023.11.065","volume":"171","author":"Y Wang","year":"2024","unstructured":"Wang Y, Guo S, Guo J, Zhang J, Zhang W, Yan C, Zhang Y (2024) Towards performance-maximizing neural network pruning via global channel attention. Neural Netw 171:104\u2013113. https:\/\/doi.org\/10.1016\/j.neunet.2023.11.065","journal-title":"Neural Netw"},{"key":"11684_CR25","doi-asserted-by":"publisher","unstructured":"Liu Z, Sun M, Zhou T, Huang G, Darrell T (2018) Rethinking the value of network pruning. arXiv:1810.05270. https:\/\/doi.org\/10.48550\/arXiv.1810.05270","DOI":"10.48550\/arXiv.1810.05270"},{"key":"11684_CR26","doi-asserted-by":"publisher","unstructured":"Dong X, Yang Y (2019) Network pruning via transformable architecture. Search. arXiv:1905.09717. https:\/\/doi.org\/10.48550\/arXiv.1905.09717","DOI":"10.48550\/arXiv.1905.09717"},{"key":"11684_CR27","doi-asserted-by":"publisher","unstructured":"Liu Z, Mu H, Zhang X, Guo Z, Yang X, Kwang-Ting Cheng T, Sun J (2019) MetaPruning meta learning for automatic neural network channel pruning. arXiv:1903.10258. https:\/\/doi.org\/10.48550\/arXiv.1903.10258","DOI":"10.48550\/arXiv.1903.10258"},{"key":"11684_CR28","doi-asserted-by":"publisher","unstructured":"Wang W, Chen M, Zhao S, Chen L, Hu J, Liu H, Cai D, He X, Liu W (2020) Accelerate CNNs from three dimensions: a comprehensive pruning framework. arXiv:2010.04879. https:\/\/doi.org\/10.48550\/arXiv.2010.04879","DOI":"10.48550\/arXiv.2010.04879"},{"key":"11684_CR29","doi-asserted-by":"publisher","unstructured":"Lin M, Ji R, Zhang Y, Zhang B, Wu Y, Tian Y (2020) Channel pruning via automatic structure. Search. arXiv:2001.08565. https:\/\/doi.org\/10.48550\/arXiv.2001.08565","DOI":"10.48550\/arXiv.2001.08565"},{"key":"11684_CR30","doi-asserted-by":"publisher","unstructured":"Liu N, Ma X, Xu Z, Wang Y, Tang J, Ye J (2019) AutoCompress: an automatic DNN structured pruning framework for ultra-high compression rates. arXiv:1907-03141. https:\/\/doi.org\/10.48550\/arXiv.1907.03141","DOI":"10.48550\/arXiv.1907.03141"},{"key":"11684_CR31","doi-asserted-by":"publisher","unstructured":"Lin S, Ji R, Yan C, Zhang B, Cao L, Ye Q, Huang F, Doermann D (2019) Towards optimal structured CNN pruning via generative adversarial learning. arXiv:1903.09291. https:\/\/doi.org\/10.48550\/arXiv.1903.09291","DOI":"10.48550\/arXiv.1903.09291"},{"key":"11684_CR32","doi-asserted-by":"publisher","first-page":"110229","DOI":"10.1016\/j.asoc.2023.110229","volume":"139","author":"P Jiang","year":"2023","unstructured":"Jiang P, Xue Y, Neri F (2023) Convolutional neural network pruning based on multi-objective feature map selection for image classification. Appl Soft Comput 139:110229. https:\/\/doi.org\/10.1016\/j.asoc.2023.110229","journal-title":"Appl Soft Comput"},{"key":"11684_CR33","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.neucom.2023.01.014","volume":"526","author":"Y Liu","year":"2023","unstructured":"Liu Y, Wu D, Zhou W, Fan K, Zhou Z (2023) EACP: an effective automatic channel pruning for neural networks. Neurocomputing 526:131\u2013142. https:\/\/doi.org\/10.1016\/j.neucom.2023.01.014","journal-title":"Neurocomputing"},{"key":"11684_CR34","doi-asserted-by":"publisher","unstructured":"Lee N, Ajanthan T, Torr PHS (2018) SNIP: single-shot network pruning based on connection sensitivity. arXiv:1810.02340. https:\/\/doi.org\/10.48550\/arXiv.1810.02340","DOI":"10.48550\/arXiv.1810.02340"},{"key":"11684_CR35","doi-asserted-by":"publisher","unstructured":"Sanh V, Wolf T, Rush AM (2020) Movement pruning: adaptive sparsity by fine-tuning. arXiv:2005.07683. https:\/\/doi.org\/10.48550\/arXiv.2005.07683","DOI":"10.48550\/arXiv.2005.07683"},{"issue":"2","key":"11684_CR36","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"key":"11684_CR37","unstructured":"Krizhevsky A (2009) Learning multiple layers of features from tiny images. https:\/\/api.semanticscholar.org\/CorpusID:18268744"},{"key":"11684_CR38","doi-asserted-by":"publisher","unstructured":"Russakovsky O, Deng J, Su H, Krause J, Satheesh S, Ma S, Huang Z, Karpathy A, Khosla A, Bernstein M, Berg AC, Fei-Fei L (2014) ImageNet large scale visual recognition. Challenge. arXiv:1409.0575. https:\/\/doi.org\/10.48550\/arXiv.1409.0575","DOI":"10.48550\/arXiv.1409.0575"},{"key":"11684_CR39","doi-asserted-by":"publisher","unstructured":"He K, Zhang X, Ren S, Sun J (2016) Deep residual learning for image recognition. In: 2016 IEEE conference on computer vision and pattern recognition (CVPR), pp 770\u2013778. https:\/\/doi.org\/10.1109\/CVPR.2016.90","DOI":"10.1109\/CVPR.2016.90"},{"key":"11684_CR40","doi-asserted-by":"publisher","unstructured":"Szegedy C, Liu W, Jia Y, Sermanet P, Reed S, Anguelov D, Erhan D, Vanhoucke V, Rabinovich A (2015) Going deeper with convolutions. In: 2015 IEEE conference on computer vision and pattern recognition (CVPR), pp 1\u20139. https:\/\/doi.org\/10.1109\/CVPR.2015.7298594","DOI":"10.1109\/CVPR.2015.7298594"},{"key":"11684_CR41","doi-asserted-by":"publisher","unstructured":"Simonyan K, Zisserman A (2014) Very deep convolutional networks for large-scale image recognition. arXiv e-prints, arXiv:1409.1556 [cs.CV]. https:\/\/doi.org\/10.48550\/arXiv.1409.1556","DOI":"10.48550\/arXiv.1409.1556"},{"key":"11684_CR42","unstructured":"Paszke A, Gross S, Chintala S, Chanan G, Yang E, DeVito Z, Lin Z, Desmaison A, Antiga L, Lerer A (2017) Automatic differentiation in pytorch. https:\/\/api.semanticscholar.org\/CorpusID:40027675"},{"issue":"12","key":"11684_CR43","doi-asserted-by":"publisher","first-page":"7357","DOI":"10.1109\/TNNLS.2021.3084856","volume":"33","author":"M Lin","year":"2022","unstructured":"Lin M, Ji R, Li S, Wang Y, Wu Y, Huang F, Ye Q (2022) Network pruning using adaptive exemplar filters. IEEE Trans Neural Netw Learn Syst 33(12):7357\u20137366. https:\/\/doi.org\/10.1109\/TNNLS.2021.3084856","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"11684_CR44","doi-asserted-by":"publisher","unstructured":"Tang Y, Wang Y, Xu Y, Tao D, Xu C, Xu C, Xu C (2020) SCOP: scientific control for reliable neural network pruning. arXiv:2010.10732. https:\/\/doi.org\/10.48550\/arXiv.2010.10732","DOI":"10.48550\/arXiv.2010.10732"},{"key":"11684_CR45","unstructured":"Zhuang T, Zhang Z, Huang Y, Zeng X, Shuang K, Li, X (2020) Neuron-level structured pruning using polarization regularizer. In: Neural information processing systems. https:\/\/api.semanticscholar.org\/CorpusID:227276228"},{"key":"11684_CR46","doi-asserted-by":"publisher","unstructured":"Aparna Aketi S, Roy S, Raghunathan A, Roy K (2020) Gradual channel pruning while training using feature relevance scores for convolutional neural networks. arXiv:2002.09958. https:\/\/doi.org\/10.48550\/arXiv.2002.09958","DOI":"10.48550\/arXiv.2002.09958"},{"key":"11684_CR47","doi-asserted-by":"publisher","unstructured":"Zhao C, Ni B, Zhang J, Zhao Q, Zhang W, Tian Q (2019) Variational convolutional neural network pruning. In: 2019 IEEE\/CVF conference on computer vision and pattern recognition (CVPR), pp 2775\u20132784. https:\/\/doi.org\/10.1109\/CVPR.2019.00289","DOI":"10.1109\/CVPR.2019.00289"},{"key":"11684_CR48","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.neucom.2021.07.083","volume":"462","author":"Y Lian","year":"2021","unstructured":"Lian Y, Peng P, Xu W (2021) Filter pruning via separation of sparsity search and model training. Neurocomputing 462:185\u2013194. https:\/\/doi.org\/10.1016\/j.neucom.2021.07.083","journal-title":"Neurocomputing"},{"issue":"10","key":"11684_CR49","doi-asserted-by":"publisher","first-page":"7946","DOI":"10.1109\/TNNLS.2022.3147269","volume":"34","author":"Y Zhang","year":"2023","unstructured":"Zhang Y, Lin M, Lin C-W, Chen J, Wu Y, Tian Y, Ji R (2023) Carrying out CNN channel pruning in a white box. IEEE Trans Neural Netw Learn Syst 34(10):7946\u20137955. https:\/\/doi.org\/10.1109\/TNNLS.2022.3147269","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"11684_CR50","doi-asserted-by":"publisher","unstructured":"Wang Z, Li C, Wang X (2021) Convolutional neural network pruning with structural redundancy reduction. arXiv:2104.03438. https:\/\/doi.org\/10.48550\/arXiv.2104.03438","DOI":"10.48550\/arXiv.2104.03438"},{"issue":"8","key":"11684_CR51","doi-asserted-by":"publisher","first-page":"4035","DOI":"10.1109\/TPAMI.2021.3066410","volume":"44","author":"J Liu","year":"2022","unstructured":"Liu J, Zhuang B, Zhuang Z, Guo Y, Huang J, Zhu J, Tan M (2022) Discrimination-aware network pruning for deep model compression. IEEE Trans Pattern Anal Mach Intell 44(8):4035\u20134051. https:\/\/doi.org\/10.1109\/TPAMI.2021.3066410","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"11684_CR52","doi-asserted-by":"publisher","first-page":"104745","DOI":"10.1016\/j.imavis.2023.104745","volume":"136","author":"D Ghimire","year":"2023","unstructured":"Ghimire D, Lee K, Kim S-H (2023) Loss-aware automatic selection of structured pruning criteria for deep neural network acceleration. Image Vis Comput 136:104745. https:\/\/doi.org\/10.1016\/j.imavis.2023.104745","journal-title":"Image Vis Comput"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11684-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11063-024-11684-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11684-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T15:57:07Z","timestamp":1730303827000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11063-024-11684-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,10]]},"references-count":52,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2024,10]]}},"alternative-id":["11684"],"URL":"https:\/\/doi.org\/10.1007\/s11063-024-11684-z","relation":{},"ISSN":["1573-773X"],"issn-type":[{"type":"electronic","value":"1573-773X"}],"subject":[],"published":{"date-parts":[[2024,9,10]]},"assertion":[{"value":"16 August 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"232"}}