{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:25:13Z","timestamp":1780637113964,"version":"3.54.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"33","license":[{"start":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T00:00:00Z","timestamp":1723593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T00:00:00Z","timestamp":1723593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100007065","name":"Nvidia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007065","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s00521-024-10256-5","type":"journal-article","created":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T18:02:16Z","timestamp":1723658536000},"page":"20607-20616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["PRF: deep neural network compression by systematic pruning of redundant filters"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2595-7493","authenticated-orcid":false,"given":"C. H.","family":"Sarvani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mrinmoy","family":"Ghorai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S. H. Shabbeer","family":"Basha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,14]]},"reference":[{"key":"10256_CR1","unstructured":"Arthur D, Vassilvitskii S (2006) k-means++: the advantages of careful seeding. In: Technical report, Stanford"},{"key":"10256_CR2","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.neunet.2019.04.021","volume":"118","author":"BO Ayinde","year":"2019","unstructured":"Ayinde BO, Inanc T, Zurada JM (2019) Redundant feature pruning for accelerated inference in deep neural networks. Neural Netw 118:148\u2013158","journal-title":"Neural Netw"},{"key":"10256_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.127257","volume":"573","author":"SHS Basha","year":"2024","unstructured":"Basha SHS, Farazuddin M, Pulabaigari V, Dubey SR, Mukherjee S (2024) Deep model compression based on the training history. Neurocomputing 573:127257","journal-title":"Neurocomputing"},{"key":"10256_CR4","doi-asserted-by":"crossref","unstructured":"Chung FRK (1997) Spectral graph theory, vol\u00a092. American Mathematical Soc","DOI":"10.1090\/cbms\/092"},{"key":"10256_CR5","unstructured":"Chung KL, Chang YL (2023) An Effective Backward Filter Pruning Algorithm Using K1, n Bipartite Graph-Based Clustering and the Decreasing Pruning Rate Approach. Authorea Preprints"},{"key":"10256_CR6","doi-asserted-by":"crossref","unstructured":"Ding X, Ding G, Guo Y, Han J (2019) Centripetal SGD for pruning very deep convolutional networks with complicated structure. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 4943\u20134953","DOI":"10.1109\/CVPR.2019.00508"},{"key":"10256_CR7","doi-asserted-by":"crossref","unstructured":"Duggal R, Xiao C, Vuduc R, Chau DH, Sun J (2021) Cup: cluster pruning for compressing deep neural networks. In: 2021 IEEE International conference on big data (Big Data). IEEE, pp 5102\u20135106","DOI":"10.1109\/BigData52589.2021.9671980"},{"issue":"11","key":"10256_CR8","doi-asserted-by":"publisher","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","volume":"35","author":"E Elhamifar","year":"2013","unstructured":"Elhamifar E, Vidal R (2013) Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans Pattern Anal Mach Intell 35(11):2765\u20132781","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"10256_CR9","first-page":"1","volume":"1341","author":"D Erhan","year":"2009","unstructured":"Erhan D, Bengio Y, Courville A, Vincent P (2009) Visualizing higher-layer features of a deep network. Univ Montr 1341(3):1","journal-title":"Univ Montr"},{"key":"10256_CR10","doi-asserted-by":"crossref","unstructured":"Erick FX, Sawant SS, G\u00f6b S, Holzer N, Lang EW, G\u00f6tz T (2022) A simple and effective convolutional filter pruning based on filter dissimilarity analysis. In: ICAART, vol 3, pp 139\u2013145","DOI":"10.5220\/0010786400003116"},{"key":"10256_CR11","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: kdd, vol 96, pp 226\u2013231"},{"issue":"4","key":"10256_CR12","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1109\/JSTSP.2020.2971418","volume":"14","author":"C Gamanayake","year":"2020","unstructured":"Gamanayake C, Jayasinghe L, Ng BK, Yuen C (2020) Cluster pruning: an efficient filter pruning method for edge ai vision applications. IEEE J Sel Top Signal Process 14(4):802\u2013816","journal-title":"IEEE J Sel Top Signal Process"},{"key":"10256_CR13","doi-asserted-by":"crossref","unstructured":"He K, Zhang X, Ren S, Sun J (2015) Delving deep into rectifiers: surpassing human-level performance on imagenet classification. In: Proceedings of the IEEE International conference on computer vision, pp 1026\u20131034","DOI":"10.1109\/ICCV.2015.123"},{"key":"10256_CR14","doi-asserted-by":"crossref","unstructured":"He K, Zhang X, Ren S, Sun J (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":"10256_CR15","unstructured":"Hu H, Peng R, Tai Y-W, Tang C-K (2016) Network trimming: a data-driven neuron pruning approach towards efficient deep architectures. Preprint at arXiv:1607.03250"},{"key":"10256_CR16","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.patrec.2020.03.034","volume":"135","author":"H Ide","year":"2020","unstructured":"Ide H, Kobayashi T, Watanabe K, Kurita T (2020) Robust pruning for efficient CNNs. Pattern Recogn Lett 135:90\u201398","journal-title":"Pattern Recogn Lett"},{"key":"10256_CR17","doi-asserted-by":"crossref","unstructured":"Idelbayev Y, Carreira-Perpin\u00e1n MA (2020) Low-rank compression of neural nets: learning the rank of each layer. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 8049\u20138059","DOI":"10.1109\/CVPR42600.2020.00807"},{"key":"10256_CR18","unstructured":"Krizhevsky A (2009) Learning multiple layers of features from tiny images. Master's thesis, University of Tront"},{"key":"10256_CR19","unstructured":"Li Hao et al (2022) Pruning Filters For Efficient ConvNets. International Conference on Learning Representations"},{"key":"10256_CR20","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"},{"key":"10256_CR21","doi-asserted-by":"crossref","unstructured":"Lin M, Ji R, Zhang Y, Zhang B, Wu Y, Tian Y (2021) 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":"10256_CR22","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"},{"key":"10256_CR23","unstructured":"MacQueen J (1967) Classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley symposium on mathematical statistics and probability, pp 281\u2013297"},{"key":"10256_CR24","unstructured":"Niu T, Teng Y, Zou P (2022) Asymptotic soft cluster pruning for deep neural networks. Preprint at arXiv:2206.08186"},{"key":"10256_CR25","unstructured":"Paszke Adam et al. (2019) Pytorch: An imperative style, high-performance deep learning library. Adv Neural Inf Process Syst 32"},{"issue":"1","key":"10256_CR26","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0893-6080(98)00116-6","volume":"12","author":"N Qian","year":"1999","unstructured":"Qian N (1999) On the momentum term in gradient descent learning algorithms. Neural Netw 12(1):145\u2013151","journal-title":"Neural Netw"},{"key":"10256_CR27","unstructured":"Qin, Zhuwei et al (2018) Demystifying neural network filter pruning. arXiv preprint at arXiv:1811.02639"},{"key":"10256_CR28","unstructured":"Qin Z, Yu F, Liu C, Chen X (2019) Functionality-oriented convolutional filter pruning. In: The British Machine Vision Conference"},{"issue":"3","key":"10256_CR29","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s11263-015-0816-y","volume":"115","author":"Olga Russakovsky","year":"2015","unstructured":"Russakovsky Olga, Deng Jia, Hao Su, Krause Jonathan, Satheesh Sanjeev, Ma Sean, Huang Zhiheng, Karpathy Andrej, Khosla Aditya, Bernstein Michael et al (2015) Imagenet large scale visual recognition challenge. Int J Comput Vision 115(3):211\u2013252","journal-title":"Int J Comput Vision"},{"key":"10256_CR30","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.neucom.2022.09.150","volume":"514","author":"CH Sarvani","year":"2022","unstructured":"Sarvani CH, Dubey SR, Ghorai M (2022) UFKT: Unimportant filters knowledge transfer for CNN pruning. Neurocomputing 514:101\u2013112","journal-title":"Neurocomputing"},{"key":"10256_CR31","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.neunet.2021.12.017","volume":"147","author":"CH Sarvani","year":"2021","unstructured":"Sarvani CH, Ghorai M, Dubey SR, Basha SHS (2021) HRel: filter pruning based on high relevance between activation maps and class labels. Neural Netw 147:186","journal-title":"Neural Netw"},{"key":"10256_CR32","doi-asserted-by":"publisher","first-page":"1","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 Th (2022) An optimal-score-based filter pruning for deep convolutional neural networks. Appl Intell 52:1\u201323","journal-title":"Appl Intell"},{"issue":"2","key":"10256_CR33","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s13042-021-01411-8","volume":"13","author":"Mingwen Shao","year":"2022","unstructured":"Shao Mingwen, Dai Junhui, Wang Ran, Kuang Jiandong, Zuo Wangmeng (2022) CSHE: network pruning by using cluster similarity and matrix eigenvalues. Int J Mach Learn Cybern 13(2):371\u2013382","journal-title":"Int J Mach Learn Cybern"},{"key":"10256_CR34","unstructured":"Simonyan K, Zisserman A (2015) Very deep convolutional networks for large-scale image recognition. In: 3rd International conference on learning representations (ICLR 2015). Computational and Biological Learning Society"},{"key":"10256_CR35","doi-asserted-by":"crossref","unstructured":"Singh A, Plumbley MD (2022) A passive similarity based CNN filter pruning for efficient acoustic scene classification. In: INTERSPEECH","DOI":"10.21437\/Interspeech.2022-10714"},{"key":"10256_CR36","doi-asserted-by":"crossref","unstructured":"Singh P, Verma VK, Rai P, Namboodiri V (2020) Leveraging filter correlations for deep model compression. In: Proceedings of the IEEE\/CVF winter conference on applications of computer vision, pp 835\u2013844","DOI":"10.1109\/WACV45572.2020.9093331"},{"key":"10256_CR37","doi-asserted-by":"crossref","unstructured":"Son S, Nah S, Lee KM (2018) Clustering convolutional kernels to compress deep neural networks. In: Proceedings of the European conference on computer vision (ECCV), pp 216\u2013232","DOI":"10.1007\/978-3-030-01237-3_14"},{"key":"10256_CR38","unstructured":"Wang D, Zhou L, Zhang X, Bai X, Zhou J (2018) Exploring linear relationship in feature map subspace for convnets compression. Preprint at arXiv:1803.05729"},{"key":"10256_CR39","doi-asserted-by":"crossref","unstructured":"Wei X, Shen X, Zhou C, Yue H (2020) A novel clustering-based filter pruning method for efficient deep neural networks. In: International conference on algorithms and architectures for parallel processing. Springer, pp 245\u2013258","DOI":"10.1007\/978-3-030-60239-0_17"},{"key":"10256_CR40","volume-title":"Statistical methods in the atmospheric sciences","author":"DS Wilks","year":"2011","unstructured":"Wilks DS (2011) Statistical methods in the atmospheric sciences, vol 100. Academic press, Cambridge"},{"issue":"9","key":"10256_CR41","doi-asserted-by":"publisher","first-page":"4541","DOI":"10.3390\/app12094541","volume":"12","author":"Z Wu","year":"2022","unstructured":"Wu Z, Li F, Zhu Y, Lu K, Wu M, Zhang C (2022) A filter pruning method of CNN models based on feature maps clustering. Appl Sci 12(9):4541","journal-title":"Appl Sci"},{"key":"10256_CR42","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, Liang J (2021) Deep neural network compression through interpretability-based filter pruning. Pattern Recogn 119:108056","journal-title":"Pattern Recogn"},{"key":"10256_CR43","doi-asserted-by":"publisher","first-page":"6807","DOI":"10.1109\/TCSVT.2022.3170620","volume":"32","author":"H Zhang","year":"2022","unstructured":"Zhang H, Liu L, Zhou H, Si L, Sun H, Zheng N (2022) FCHP: exploring the discriminative feature and feature correlation of feature maps for hierarchical DNN pruning and compression. IEEE Trans Circuits Syst Video Technol 32:6807","journal-title":"IEEE Trans Circuits Syst Video Technol"},{"key":"10256_CR44","doi-asserted-by":"crossref","unstructured":"Zhou Z, Zhou W, Li H, Hong R (2018) Online filter clustering and pruning for efficient convnets. In: 2018 25th IEEE International conference on image processing (ICIP). IEEE, pp 11\u201315","DOI":"10.1109\/ICIP.2018.8451123"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-10256-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-024-10256-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-10256-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,28]],"date-time":"2024-09-28T16:02:39Z","timestamp":1727539359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-024-10256-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,14]]},"references-count":44,"journal-issue":{"issue":"33","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["10256"],"URL":"https:\/\/doi.org\/10.1007\/s00521-024-10256-5","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,14]]},"assertion":[{"value":"15 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2024","order":3,"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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}