{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:33:39Z","timestamp":1786980819754,"version":"3.56.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T00:00:00Z","timestamp":1738627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T00:00:00Z","timestamp":1738627200000},"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":["62071303"],"award-info":[{"award-number":["62071303"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62201355"],"award-info":[{"award-number":["62201355"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Guangdong Basic and Applied Basic Research Foundation","doi-asserted-by":"crossref","award":["2024A1515010977"],"award-info":[{"award-number":["2024A1515010977"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Shenzhen Science and Technology Projection","award":["JCYJ20220531102407018"],"award-info":[{"award-number":["JCYJ20220531102407018"]}]},{"name":"Guangdong Provincial Key Laboratory","award":["2023B1212060076"],"award-info":[{"award-number":["2023B1212060076"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10489-025-06332-5","type":"journal-article","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T00:03:28Z","timestamp":1738627408000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["DAAR: Dual attention cooperative adaptive pruning rate by data-driven for filter pruning"],"prefix":"10.1007","volume":"55","author":[{"given":"Suyun","family":"Lian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jihong","family":"Pei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,4]]},"reference":[{"key":"6332_CR1","unstructured":"Han S, Mao H, Dally WJ (2015) Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149"},{"issue":"7","key":"6332_CR2","first-page":"3523","volume":"44","author":"S Minaee","year":"2021","unstructured":"Minaee S, Boykov Y, Porikli F, Plaza A, Kehtarnavaz N, Terzopoulos D (2021) Image segmentation using deep learning: A survey. IEEE Trans Pattern Anal Mach Intell 44(7):3523\u20133542","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"6332_CR3","doi-asserted-by":"crossref","unstructured":"Redmon J, Divvala S, Girshick R, Farhadi A (2016) You only look once: Unified, real-time object detection. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 779\u2013788","DOI":"10.1109\/CVPR.2016.91"},{"key":"6332_CR4","unstructured":"Simonyan K, Zisserman A (2014) Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556"},{"key":"6332_CR5","doi-asserted-by":"crossref","unstructured":"Luo J-H, 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"},{"issue":"12","key":"6332_CR6","doi-asserted-by":"publisher","first-page":"15923","DOI":"10.1007\/s10489-022-04278-6","volume":"53","author":"H-A Goh","year":"2023","unstructured":"Goh H-A, Ho C-K, Abas FS (2023) Front-end deep learning web apps development and deployment: a review. Appl Intell 53(12):15923\u201315945","journal-title":"Appl Intell"},{"key":"6332_CR7","unstructured":"Han S, Pool J, Tran J, Dally W (2015) Learning both weights and connections for efficient neural network. Advances in Neural Information Processing Systems 28"},{"key":"6332_CR8","unstructured":"Hubara I, Courbariaux M, Soudry D, El-Yaniv R, Bengio Y (2016) Binarized neural networks. Advances in Neural Information Processing Systems 29"},{"key":"6332_CR9","unstructured":"Hinton G, Vinyals O, Dean J (2015) Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531"},{"key":"6332_CR10","doi-asserted-by":"crossref","unstructured":"Zhu, J, Pei J (2022) Progressive kernel pruning cnn compression method with an adjustable input channel. Applied Intelligence 1\u201322","DOI":"10.1007\/s10489-021-02932-z"},{"key":"6332_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.neucom.2018.09.038","volume":"323","author":"Q Zhang","year":"2019","unstructured":"Zhang Q, Zhang M, Chen T, Sun Z, Ma Y, Yu B (2019) Recent advances in convolutional neural network acceleration. Neurocomputing 323:37\u201351","journal-title":"Neurocomputing"},{"key":"6332_CR12","unstructured":"He Y, Xiao L (2023) Structured pruning for deep convolutional neural networks: A survey. arXiv preprint arXiv:2303.00566"},{"key":"6332_CR13","doi-asserted-by":"crossref","unstructured":"He Y, Liu P, Wang Z, Hu Z, Yang Y (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":"6332_CR14","doi-asserted-by":"crossref","unstructured":"Wang X, Zheng Z, He Y, Yan F, Zeng Z, Yang, Y (2023) Progressive local filter pruning for image retrieval acceleration. IEEE Transactions on Multimedia","DOI":"10.1109\/TMM.2023.3256092"},{"key":"6332_CR15","doi-asserted-by":"crossref","unstructured":"Gkrispanis K, Gkalelis N, Mezaris V (2024) Filter-pruning of lightweight face detectors using a geometric median criterion. In: Proceedings of the IEEE\/CVF Winter Conference on Applications of Computer Vision (WACV) Workshops, pp. 280\u2013289","DOI":"10.1109\/WACVW60836.2024.00037"},{"key":"6332_CR16","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1007\/s10489-020-01894-y","volume":"51","author":"A Kumar","year":"2021","unstructured":"Kumar A, Shaikh AM, Li Y, Bilal H, Yin B (2021) Pruning filters with l1-norm and capped l1-norm for cnn compression. Appl Intell 51:1152\u20131160","journal-title":"Appl Intell"},{"key":"6332_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.121418","volume":"689","author":"G Li","year":"2024","unstructured":"Li G, Li R, Li T, Shen C, Zou X, Wang J, Wang C, Li N (2024) Sfp: Similarity-based filter pruning for deep neural networks. Inf Sci 689:121418","journal-title":"Inf Sci"},{"key":"6332_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.127124","volume":"569","author":"Y Zheng","year":"2024","unstructured":"Zheng Y, Sun P, Ren Q, Xu W, Zhu D (2024) A novel and efficient model pruning method for deep convolutional neural networks by evaluating the direct and indirect effects of filters. Neurocomputing 569:127124","journal-title":"Neurocomputing"},{"key":"6332_CR19","doi-asserted-by":"crossref","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: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 1529\u20131538","DOI":"10.1109\/CVPR42600.2020.00160"},{"issue":"3","key":"6332_CR20","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s41095-022-0271-y","volume":"8","author":"M-H Guo","year":"2022","unstructured":"Guo M-H, Xu T-X, Liu J-J, Liu Z-N, Jiang P-T, Mu T-J, Zhang S-H, Martin RR, Cheng M-M, Hu S-M (2022) Attention mechanisms in computer vision: A survey. Computational visual media. 8(3):331\u2013368","journal-title":"Computational visual media."},{"key":"6332_CR21","doi-asserted-by":"crossref","unstructured":"Szegedy C, Vanhoucke V, Ioffe S, Shlens J, Wojna Z (2016) Rethinking the inception architecture for computer vision. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2818\u20132826","DOI":"10.1109\/CVPR.2016.308"},{"key":"6332_CR22","unstructured":"Jaderberg M, Simonyan K, Zisserman A et\u00a0al (2015) Spatial transformer networks. Advances in neural information processing systems. 28"},{"key":"6332_CR23","doi-asserted-by":"crossref","unstructured":"Hu J, Shen L, Sun G (2018) Squeeze-and-excitation networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 7132\u20137141","DOI":"10.1109\/CVPR.2018.00745"},{"key":"6332_CR24","doi-asserted-by":"crossref","unstructured":"Wang X-J, Yao W, Fu H (2019) A convolutional neural network pruning method based on attention mechanism. In: SEKE, pp. 343\u2013452","DOI":"10.18293\/SEKE2019-147"},{"key":"6332_CR25","doi-asserted-by":"crossref","unstructured":"Lu W, Jiang Y, Jing P, Chu J, Fan F (2023) A novel channel pruning approach based on local attention and global ranking for cnn model compression. In: 2023 IEEE International Conference on Multimedia and Expo (ICME), pp. 1433\u20131438. IEEE","DOI":"10.1109\/ICME55011.2023.00248"},{"key":"6332_CR26","unstructured":"Zhao K, Jain A, Zhao M (2023) Automatic attention pruning: Improving and automating model pruning using attentions. In: International Conference on Artificial Intelligence and Statistics, pp. 10470\u201310486. PMLR"},{"key":"6332_CR27","unstructured":"Yamamoto K, Maeno K (2018) Pcas: Pruning channels with attention statistics for deep network compression. arXiv preprint arXiv:1806.05382"},{"key":"6332_CR28","doi-asserted-by":"crossref","unstructured":"Chen Y, Wu G, Shuai M, Lou S, Zhang Y, An Z (2024) Fpar: filter pruning via attention and rank enhancement for deep convolutional neural networks acceleration. International Journal of Machine Learning and Cybernetics, 1\u201313","DOI":"10.1007\/s13042-023-02076-1"},{"key":"6332_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107461","volume":"107","author":"J-H Luo","year":"2020","unstructured":"Luo J-H, Wu J (2020) Autopruner: An end-to-end trainable filter pruning method for efficient deep model inference. Pattern Recogn 107:107461","journal-title":"Pattern Recogn"},{"issue":"5","key":"6332_CR30","doi-asserted-by":"publisher","first-page":"5611","DOI":"10.1007\/s40747-023-01022-6","volume":"9","author":"H Cheng","year":"2023","unstructured":"Cheng H, Wang Z, Ma L, Wei Z, Alsaadi FE, Liu X (2023) Differentiable channel pruning guided via attention mechanism: a novel neural network pruning approach. Complex & Intelligent Systems. 9(5):5611\u20135624","journal-title":"Complex & Intelligent Systems."},{"issue":"1","key":"6332_CR31","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/s10489-023-05207-x","volume":"54","author":"Y Xue","year":"2024","unstructured":"Xue Y, Yao W, Peng S, Yao S (2024) Automatic filter pruning algorithm for image classification. Appl Intell 54(1):216\u2013230","journal-title":"Appl Intell"},{"key":"6332_CR32","doi-asserted-by":"crossref","unstructured":"He Y, Lin J, Liu Z, Wang H, Li L-J, Han S (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":"6332_CR33","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1109\/LSP.2021.3088323","volume":"28","author":"Y Liu","year":"2021","unstructured":"Liu Y, Guo Y, Guo J, Jiang L, Chen J (2021) Conditional automated channel pruning for deep neural networks. IEEE Signal Process Lett 28:1275\u20131279","journal-title":"IEEE Signal Process Lett"},{"key":"6332_CR34","doi-asserted-by":"crossref","unstructured":"Liu Z, Mu H, Zhang X, Guo Z, Yang X, Cheng K-T, Sun J (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"},{"issue":"15","key":"6332_CR35","doi-asserted-by":"publisher","first-page":"17751","DOI":"10.1007\/s10489-022-03508-1","volume":"52","author":"J Chang","year":"2022","unstructured":"Chang J, Lu Y, Xue P, Xu Y, Wei Z (2022) Automatic channel pruning via clustering and swarm intelligence optimization for cnn. Appl Intell 52(15):17751\u201317771","journal-title":"Appl Intell"},{"issue":"12","key":"6332_CR36","doi-asserted-by":"publisher","first-page":"3048","DOI":"10.1109\/TPAMI.2018.2874634","volume":"41","author":"S Chen","year":"2018","unstructured":"Chen S, Zhao Q (2018) Shallowing deep networks: Layer-wise pruning based on feature representations. IEEE Trans Pattern Anal Mach Intell 41(12):3048\u20133056","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"6332_CR37","doi-asserted-by":"crossref","unstructured":"Liu Z, Li J, Shen Z, Huang G, Yan S, Zhang C (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":"6332_CR38","unstructured":"Alvarez JM, Salzmann M (2017) Compression-aware training of deep networks. Advances in neural information processing systems. 30"},{"key":"6332_CR39","first-page":"2","volume":"2018","author":"C Jiang","year":"2018","unstructured":"Jiang C, Li G, Qian C, Tang K (2018) Efficient dnn neuron pruning by minimizing layer-wise nonlinear reconstruction error. IJCAI 2018:2\u20132","journal-title":"IJCAI"},{"key":"6332_CR40","unstructured":"Zhang D, Wang H, Figueiredo M, Balzano L (2018) Learning to share: Simultaneous parameter tying and sparsification in deep learning. In: International Conference on Learning Representations"},{"key":"6332_CR41","doi-asserted-by":"crossref","unstructured":"He Y, Kang G, Dong X, Fu Y, Yang Y (2018) Soft filter pruning for accelerating deep convolutional neural networks. arXiv preprint arXiv:1808.06866","DOI":"10.24963\/ijcai.2018\/309"},{"key":"6332_CR42","unstructured":"Zhuang Z, Tan M, Zhuang B, Liu J, Guo Y, Wu Q, Huang J, Zhu, J (2018) Discrimination-aware channel pruning for deep neural networks. Advances in neural information processing systems. 31"},{"key":"6332_CR43","doi-asserted-by":"crossref","unstructured":"Li Y, Lin S, Zhang B, Liu J, Doermann D, Wu Y, Huang F, Ji R (2019) Exploiting kernel sparsity and entropy for interpretable cnn compression. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 2800\u20132809","DOI":"10.1109\/CVPR.2019.00291"},{"key":"6332_CR44","doi-asserted-by":"crossref","unstructured":"Zhang H, Liu L, Zhou H, Hou W, Sun H, Zheng N (2021) Akecp: Adaptive knowledge extraction from feature maps for fast and efficient channel pruning. In: Proceedings of the 29th ACM International Conference on Multimedia, pp. 648\u2013657","DOI":"10.1145\/3474085.3475228"},{"key":"6332_CR45","doi-asserted-by":"crossref","unstructured":"Feng K-Y, Fei X, Gong M, Qin A, Li H, Wu Y (2022) An automatically layer-wise searching strategy for channel pruning based on task-driven sparsity optimization. IEEE Trans Circuits Syst Video Technol 32(9):5790\u20135802","DOI":"10.1109\/TCSVT.2022.3156588"},{"key":"6332_CR46","doi-asserted-by":"crossref","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","DOI":"10.1016\/j.neucom.2023.01.014"},{"issue":"2","key":"6332_CR47","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1109\/TNNLS.2019.2906563","volume":"31","author":"S Lin","year":"2019","unstructured":"Lin S, Ji R, Li Y, Deng C, Li X (2019) Toward compact convnets via structure-sparsity regularized filter pruning. IEEE transactions on neural networks and learning systems. 31(2):574\u2013588","journal-title":"IEEE transactions on neural networks and learning systems."},{"key":"6332_CR48","unstructured":"Ding X, Ding G, Guo Y, Han J, Yan C (2019) Approximated oracle filter pruning for destructive cnn width optimization. In: International Conference on Machine Learning, pp. 1607\u20131616. PMLR"},{"issue":"10","key":"6332_CR49","doi-asserted-by":"publisher","first-page":"4499","DOI":"10.1109\/TNNLS.2020.3018177","volume":"32","author":"X Ruan","year":"2020","unstructured":"Ruan X, Liu Y, Yuan C, Li B, Hu W, Li Y, Maybank S (2020) Edp: An efficient decomposition and pruning scheme for convolutional neural network compression. IEEE Transactions on Neural Networks and Learning Systems. 32(10):4499\u20134513","journal-title":"IEEE Transactions on Neural Networks and Learning Systems."},{"issue":"12","key":"6332_CR50","doi-asserted-by":"publisher","first-page":"7091","DOI":"10.1109\/TNNLS.2021.3084206","volume":"33","author":"M Lin","year":"2021","unstructured":"Lin M, Cao L, Li S, Ye Q, Tian Y, Liu J, Tian Q, Ji R (2021) Filter sketch for network pruning. IEEE Transactions on Neural Networks and Learning Systems. 33(12):7091\u20137100","journal-title":"IEEE Transactions on Neural Networks and Learning Systems."},{"key":"6332_CR51","doi-asserted-by":"crossref","unstructured":"Hou Z, Qin M, Sun F, Ma X, Yuan K, Xu Y, Chen Y-K, Jin R, Xie Y, Kung S-Y (2022) Chex: Channel exploration for cnn model compression. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 12287\u201312298","DOI":"10.1109\/CVPR52688.2022.01197"},{"key":"6332_CR52","doi-asserted-by":"crossref","unstructured":"Gao S, Huang F, Pei J, Huang H (2020) Discrete model compression with resource constraint for deep neural networks. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 1899\u20131908","DOI":"10.1109\/CVPR42600.2020.00197"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06332-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-025-06332-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06332-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T04:38:32Z","timestamp":1757133512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-025-06332-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,4]]},"references-count":52,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["6332"],"URL":"https:\/\/doi.org\/10.1007\/s10489-025-06332-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,4]]},"assertion":[{"value":"28 January 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 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":"No ethical approval or informed consent was necessary for this study, as the data were already publicly available and did not involve human or animal subjects.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and Informed Consent for Data Used:"}},{"value":"The paper is original in terms of its contents and is not under consideration for publication in any other journals\/proceedings. 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":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests:"}}],"article-number":"402"}}