{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T16:06:05Z","timestamp":1774454765957,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2022YFC2905700"],"award-info":[{"award-number":["2022YFC2905700"]}]},{"name":"National Key Research and Development Program of China","award":["2022YFB3205800"],"award-info":[{"award-number":["2022YFB3205800"]}]},{"name":"Fundamental Research Programs of Shanxi Province","award":["202203021212129"],"award-info":[{"award-number":["202203021212129"]}]},{"name":"Fundamental Research Programs of Shanxi Province","award":["202203021221106"],"award-info":[{"award-number":["202203021221106"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s00500-025-10470-w","type":"journal-article","created":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T02:41:16Z","timestamp":1738982476000},"page":"1207-1226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Channel pruning method driven by similarity of feature extraction capability"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1972-0943","authenticated-orcid":false,"given":"Chuanmeng","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaxin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiehua","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,8]]},"reference":[{"issue":"3","key":"10470_CR1","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1007\/s11053-022-10051-w","volume":"31","author":"A Abbaszadeh Shahri","year":"2022","unstructured":"Abbaszadeh Shahri A, Shan C, Larsson S (2022) A novel approach to uncertainty quantification in groundwater table modeling by automated predictive deep learning. Nat Resour Res 31(3):1351\u20131373","journal-title":"Nat Resour Res"},{"key":"10470_CR2","doi-asserted-by":"publisher","first-page":"171924","DOI":"10.1109\/ACCESS.2020.3024992","volume":"8","author":"SA Aketi","year":"2020","unstructured":"Aketi SA, Roy S, Raghunathan A et al (2020) Gradual channel pruning while training using feature relevance scores for convolutional neural networks. IEEE Access 8:171924\u2013171932","journal-title":"IEEE Access"},{"key":"10470_CR3","unstructured":"Bai Y, Wang H, Tao Z et\u00a0al (2022) Dual lottery ticket hypothesis. In: 10th international conference on learning representations, ICLR 2022"},{"issue":"23","key":"10470_CR4","doi-asserted-by":"publisher","first-page":"21119","DOI":"10.1007\/s00521-022-07594-7","volume":"34","author":"J Chang","year":"2022","unstructured":"Chang J, Lu Y, Xue P et al (2022) Global balanced iterative pruning for efficient convolutional neural networks. Neural Comput Appl 34(23):21119\u201321138","journal-title":"Neural Comput Appl"},{"issue":"2","key":"10470_CR5","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1109\/TNNLS.2020.2979517","volume":"32","author":"Z Chen","year":"2020","unstructured":"Chen Z, Xu TB, Du C et al (2020) Dynamical channel pruning by conditional accuracy change for deep neural networks. IEEE Trans Neural Netw Learn Syst 32(2):799\u2013813","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"10470_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107876","volume":"238","author":"Y Chen","year":"2022","unstructured":"Chen Y, Wen X, Zhang Y et al (2022) FPC: filter pruning via the contribution of output feature map for deep convolutional neural networks acceleration. Knowl-Based Syst 238:107876","journal-title":"Knowl-Based Syst"},{"key":"10470_CR7","unstructured":"Dong X, Yang Y (2019) Network pruning via transformable architecture search. Adv Neural Inf Process Syst 32"},{"issue":"1","key":"10470_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s12293-023-00402-2","volume":"16","author":"X Dong","year":"2024","unstructured":"Dong X, Yan P, Wang M et al (2024) An optimization method for pruning rates of each layer in CNN based on the GA-SMSM. Memetic Comput 16(1):45\u201354","journal-title":"Memetic Comput"},{"key":"10470_CR9","unstructured":"Frankle J, Carbin M (2019) The lottery ticket hypothesis: finding sparse, trainable neural networks. In: 7th international conference on learning representations, ICLR 2019"},{"key":"10470_CR10","unstructured":"Gal Y, Ghahramani Z (2016) Dropout as a Bayesian approximation: representing model uncertainty in deep learning. In: International conference on machine learning. PMLR, pp 1050\u20131059"},{"issue":"6","key":"10470_CR11","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1109\/TIP.2010.2044957","volume":"19","author":"Z Guo","year":"2010","unstructured":"Guo Z, Zhang L, Zhang D (2010) A completed modeling of local binary pattern operator for texture classification. IEEE Trans Image Process 19(6):1657\u20131663","journal-title":"IEEE Trans Image Process"},{"key":"10470_CR12","unstructured":"Guo Y, Yao A, Chen Y (2016) Dynamic network surgery for efficient dnns. Advances in neural information processing systems 29"},{"key":"10470_CR13","unstructured":"Guo C, Pleiss G, Sun Y et\u00a0al (2017) On calibration of modern neural networks. In: International conference on machine learning. PMLR, pp 1321\u20131330"},{"key":"10470_CR14","unstructured":"Han S, Pool J, Tran J et\u00a0al (2015) Learning both weights and connections for efficient neural network. Adv Neural Inf Process Syst 28"},{"key":"10470_CR15","doi-asserted-by":"crossref","unstructured":"He K, Zhang X, Ren S et\u00a0al (2016) Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 770\u2013778","DOI":"10.1109\/CVPR.2016.90"},{"key":"10470_CR16","doi-asserted-by":"crossref","unstructured":"He Y, Zhang X, Sun J (2017) Channel pruning for accelerating very deep neural networks. In: Proceedings of the IEEE international conference on computer vision, pp 1389\u20131397","DOI":"10.1109\/ICCV.2017.155"},{"key":"10470_CR17","doi-asserted-by":"crossref","unstructured":"He Y, Lin J, Liu Z et\u00a0al (2018) AMC: automl for model compression and acceleration on mobile devices. In: Proceedings of the European conference on computer vision (ECCV), pp 784\u2013800","DOI":"10.1007\/978-3-030-01234-2_48"},{"key":"10470_CR18","doi-asserted-by":"crossref","unstructured":"He Y, Liu P, Wang Z et\u00a0al (2019) Filter pruning via geometric median for deep convolutional neural networks acceleration. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 4340\u20134349","DOI":"10.1109\/CVPR.2019.00447"},{"key":"10470_CR19","doi-asserted-by":"publisher","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","journal-title":"Appl Soft Comput"},{"key":"10470_CR20","unstructured":"Kim M, Hospedales T (2023) BayesDLL: Bayesian deep learning library. In: arXiv preprint arXiv:2309.12928"},{"key":"10470_CR21","unstructured":"Krizhevsky A (2009) Learning multiple layers of features from tiny images. Technical report"},{"key":"10470_CR22","unstructured":"Lee N, Ajanthan T, Torr PH (2019) SNIP: single-shot network pruning based on connection sensitivity. In: 7th International conference on learning representations, ICLR 2019"},{"key":"10470_CR23","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","journal-title":"Neurocomputing"},{"key":"10470_CR24","doi-asserted-by":"crossref","unstructured":"Lin S, Ji R, Yan C et\u00a0al (2019) Towards optimal structured CNN pruning via generative adversarial learning. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 2790\u20132799","DOI":"10.1109\/CVPR.2019.00290"},{"key":"10470_CR25","doi-asserted-by":"crossref","unstructured":"Lin M, Ji R, Wang Y et\u00a0al (2020) HRank: filter pruning using high-rank feature map. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 1529\u20131538","DOI":"10.1109\/CVPR42600.2020.00160"},{"issue":"12","key":"10470_CR26","doi-asserted-by":"publisher","first-page":"7357","DOI":"10.1109\/TNNLS.2021.3084856","volume":"33","author":"M Lin","year":"2021","unstructured":"Lin M, Ji R, Li S et al (2021a) Network pruning using adaptive exemplar filters. IEEE Trans Neural Netw Learn Syst 33(12):7357\u20137366","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"10470_CR27","doi-asserted-by":"crossref","unstructured":"Lin M, Ji R, Zhang Y et\u00a0al (2021b) Channel pruning via automatic structure search. In: Proceedings of the twenty-ninth international conference on international joint conferences on artificial intelligence, pp 673\u2013679","DOI":"10.24963\/ijcai.2020\/94"},{"key":"10470_CR28","doi-asserted-by":"crossref","unstructured":"Liu Z, Li J, Shen Z et\u00a0al (2017) Learning efficient convolutional networks through network slimming. In: Proceedings of the IEEE international conference on computer vision, pp 2736\u20132744","DOI":"10.1109\/ICCV.2017.298"},{"key":"10470_CR29","doi-asserted-by":"crossref","unstructured":"Liu Z, Mu H, Zhang X et\u00a0al (2019) MetaPruning: meta learning for automatic neural network channel pruning. In: Proceedings of the IEEE\/CVF international conference on computer vision, pp 3296\u20133305","DOI":"10.1109\/ICCV.2019.00339"},{"key":"10470_CR30","doi-asserted-by":"crossref","unstructured":"Liu N, Ma X, Xu Z et\u00a0al (2020) AutoCompress: an automatic DNN structured pruning framework for ultra-high compression rates. In: Proceedings of the AAAI conference on artificial intelligence, pp 4876\u20134883","DOI":"10.1609\/aaai.v34i04.5924"},{"issue":"8","key":"10470_CR31","first-page":"4035","volume":"44","author":"J Liu","year":"2021","unstructured":"Liu J, Zhuang B, Zhuang Z et al (2021) Discrimination-aware network pruning for deep model compression. IEEE Trans Pattern Anal Mach Intell 44(8):4035\u20134051","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"12","key":"10470_CR32","doi-asserted-by":"publisher","first-page":"9912","DOI":"10.1109\/TNNLS.2022.3162067","volume":"34","author":"G Liu","year":"2023","unstructured":"Liu G, Zhang K, Lv M (2023a) SOKS: automatic searching of the optimal kernel shapes for stripe-wise network pruning. IEEE Trans Neural Netw Learn Syst 34(12):9912\u20139924","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"10470_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 et al (2023b) EACP: an effective automatic channel pruning for neural networks. Neurocomputing 526:131\u2013142","journal-title":"Neurocomputing"},{"key":"10470_CR34","doi-asserted-by":"crossref","unstructured":"Louati H, Louati A, Bechikh S et\u00a0al (2024) Joint filter and channel pruning of convolutional neural networks as a bi-level optimization problem. Memetic Comput 1\u201320","DOI":"10.1007\/s12293-024-00406-6"},{"key":"10470_CR35","doi-asserted-by":"crossref","unstructured":"Luo JH, Wu J, Lin W (2017) ThiNet: a filter level pruning method for deep neural network compression. In: Proceedings of the IEEE international conference on computer vision, pp 5058\u20135066","DOI":"10.1109\/ICCV.2017.541"},{"key":"10470_CR36","unstructured":"Molchanov P, Tyree S, Karras T et\u00a0al (2017) Pruning convolutional neural networks for resource efficient inference. In: 5th international conference on learning representations, ICLR 2017\u2014conference track proceedings"},{"key":"10470_CR37","doi-asserted-by":"crossref","unstructured":"Mousa-Pasandi M, Hajabdollahi M, Karimi N et\u00a0al (2020) Convolutional neural network pruning using filter attenuation. In: 2020 IEEE international conference on image processing (ICIP), pp 2905\u20132909","DOI":"10.1109\/ICIP40778.2020.9191098"},{"key":"10470_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109558","volume":"129","author":"CG Pach\u00f3n","year":"2022","unstructured":"Pach\u00f3n CG, Ballesteros DM, Renza D (2022) SeNPIS: sequential network pruning by class-wise importance score. Appl Soft Comput 129:109558","journal-title":"Appl Soft Comput"},{"key":"10470_CR39","unstructured":"Paszke A, Gross S, Chintala S et\u00a0al (2017) Automatic differentiation in pytorch. NIPS Autodiff Workshop"},{"issue":"1","key":"10470_CR40","first-page":"5485","volume":"21","author":"C Raffel","year":"2020","unstructured":"Raffel C, Shazeer N, Roberts A et al (2020) Exploring the limits of transfer learning with a unified text-to-text transformer. J Mach Learn Res 21(1):5485\u20135551","journal-title":"J Mach Learn Res"},{"key":"10470_CR41","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s11263-015-0816-y","volume":"115","author":"O Russakovsky","year":"2015","unstructured":"Russakovsky O, Deng J, Su H et al (2015) ImageNet large scale visual recognition challenge. Int J Comput Vis 115:211\u2013252","journal-title":"Int J Comput Vis"},{"key":"10470_CR42","first-page":"20378","volume":"33","author":"V Sanh","year":"2020","unstructured":"Sanh V, Wolf T, Rush A (2020) Movement pruning: adaptive sparsity by fine-tuning. Adv Neural Inf Process Syst 33:20378\u201320389","journal-title":"Adv Neural Inf Process Syst"},{"key":"10470_CR43","unstructured":"Simonyan K, Zisserman A (2015) Very deep convolutional networks for large-scale image recognition. In: International conference on learning representations"},{"key":"10470_CR44","first-page":"10936","volume":"33","author":"Y Tang","year":"2020","unstructured":"Tang Y, Wang Y, Xu Y et al (2020) SCOP: scientific control for reliable neural network pruning. Adv Neural Inf Process Syst 33:10936\u201310947","journal-title":"Adv Neural Inf Process Syst"},{"key":"10470_CR45","unstructured":"Wang H, Fu Y (2022) Trainability preserving neural pruning. In: International conference on learning representations"},{"issue":"4","key":"10470_CR46","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/TIP.2003.819861","volume":"13","author":"Z Wang","year":"2004","unstructured":"Wang Z, Bovik AC, Sheikh HR et al (2004) Image quality assessment: from error visibility to structural similarity. IEEE Trans Image Process 13(4):600\u2013612","journal-title":"IEEE Trans Image Process"},{"key":"10470_CR47","unstructured":"Wang H, Qin C, Zhang Y et\u00a0al (2021a) Neural pruning via growing regularization. In: ICLR 2021\u20149th international conference on learning representations"},{"key":"10470_CR48","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 et al (2021b) Filter pruning with a feature map entropy importance criterion for convolution neural networks compressing. Neurocomputing 461:41\u201354","journal-title":"Neurocomputing"},{"key":"10470_CR49","unstructured":"Wang W, Chen M, Zhao S et\u00a0al (2021c) Accelerate CNNs from three dimensions: a comprehensive pruning framework. In: Proceedings of machine learning research, pp 10717\u201310726"},{"key":"10470_CR50","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.neucom.2021.08.098","volume":"464","author":"W Wang","year":"2021","unstructured":"Wang W, Yu Z, Fu C et al (2021d) COP: customized correlation-based filter level pruning method for deep CNN compression. Neurocomputing 464:533\u2013545","journal-title":"Neurocomputing"},{"key":"10470_CR51","doi-asserted-by":"crossref","unstructured":"Wang Z, Li C, Wang X (2021e) Convolutional neural network pruning with structural redundancy reduction. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 14913\u201314922","DOI":"10.1109\/CVPR46437.2021.01467"},{"key":"10470_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107860","volume":"113","author":"Z Wang","year":"2021","unstructured":"Wang Z, Xie X, Shi G (2021f) RFPruning: a retraining-free pruning method for accelerating convolutional neural networks. Appl Soft Comput 113:107860","journal-title":"Appl Soft Comput"},{"key":"10470_CR53","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 et al (2024) Towards performance-maximizing neural network pruning via global channel attention. Neural Netw 171:104\u2013113","journal-title":"Neural Netw"},{"key":"10470_CR54","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","journal-title":"Neurocomputing"},{"key":"10470_CR55","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108056","volume":"119","author":"K Yao","year":"2021","unstructured":"Yao K, Cao F, Leung Y et al (2021) Deep neural network compression through interpretability-based filter pruning. Pattern Recogn 119:108056","journal-title":"Pattern Recogn"},{"key":"10470_CR56","doi-asserted-by":"crossref","unstructured":"Yu R, Li A, Chen CF et\u00a0al (2018) NISP: pruning networks using neuron importance score propagation. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 9194\u20139203","DOI":"10.1109\/CVPR.2018.00958"},{"key":"10470_CR57","doi-asserted-by":"crossref","unstructured":"Yuan T, Li Z, Liu B et\u00a0al (2024) ARPruning: an automatic channel pruning based on attention map ranking. Neural Netw 106220","DOI":"10.1016\/j.neunet.2024.106220"},{"key":"10470_CR58","doi-asserted-by":"crossref","unstructured":"Zhang Y, Lin M, Lin CW et\u00a0al (2022) Carrying out CNN channel pruning in a white box. IEEE Trans Neural Netw Learn Syst","DOI":"10.1109\/TNNLS.2022.3147269"},{"key":"10470_CR59","unstructured":"Zhuang Z, Tan M, Zhuang B et\u00a0al (2018) Discrimination-aware channel pruning for deep neural networks. Adv Neural Inf Process Syst 31"},{"key":"10470_CR60","first-page":"9865","volume":"33","author":"T Zhuang","year":"2020","unstructured":"Zhuang T, Zhang Z, Huang Y et al (2020) Neuron-level structured pruning using polarization regularizer. Adv Neural Inf Process Syst 33:9865\u20139877","journal-title":"Adv Neural Inf Process Syst"},{"key":"10470_CR61","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1007\/s11390-018-1859-7","volume":"33","author":"BJ Zou","year":"2018","unstructured":"Zou BJ, Guo YD, He Q et al (2018) 3D filtering by block matching and convolutional neural network for image denoising. J Comput Sci Technol 33:838\u2013848","journal-title":"J Comput Sci Technol"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10470-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10470-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10470-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T07:04:58Z","timestamp":1739862298000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10470-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":61,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10470"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10470-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"8 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2025","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 research on animals by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}