{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T19:36:35Z","timestamp":1772825795269,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031301049","type":"print"},{"value":"9783031301056","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30105-6_8","type":"book-chapter","created":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T20:31:55Z","timestamp":1681331515000},"page":"88-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Filter Pruning via\u00a0Similarity Clustering for\u00a0Deep Convolutional Neural Networks"],"prefix":"10.1007","author":[{"given":"Kang","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wangshu","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,13]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Durand, T., Mehrasa, N., Mori, G.: Learning a deep convnet for multi-label classification with partial labels. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 647\u2013657 (2019)","DOI":"10.1109\/CVPR.2019.00074"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Zhu, C., Chen, F., Ahmed, U., Shen, Z., Savvides, M.: Semantic relation reasoning for shot-stable few-shot object detection. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 8782\u20138791 (2021)","DOI":"10.1109\/CVPR46437.2021.00867"},{"key":"8_CR3","unstructured":"Hinton, G., Vinyals, O., Dean, J., et al.: Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531, 2(7) (2015)"},{"key":"8_CR4","unstructured":"Zhou, S., Wu, Y., Ni, Z., Zhou, X., Wen, H., Y. Zou: Dorefa-net: training low bitwidth convolutional neural networks with low bitwidth gradients. arXiv preprint arXiv:1606.06160 (2016)"},{"key":"8_CR5","unstructured":"Han, S., Mao, H., Dally, W.J.: Deep compression: compressing deep neural networks with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149 (2015)"},{"key":"8_CR6","unstructured":"Han, S., Pool, J., Tran, J., Dally, W.: Learning both weights and connections for efficient neural network. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"key":"8_CR7","unstructured":"Ye, S., et al.: Progressive weight pruning of deep neural networks using ADMM. arXiv preprint arXiv:1810.07378 (2018)"},{"key":"8_CR8","unstructured":"Li, H., Kadav, A., Durdanovic, I., Samet, H., Graf, H.P.: Pruning filters for efficient convnets. arXiv preprint arXiv:1608.08710 (2016)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"He, Y., Kang, G., Dong, X., Fu, Y., Yang, Y.: Soft filter pruning for accelerating deep convolutional neural networks. arXiv preprint arXiv:1808.06866 (2018)","DOI":"10.24963\/ijcai.2018\/309"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"He, Y., Liu, P., Wang, Z., Hu, Z., Yang, Y.: 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 (2019)","DOI":"10.1109\/CVPR.2019.00447"},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s13042-021-01411-8","volume":"13","author":"M Shao","year":"2022","unstructured":"Shao, M., Dai, J., Wang, R., Kuang, J., Zuo, W.: Cshe: network pruning by using cluster similarity and matrix eigenvalues. Int. J. Mach. Learn. Cybern. 13(2), 371\u2013382 (2022)","journal-title":"Int. J. Mach. Learn. Cybern."},{"issue":"8","key":"8_CR12","doi-asserted-by":"publisher","first-page":"3594","DOI":"10.1109\/TCYB.2019.2933477","volume":"50","author":"Y He","year":"2019","unstructured":"He, Y., Dong, X., Kang, G., Fu, Y., Yan, C., Yang, Y.: Asymptotic soft filter pruning for deep convolutional neural networks. IEEE Trans. Cybern. 50(8), 3594\u20133604 (2019)","journal-title":"IEEE Trans. Cybern."},{"key":"8_CR13","unstructured":"Hu, H., Peng, R., Tai, Y.-W., Tang, C.-K.: Network trimming: a data-driven neuron pruning approach towards efficient deep architectures. arXiv preprint arXiv:1607.03250 (2016)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Lin, M., et al.: Hrank: filter pruning using high-rank feature map. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 1529\u20131538 (2020)","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"J.-H. Luo, J. Wu, and W. Lin, \"Thinet: A filter level pruning method for deep neural network compression,\" in Proceedings of the IEEE international conference on computer vision, 2017, pp. 5058\u20135066","DOI":"10.1109\/ICCV.2017.541"},{"key":"8_CR16","unstructured":"Xie, Z., Fu, Y., Tian, S., Zhou, J., Chen, D.: Pruning with compensation: efficient channel pruning for deep convolutional neural networks. arXiv preprint arXiv:2108.13728 (2021)"},{"key":"8_CR17","unstructured":"Liu, Z., Sun, M., Zhou, T., Huang, G., Darrell, T.: Rethinking the value of network pruning. arXiv preprint arXiv:1810.05270 (2018)"},{"key":"8_CR18","unstructured":"Meng, F., et al.: Pruning filter in filter. In: Advances in Neural Information Processing Systems, vol. 33, pp. 17 629\u201317 640 (2020)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Li, Y., Gu, S., Mayer, C., Gool, L.V., Timofte, R.: Group sparsity: the hinge between filter pruning and decomposition for network compression. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 8018\u20138027 (2020)","DOI":"10.1109\/CVPR42600.2020.00804"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Lin, M., Ji, R., Zhang, Y., Zhang, B., Wu, Y., Tian, Y.: Channel pruning via automatic structure search. arXiv preprint arXiv:2001.08565 (2020)","DOI":"10.24963\/ijcai.2020\/94"},{"key":"8_CR21","unstructured":"Lin, M., et al.: Filter sketch for network pruning. IEEE Trans. Neural Networks Learn. Syst. (2021)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-030-58598-3_36","volume-title":"Computer Vision \u2013 ECCV 2020","author":"Y Li","year":"2020","unstructured":"Li, Y., Gu, S., Zhang, K., Van Gool, L., Timofte, R.: DHP: differentiable meta pruning via HyperNetworks. In: Vedaldi, A., Bischof, H., Brox, T., Frahm, J.-M. (eds.) ECCV 2020. LNCS, vol. 12353, pp. 608\u2013624. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58598-3_36"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Dong, X., Huang, J., Yang, Y., Yan, S.: More is less: a more complicated network with less inference complexity. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 5840\u20135848 (2017)","DOI":"10.1109\/CVPR.2017.205"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-030-58580-8_35","volume-title":"Computer Vision \u2013 ECCV 2020","author":"X Ning","year":"2020","unstructured":"Ning, X., Zhao, T., Li, W., Lei, P., Wang, Yu., Yang, H.: DSA: more efficient budgeted pruning via differentiable sparsity allocation. In: Vedaldi, A., Bischof, H., Brox, T., Frahm, J.-M. (eds.) ECCV 2020. LNCS, vol. 12348, pp. 592\u2013607. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58580-8_35"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Ding, X., Ding, G., Guo, Y., Han, J.: 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 (2019)","DOI":"10.1109\/CVPR.2019.00508"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30105-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T20:33:02Z","timestamp":1681331582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30105-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031301049","9783031301056"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30105-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Delhi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iconip2022.apnns.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"810","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"359","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.65","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ICONIP 2022 consists of a two-volume set, LNCS & CCIS, which includes 146 and 213 papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}