{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T02:13:55Z","timestamp":1772072035877,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"32","license":[{"start":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T00:00:00Z","timestamp":1708646400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T00:00:00Z","timestamp":1708646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62071303"],"award-info":[{"award-number":["62071303"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62201355"],"award-info":[{"award-number":["62201355"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Shenzhen Science and Technology Project","award":["JCYJ20220531102407018"],"award-info":[{"award-number":["JCYJ20220531102407018"]}]},{"name":"the PHD Research Foundation of Gannan Normal University","award":["BSJJ202261"],"award-info":[{"award-number":["BSJJ202261"]}]},{"name":"the science and technology project of the education department of Jiangxi province","award":["GJJ2201210"],"award-info":[{"award-number":["GJJ2201210"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"DOI":"10.1007\/s11042-024-18615-z","type":"journal-article","created":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T08:02:37Z","timestamp":1708675357000},"page":"78407-78431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Pruning rate-controlled filter order\u2013information structure similarity graph clustering for DCNN structure optimization methods"],"prefix":"10.1007","volume":"83","author":[{"given":"Jihong","family":"Pei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengliang","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9666-0772","authenticated-orcid":false,"given":"Jihong","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,23]]},"reference":[{"key":"18615_CR1","doi-asserted-by":"crossref","unstructured":"Jegan R, Vijayakumar P, Ambethkumar V, Vijay P, Onyema EM (2023) Encryption and decryption of a word into weighted graph using super-edge anti-magic total labeling of bi-star graph","DOI":"10.47974\/JDMSC-1752"},{"issue":"3","key":"18615_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.12694\/scpe.v23i3.2001","volume":"23","author":"L Ma","year":"2022","unstructured":"Ma L, Gupta RK, Onyema EM (2022) Optimization of intelligent network information management system under big data and cloud computing. Scalable Comput Pract Exp 23(3):91\u2013101","journal-title":"Scalable Comput Pract Exp"},{"key":"18615_CR3","doi-asserted-by":"crossref","unstructured":"Burhan M, Alam H, Arsalan A, Rehman RA, Anwar M, Faheem M, Ashraf MW (2023) A comprehensive survey on the cooperation of fog computing paradigm-based iot applications: layered architecture, real-time security issues, and solutions. IEEE Access","DOI":"10.1109\/ACCESS.2023.3294479"},{"key":"18615_CR4","doi-asserted-by":"publisher","first-page":"106216","DOI":"10.1016\/j.asoc.2020.106216","volume":"91","author":"B Raza","year":"2020","unstructured":"Raza B, Aslam A, Sher A, Malik AK, Faheem M (2020) Autonomic performance prediction framework for data warehouse queries using lazy learning approach. Appl Soft Comput 91:106216","journal-title":"Appl Soft Comput"},{"key":"18615_CR5","doi-asserted-by":"crossref","unstructured":"Malik H, Anees T, Faheem M, Chaudhry MU, Ali A, Asghar MN (2023) Blockchain and internet of things in smart cities and drug supply management: Open issues, opportunities, and future directions. Internet of Things, pp\u00a0100860","DOI":"10.1016\/j.iot.2023.100860"},{"key":"18615_CR6","unstructured":"Lecun Y, Denker JS, Solla SA, Howard RE, Jackel LD (1989) Optimal brain damage. In: Advances in neural information processing systems 2, [NIPS Conference, Denver, Colorado, USA, November 27-30, 1989]"},{"key":"18615_CR7","unstructured":"Hassibi B, Stork DG (1993) Second order derivatives for network pruning: optimal brain surgeon, In: Advances in neural information processing systems"},{"key":"18615_CR8","unstructured":"Han S, Pool J, Tran J, Dally W (2015) Learning both weights and connections for efficient neural network. In: Advances in neural information processing systems, pp 1135\u20131143"},{"issue":"4","key":"18615_CR9","first-page":"3","volume":"56","author":"S Han","year":"2015","unstructured":"Han S, Mao H, Dally WJ (2015) Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. Fiber 56(4):3\u20137","journal-title":"Fiber"},{"key":"18615_CR10","unstructured":"Ullrich K, Meeds E, Welling M (2017) Soft weight-sharing for neural network compression"},{"key":"18615_CR11","unstructured":"Xiao X, Wang Z, Rajasekaran S (2019) Autoprune: Automatic network pruning by regularizing auxiliary parameters. In: Advances in neural information processing systems, pp 13681\u201313691"},{"issue":"3","key":"18615_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3005348","volume":"13","author":"S Anwar","year":"2017","unstructured":"Anwar S, Hwang K, Sung W (2017) Structured pruning of deep convolutional neural networks. ACM J Emerg Technol Comput Syst (JETC) 13(3):1\u201318","journal-title":"ACM J Emerg Technol Comput Syst (JETC)"},{"key":"18615_CR13","unstructured":"Wang Y, Xu C, You S, Tao D, Xu C (2016) Cnnpack: Packing convolutional neural networks in the frequency domain. In: Advances in neural information processing systems, pp 253\u2013261"},{"key":"18615_CR14","unstructured":"Liu Z, Xu J, Peng X, Xiong R (2018) Frequency-domain dynamic pruning for convolutional neural networks. In: Advances in neural information processing systems, pp 1043\u20131053"},{"key":"18615_CR15","unstructured":"Li Z, Gong Y, Ma X, Liu S, Sun M, Zhan Z, Kong Z, Yuan G, Wang Y (2020) SS-Auto: A single-shot, automatic structured weight pruning framework of DNNs with ultra-high efficiency. arXiv:2001.08839"},{"key":"18615_CR16","unstructured":"Lin C, Zhong Z, Wei W, Yan J (2018) Synaptic strength for convolutional neural network. In: Advances in neural information processing systems, pp 10149\u201310158"},{"key":"18615_CR17","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 conference on computer vision and pattern recognition, pp 2800\u20132809","DOI":"10.1109\/CVPR.2019.00291"},{"key":"18615_CR18","doi-asserted-by":"crossref","unstructured":"Mao H, Han S, Pool J, Li W, Liu X, Wang Y, Dally WJ (2017) Exploring the regularity of sparse structure in convolutional neural networks. arXiv:1705.08922","DOI":"10.1109\/CVPRW.2017.241"},{"key":"18615_CR19","unstructured":"Wen W, Wu C, Wang Y, Chen Y, Li H (2016) Learning structured sparsity in deep neural networks"},{"key":"18615_CR20","unstructured":"Wang H, Zhang Q, Wang Y, Lu Y, Hu H (2018) Structured deep neural network pruning by varying regularization parameters"},{"key":"18615_CR21","doi-asserted-by":"publisher","first-page":"10974","DOI":"10.1109\/ACCESS.2021.3051504","volume":"9","author":"J Zhu","year":"2021","unstructured":"Zhu J, Zhao Y, Pei J (2021) Progressive kernel pruning based on the information mapping sparse index for cnn compression. IEEE Access 9:10974\u201310987","journal-title":"IEEE Access"},{"key":"18615_CR22","doi-asserted-by":"crossref","unstructured":"Zhu J, Pei J (2022) Progressive kernel pruning cnn compression method with an adjustable input channel. Appl Intell, pp\u00a010519\u2013 10540","DOI":"10.1007\/s10489-021-02932-z"},{"key":"18615_CR23","doi-asserted-by":"crossref","unstructured":"Zhu J, Pei J (2022) Progressive kernel pruning with saliency mapping of input-output channels, Neurocomputing (Jan.7) 467","DOI":"10.1016\/j.neucom.2021.10.009"},{"key":"18615_CR24","unstructured":"Li H, Kadav A, Durdanovic I, Samet H, Graf HP (2016) Pruning filters for efficient convnets. arXiv:1608.08710"},{"key":"18615_CR25","doi-asserted-by":"crossref","unstructured":"He Y, Dong X, Kang G, Fu Y, Yan C, Yang Y (2019) Asymptotic soft filter pruning for deep convolutional neural networks. IEEE","DOI":"10.1109\/CVPR42600.2020.00208"},{"key":"18615_CR26","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:1808.06866","DOI":"10.24963\/ijcai.2018\/309"},{"key":"18615_CR27","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 conference on computer vision and pattern recognition, pp 4340\u20134349","DOI":"10.1109\/CVPR.2019.00447"},{"key":"18615_CR28","doi-asserted-by":"crossref","unstructured":"He Y, Ding Y, Liu P, Zhu L, Zhang H, Yang Y (2020) Learning filter pruning criteria for deep convolutional neural networks acceleration. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 2009\u20132018","DOI":"10.1109\/CVPR42600.2020.00208"},{"key":"18615_CR29","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":"18615_CR30","doi-asserted-by":"crossref","unstructured":"Yu R, Li A, Chen C-F, Lai J-H, Morariu VI, Han X, Gao M, Lin C-Y, Davis LS (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":"18615_CR31","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"},{"key":"18615_CR32","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. In: Advances in neural information processing systems, pp 875\u2013886"},{"key":"18615_CR33","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":"18615_CR34","doi-asserted-by":"crossref","unstructured":"Lin S, Ji R, Li Y, Wu Y, Huang F, Zhang B (2018) Accelerating convolutional networks via global & dynamic filter pruning. In: IJCAI, pp 2425\u20132432","DOI":"10.24963\/ijcai.2018\/336"},{"issue":"2","key":"18615_CR35","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 Trans Neural Netw Learn Syst 31(2):574\u2013588","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"18615_CR36","unstructured":"Louizos C, Welling M, Kingma DP (2017) Learning sparse neural networks through $$ l_0 $$ regularization. arXiv:1712.01312"},{"key":"18615_CR37","doi-asserted-by":"crossref","unstructured":"Zhu X, Zhou W, Li H (2018) Improving deep neural network sparsity through decorrelation regularization. In: IJCAI, pp 3264\u20133270","DOI":"10.24963\/ijcai.2018\/453"},{"key":"18615_CR38","doi-asserted-by":"crossref","unstructured":"Liu C, Wang Y, Han K, Xu C, Xu C (2019) Learning instance-wise sparsity for accelerating deep models. arXiv:1907.11840","DOI":"10.24963\/ijcai.2019\/416"},{"key":"18615_CR39","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":"18615_CR40","unstructured":"Donggyu Joo DK (2022) Linear combination approximation of feature for channel pruning. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition (CVPR) Workshops2772\u20132781"},{"key":"18615_CR41","doi-asserted-by":"publisher","unstructured":"Lin M, Cao L, Zhang Y, Shao L, Lin C-W, Ji R (2022) Pruning networks with cross-layer ranking & k-reciprocal nearest filters. In: IEEE Transactions on neural networks and learning systems, pp\u00a01\u201310. https:\/\/doi.org\/10.1109\/TNNLS.2022.3156047","DOI":"10.1109\/TNNLS.2022.3156047"},{"issue":"12","key":"18615_CR42","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"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-024-18615-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-024-18615-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-024-18615-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T04:15:07Z","timestamp":1725423307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-024-18615-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,23]]},"references-count":42,"journal-issue":{"issue":"32","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["18615"],"URL":"https:\/\/doi.org\/10.1007\/s11042-024-18615-z","relation":{},"ISSN":["1573-7721"],"issn-type":[{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,23]]},"assertion":[{"value":"5 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2024","order":4,"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":"Conflicts of interest"}}]}}