{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:09:36Z","timestamp":1773511776404,"version":"3.50.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10489-023-05164-5","type":"journal-article","created":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T02:01:47Z","timestamp":1701914507000},"page":"201-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Weight-adaptive channel pruning for CNNs based on closeness-centrality modeling"],"prefix":"10.1007","volume":"54","author":[{"given":"Zhao","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanzhi","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shukai","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3764-2640","authenticated-orcid":false,"given":"Xiaofang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,7]]},"reference":[{"key":"5164_CR1","unstructured":"Abadi M, Barham P, Chen J, et\u00a0al (2016) Tensorflow: A system for large-scale machine learning. arXiv:1605.08695"},{"key":"5164_CR2","unstructured":"Aghasi A, Abdi A, Nguyen NH, et\u00a0al (2016) Net-trim: Convex pruning of deep neural networks with performance guarantee. In: NIPS"},{"key":"5164_CR3","doi-asserted-by":"publisher","first-page":"17751","DOI":"10.1007\/s10489-022-03508-1","volume":"52","author":"J Chang","year":"2021","unstructured":"Chang J, Lu Y, Xue P et al (2021) Automatic channel pruning via clustering and swarm intelligence optimization for cnn. Appl Intell 52:17751\u201317771","journal-title":"Appl Intell"},{"key":"5164_CR4","doi-asserted-by":"crossref","unstructured":"Chen LC, Zhu Y, Papandreou G, et\u00a0al (2018) Encoder-decoder with atrous separable convolution for semantic image segmentation. In: European conference on computer vision","DOI":"10.1007\/978-3-030-01234-2_49"},{"key":"5164_CR5","doi-asserted-by":"crossref","unstructured":"Chen Z, Xiang J, Lu Y, et\u00a0al (2023) Rgp: Neural network pruning through regular graph with edges swapping. IEEE transactions on neural networks and learning systems PP","DOI":"10.1109\/TNNLS.2023.3280899"},{"key":"5164_CR6","unstructured":"Denil M, Shakibi B, Dinh L, et\u00a0al (2013) Predicting parameters in deep learning. In: NIPS"},{"key":"5164_CR7","unstructured":"Dong X, Chen S, Pan SJ (2017) Learning to prune deep neural networks via layer-wise optimal brain surgeon. In: NIPS"},{"key":"5164_CR8","unstructured":"Duan Y, Hu X, Zhou Y, et\u00a0al (2022) Network pruning via feature shift minimization. arXiv:2207.02632"},{"key":"5164_CR9","doi-asserted-by":"crossref","unstructured":"Gao S, Huang F, Cai WT, et\u00a0al (2021) Network pruning via performance maximization. 2021 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp 9266\u20139276","DOI":"10.1109\/CVPR46437.2021.00915"},{"key":"5164_CR10","doi-asserted-by":"crossref","unstructured":"Girdhar R, Tran D, Torresani L, et\u00a0al (2019) Distinit: Learning video representations without a single labeled video. 2019 IEEE\/CVF International Conference on Computer Vision (ICCV), pp 852\u2013861","DOI":"10.1109\/ICCV.2019.00094"},{"key":"5164_CR11","doi-asserted-by":"crossref","unstructured":"Guo J, Han K, Wang Y, et\u00a0al (2020) Hit-detector: Hierarchical trinity architecture search for object detection. 2020 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp 11402\u201311411","DOI":"10.1109\/CVPR42600.2020.01142"},{"key":"5164_CR12","doi-asserted-by":"crossref","unstructured":"Guo S, Zhang L, Zheng X, et\u00a0al (2023) Automatic network pruning via hilbert-schmidt independence criterion lasso under information bottleneck principle. In: Proceedings of the IEEE\/CVF international conference on computer vision, pp 17458\u201317469","DOI":"10.1109\/ICCV51070.2023.01601"},{"key":"5164_CR13","doi-asserted-by":"crossref","unstructured":"He K, Zhang X, Ren S, Sun J (2015) Deep residual learning for image recognition. In: 2016 IEEE conference on Computer Vision and Pattern Recognition (CVPR), p 770\u2013778","DOI":"10.1109\/CVPR.2016.90"},{"key":"5164_CR14","doi-asserted-by":"crossref","unstructured":"He Y, Zhang X, Sun J (2017) Channel pruning for accelerating very deep neural networks. 2017 IEEE International Conference on Computer Vision (ICCV), pp 1398\u20131406","DOI":"10.1109\/ICCV.2017.155"},{"key":"5164_CR15","doi-asserted-by":"crossref","unstructured":"He Y, Kang G, Dong X, et\u00a0al (2018) Soft filter pruning for accelerating deep convolutional neural networks. In: International joint conference on artificial intelligence","DOI":"10.24963\/ijcai.2018\/309"},{"key":"5164_CR16","doi-asserted-by":"crossref","unstructured":"He Y, Liu P, Wang Z, et\u00a0al (2018) Filter pruning via geometric median for deep convolutional neural networks acceleration. 2019 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp 4335\u20134344","DOI":"10.1109\/CVPR.2019.00447"},{"key":"5164_CR17","doi-asserted-by":"crossref","unstructured":"He Y, Ding Y, Liu P, et\u00a0al (2020) Learning filter pruning criteria for deep convolutional neural networks acceleration. 2020 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp 2006\u20132015","DOI":"10.1109\/CVPR42600.2020.00208"},{"key":"5164_CR18","unstructured":"Hinton GE, Vinyals O, Dean J (2015) Distilling the knowledge in a neural network. arXiv:1503.02531"},{"key":"5164_CR19","unstructured":"Howard AG, Zhu M, Chen B, et\u00a0al (2017) Mobilenets: Efficient convolutional neural networks for mobile vision applications. arXiv:1704.04861"},{"key":"5164_CR20","doi-asserted-by":"crossref","unstructured":"Hu X, Fang H, Zhang L, et\u00a0al (2023) Dynamic connection pruning for densely connected convolutional neural networks. Applied Intelligence","DOI":"10.1007\/s10489-023-04513-8"},{"key":"5164_CR21","doi-asserted-by":"crossref","unstructured":"Huang Z, Wang N (2017) Data-driven sparse structure selection for deep neural networks. arXiv:1707.01213","DOI":"10.1007\/978-3-030-01270-0_19"},{"key":"5164_CR22","unstructured":"Ji Y, Liang L, Deng L, et\u00a0al (2018) Tetris: Tile-matching the tremendous irregular sparsity. In: Neural Information Processing Systems"},{"key":"5164_CR23","doi-asserted-by":"crossref","unstructured":"Joo D, Yi E, Baek S, et\u00a0al (2021) Linearly replaceable filters for deep network channel pruning. In: AAAI Conference on artificial intelligence","DOI":"10.1609\/aaai.v35i9.16978"},{"key":"5164_CR24","unstructured":"Kang M, Han B (2020) Operation-aware soft channel pruning using differentiable masks. In: International conference on machine learning"},{"key":"5164_CR25","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/3065386","volume":"60","author":"A Krizhevsky","year":"2012","unstructured":"Krizhevsky A, Sutskever I, Hinton GE (2012) Imagenet classification with deep convolutional neural networks. Commun ACM 60:84\u201390","journal-title":"Commun ACM"},{"key":"5164_CR26","unstructured":"LeCun Y, Denker JS, Solla SA (1989) Optimal brain damage. In: NIPS"},{"key":"5164_CR27","unstructured":"Lee J, Park S, Mo S, et\u00a0al (2020) Layer-adaptive sparsity for the magnitude-based pruning. In: International conference on learning representations"},{"key":"5164_CR28","doi-asserted-by":"crossref","unstructured":"Li B, Wu B, Su J, et\u00a0al (2020) Eagleeye: Fast sub-net evaluation for efficient neural network pruning. In: Computer Vision\u2013ECCV 2020: 16th European Conference, Glasgow, UK, August 23\u201328, 2020, Proceedings, Part II 16, Springer, pp 639\u2013654","DOI":"10.1007\/978-3-030-58536-5_38"},{"key":"5164_CR29","unstructured":"Li H, Kadav A, Durdanovic I, et\u00a0al (2016) Pruning filters for efficient convnets. arXiv:1608.08710"},{"key":"5164_CR30","doi-asserted-by":"crossref","unstructured":"Li Y, Lin S, Liu J, et\u00a0al (2021) Towards compact cnns via collaborative compression. 2021 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp 6434\u20136443","DOI":"10.1109\/CVPR46437.2021.00637"},{"key":"5164_CR31","doi-asserted-by":"crossref","unstructured":"Lin M, Ji R, Wang Y, et\u00a0al (2020) Hrank: Filter pruning using high-rank feature map. 2020 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp 1526\u20131535","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"5164_CR32","doi-asserted-by":"crossref","unstructured":"Lin M, Ji R, xin Zhang Y, et\u00a0al (2020) Channel pruning via automatic structure search. arXiv:2001.08565","DOI":"10.24963\/ijcai.2020\/94"},{"key":"5164_CR33","doi-asserted-by":"crossref","unstructured":"Lin M, xin Zhang Y, Li Y, et al (2021) 1xn pattern for pruning convolutional neural networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 45:3999\u20134008","DOI":"10.1109\/TPAMI.2022.3195774"},{"key":"5164_CR34","doi-asserted-by":"crossref","unstructured":"Lin M, Cao L, xin Zhang Y, et\u00a0al (2022) Pruning networks with cross-layer ranking & k-reciprocal nearest filters. IEEE transactions on neural networks and learning systems PP","DOI":"10.1109\/TNNLS.2022.3156047"},{"key":"5164_CR35","doi-asserted-by":"crossref","unstructured":"Lin S, Ji R, Yan C, et al (2019) Towards optimal structured cnn pruning via generative adversarial learning. 2019 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp 2785\u20132794","DOI":"10.1109\/CVPR.2019.00290"},{"key":"5164_CR36","doi-asserted-by":"crossref","unstructured":"Liu Z, Li J, Shen Z, et\u00a0al (2017) Learning efficient convolutional networks through network slimming. 2017 IEEE International Conference on Computer Vision (ICCV) pp 2755\u20132763","DOI":"10.1109\/ICCV.2017.298"},{"key":"5164_CR37","doi-asserted-by":"crossref","unstructured":"Liu Z, Mu H, Zhang X, et\u00a0al (2019) Metapruning: Meta learning for automatic neural network channel pruning. 2019 IEEE\/CVF International Conference on Computer Vision (ICCV), pp 3295\u20133304","DOI":"10.1109\/ICCV.2019.00339"},{"key":"5164_CR38","doi-asserted-by":"crossref","unstructured":"Liu Z, Shen Z, Savvides M, et\u00a0al (2020) Reactnet: Towards precise binary neural network with generalized activation functions. arXiv:2003.03488","DOI":"10.1007\/978-3-030-58568-6_9"},{"key":"5164_CR39","doi-asserted-by":"crossref","unstructured":"Luo JH, Wu J, Lin W (2017) Thinet: A filter level pruning method for deep neural network compression. 2017 IEEE International Conference on Computer Vision (ICCV) pp 5068\u20135076","DOI":"10.1109\/ICCV.2017.541"},{"key":"5164_CR40","unstructured":"Molchanov P, Tyree S, Karras T, et\u00a0al (2016) Pruning convolutional neural networks for resource efficient inference. arXiv: Learning"},{"key":"5164_CR41","doi-asserted-by":"crossref","unstructured":"Molchanov P, Mallya A, Tyree S, et\u00a0al (2019) Importance estimation for neural network pruning. 2019 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp 11256\u201311264","DOI":"10.1109\/CVPR.2019.01152"},{"key":"5164_CR42","unstructured":"Mussay B, Osadchy M, Braverman V, et\u00a0al (2019) Data-independent neural pruning via coresets. arXiv: Learning"},{"key":"5164_CR43","doi-asserted-by":"crossref","unstructured":"Oh J, Kim H, Baik S, et\u00a0al (2021) Batch normalization tells you which filter is important. 2022 IEEE\/CVF Winter Conference on Applications of Computer Vision (WACV), pp 3351\u20133360","DOI":"10.1109\/WACV51458.2022.00341"},{"key":"5164_CR44","unstructured":"Paszke A, Gross S, Chintala S, et\u00a0al (2017) Automatic differentiation in pytorch"},{"key":"5164_CR45","unstructured":"Peng H, Wu J, Chen S, et\u00a0al (2019) Collaborative channel pruning for deep networks. In: International conference on machine learning"},{"key":"5164_CR46","doi-asserted-by":"crossref","unstructured":"Raja KB, Raghavendra R, Busch C (2019) Obtaining stable iris codes exploiting low-rank tensor space and spatial structure aware refinement for better iris recognition. 2019 International Conference on Biometrics (ICB), pp 1\u20138","DOI":"10.1109\/ICB45273.2019.8987266"},{"key":"5164_CR47","doi-asserted-by":"crossref","unstructured":"Sandler M, Howard AG, Zhu M, et\u00a0al (2018) Mobilenetv2: Inverted residuals and linear bottlenecks. 2018 IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp 4510\u20134520","DOI":"10.1109\/CVPR.2018.00474"},{"key":"5164_CR48","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s11760-020-01760-x","volume":"15","author":"M Shao","year":"2020","unstructured":"Shao M, Dai J, Kuang J et al (2020) A dynamic cnn pruning method based on matrix similarity. Signal, Image Vid Process 15:381\u2013389","journal-title":"Signal, Image Vid Process"},{"key":"5164_CR49","doi-asserted-by":"crossref","unstructured":"Shen M, Molchanov P, Yin H, et\u00a0al (2021) When to prune? a policy towards early structural pruning. 2022 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp 12237\u201312246","DOI":"10.1109\/CVPR52688.2022.01193"},{"key":"5164_CR50","unstructured":"Simonyan K, Zisserman A (2014) Very deep convolutional networks for large-scale image recognition. arXiv:1409.1556"},{"key":"5164_CR51","doi-asserted-by":"crossref","unstructured":"Szegedy C, Liu W, Jia Y, et\u00a0al (2014) Going deeper with convolutions. 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp 1\u20139","DOI":"10.1109\/CVPR.2015.7298594"},{"key":"5164_CR52","unstructured":"Wang D, Zhou L, Zhang X, et\u00a0al (2018) Exploring linear relationship in feature map subspace for convnets compression. arXiv:1803.05729"},{"key":"5164_CR53","unstructured":"Wang H, Qin C, Zhang Y, et\u00a0al (2020) Neural pruning via growing regularization. arXiv:2012.09243"},{"key":"5164_CR54","doi-asserted-by":"crossref","unstructured":"Wang Z, Li C, Wang X (2021) Convolutional neural network pruning with structural redundancy reduction. 2021 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp 14908\u201314917","DOI":"10.1109\/CVPR46437.2021.01467"},{"key":"5164_CR55","unstructured":"Wang Z, jun Liu X, Huang L, et\u00a0al (2021) Model pruning based on quantified similarity of feature maps. arXiv:2105.06052"},{"key":"5164_CR56","unstructured":"You Z, Yan K, Ye J, et\u00a0al (2019) Gate decorator: Global filter pruning method for accelerating deep convolutional neural networks. In: Neural information processing systems"},{"key":"5164_CR57","unstructured":"Zhang C, Bengio S, Hardt M, et\u00a0al (2016) Understanding deep learning requires rethinking generalization. arXiv:1611.03530"},{"key":"5164_CR58","doi-asserted-by":"publisher","first-page":"11244","DOI":"10.1007\/s10489-021-02802-8","volume":"52","author":"M Zhang","year":"2019","unstructured":"Zhang M, Yu X, Rong J et al (2019) Graph pruning for model compression. Appl Intell 52:11244\u201311256","journal-title":"Appl Intell"},{"key":"5164_CR59","doi-asserted-by":"publisher","first-page":"3912","DOI":"10.1109\/TIP.2023.3288986","volume":"32","author":"X Zhang","year":"2023","unstructured":"Zhang X, Xie W, Li Y et al (2023) Reaf: Remembering enhancement and entropy-based asymptotic forgetting for filter pruning. IEEE Trans Image Process 32:3912\u20133923","journal-title":"IEEE Trans Image Process"},{"key":"5164_CR60","doi-asserted-by":"crossref","unstructured":"Zhang Y, Gao S, Huang H (2021) Exploration and estimation for model compression. 2021 IEEE\/CVF International Conference on Computer Vision (ICCV), pp 477\u2013486","DOI":"10.1109\/ICCV48922.2021.00054"},{"key":"5164_CR61","unstructured":"xin Zhang Y, Lin M, Lin CW, et\u00a0al (2021) Carrying out cnn channel pruning in a white box. IEEE transactions on neural networks and learning systems PP"},{"key":"5164_CR62","unstructured":"Zhang Y, Lin M, Lin Z et\u00a0al (2022) Learning best combination for efficient n: M sparsity. Adv Neural Inf Process Syst 35:941-953"},{"key":"5164_CR63","unstructured":"Zhou A, Ma Y, Zhu J, et\u00a0al (2021) Learning n: M fine-grained structured sparse neural networks from scratch. arXiv:2102.04010"},{"key":"5164_CR64","unstructured":"Zhuang Z, Tan M, Zhuang B, et\u00a0al (2018) Discrimination-aware channel pruning for deep neural networks. In: Neural information processing systems"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05164-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-05164-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05164-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T11:55:30Z","timestamp":1730807730000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-05164-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,7]]},"references-count":64,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["5164"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-05164-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,7]]},"assertion":[{"value":"6 November 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2023","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":"Competing of interest"}},{"value":"The relevant datasets are publicly available, and the authors of the manuscript are aware that the data used in this article does not involve ethical issues.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}]}}