{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T06:22:17Z","timestamp":1750486937461,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030706494"},{"type":"electronic","value":"9783030706500"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-70650-0_1","type":"book-chapter","created":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T14:04:00Z","timestamp":1614866640000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Synthesis and Pruning as a Dynamic Compression Strategy for Efficient Deep Neural Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1825-0097","authenticated-orcid":false,"given":"Alastair","family":"Finlinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sotiris","family":"Moschoyiannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,5]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"70150","DOI":"10.1109\/ACCESS.2020.2985282","volume":"8","author":"A Christidis","year":"2020","unstructured":"Christidis, A., Moschoyiannis, S., Hsu, C.H., Davies, R.: Enabling serverless deployment of large-scale AI workloads. IEEE Access 8, 70150\u201370161 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2985282","journal-title":"IEEE Access"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"2923","DOI":"10.1109\/COMST.2018.2844341","volume":"20","author":"M Mohammadi","year":"2018","unstructured":"Mohammadi, M., Al-Fuqaha, A., Sorour, S., Guizani, M.: Deep learning for IoT big data and streaming analytics: a survey. IEEE Commun. Surv. Tutor. 20(4), 2923\u20132960 (2018). https:\/\/doi.org\/10.1109\/COMST.2018.2844341","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/TC.2019.2954495","volume":"69","author":"X Dai","year":"2020","unstructured":"Dai, X., Yin, H., Jha, N.K.: Grow and prune compact, fast, and accurate LSTMs. IEEE Trans. Comput. 69(3), 441\u2013452 (2020). https:\/\/doi.org\/10.1109\/TC.2019.2954495","journal-title":"IEEE Trans. Comput."},{"key":"1_CR4","unstructured":"Dai, X., Yin, H., Jha, N.K.: Incremental Learning Using a Grow-and-Prune Paradigm with Efficient Neural Networks, p. 10 (2019). https:\/\/arxiv.org\/abs\/1905.10952"},{"issue":"10","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1487","DOI":"10.1109\/tc.2019.2914438","volume":"68","author":"X Dai","year":"2019","unstructured":"Dai, X., Yin, H., Jha, N.K.: NeST: a neural network synthesis tool based on a grow-and-prune paradigm. IEEE Trans. Comput. 68(10), 1487\u20131497 (2019). https:\/\/doi.org\/10.1109\/tc.2019.2914438","journal-title":"IEEE Trans. Comput."},{"key":"1_CR6","unstructured":"Hassantabar, S., Wang, Z., Jha, N.K.: SCANN: Synthesis of Compact and Accurate Neural Networks, p. 11 (2019). https:\/\/arxiv.org\/abs\/1904.09090"},{"key":"1_CR7","unstructured":"Dai, X.: Synthesis of Efficient Neural Networks, no. September (2019)"},{"key":"1_CR8","unstructured":"Mitchell, T.M.: Machine Learning. McGraw-Hill Inc. (1997)"},{"key":"1_CR9","unstructured":"T. (Google). tfmot.sparsity.keras.ConstantSparsity. https:\/\/www.tensorflow.org\/model_optimization\/api_docs\/python\/tfmot\/sparsity\/keras\/ConstantSparsity. Accessed 10 Jan 2020"},{"key":"1_CR10","unstructured":"Han, S., Mao, H., Dally, W.J.: Deep compression: compressing deep neural networks with pruning, trained quantization and Huffman coding. In: 4th International Conference Learning Representation, ICLR 2016 - Conference Track Proceedings, p. 14 (2016)"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"He, Y., Zhang, X., Sun, J.: Channel pruning for accelerating very deep neural networks. In: Proceedings IEEE International Conference on Computer Vision, vol. 2017-October, pp. 1398\u20131406 (2017). https:\/\/doi.org\/10.1109\/ICCV.2017.155","DOI":"10.1109\/ICCV.2017.155"},{"key":"1_CR12","unstructured":"Li, H., Samet, H., Kadav, A., Durdanovic, I., Graf, H.P.: Pruning filters for efficient convnets. In: 5th International Conference on Learning Representation, ICLR 2017 - Conference Track Proceedings, no. 2016, p. 13 (2019)"},{"key":"1_CR13","unstructured":"Zhu, M.H., Gupta, S.: To prune, or not to prune: exploring the efficacy of pruning for model compression. In: 6th International Conference on Learning Representation, ICLR 2018 - Workshop Track Proceedings (2018)"},{"key":"1_CR14","unstructured":"Anwar, S., Sung, W.: Compact Deep Convolutional Neural Networks with Coarse Pruning, vol. 1, no. 2015, p. 10 (2016). https:\/\/arxiv.org\/abs\/1610.09639"},{"key":"1_CR15","unstructured":"Hu, H., Peng, R., Tai, Y.-W., Tang, C.-K.: Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architectures (2016). https:\/\/arxiv.org\/abs\/1607.03250"},{"issue":"8","key":"1_CR16","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735\u20131780 (1997). https:\/\/doi.org\/10.1162\/neco.1997.9.8.1735","journal-title":"Neural Comput."},{"key":"1_CR17","unstructured":"Courbariaux, M., Hubara, I., Soudry, D., El-Yaniv, R., Bengio, Y.: Binarized Neural Networks: Training Deep Neural Networks with Weights and Activations Constrained to +1 or \u22121 (2016). https:\/\/arxiv.org\/abs\/1602.02830"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Ash, T.: Dynamic node creation in backpropagation networks. In: International 1989 Joint Conference on Neural Networks, vol. 2, p. 623 (1989). https:\/\/doi.org\/10.1109\/IJCNN.1989.118509","DOI":"10.1109\/IJCNN.1989.118509"},{"key":"1_CR19","unstructured":"Ma, X., Yuan, G., Lin, S., Li, Z., Sun, H., Wang, Y.: ResNet Can Be Pruned 60x: Introducing Network Purification and Unused Path Removal (P-RM) after Weight Pruning (2019). https:\/\/arxiv.org\/abs\/1905.00136"},{"key":"1_CR20","unstructured":"Howard, A.G., et al.: MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications (2017). https:\/\/arxiv.org\/abs\/1704.04861"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Zhang, X., Zhou, X., Lin, M., Sun, J.: ShuffleNet: an extremely efficient convolutional neural network for mobile devices. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 6848\u20136856 (2018). https:\/\/doi.org\/10.1109\/CVPR.2018.00716.","DOI":"10.1109\/CVPR.2018.00716"},{"key":"1_CR22","unstructured":"LeCun, Y., Denker, J.S., Solla, S.A.: Optimal brain damage (pruning). In: Advance Neural Information Processing Systems, pp. 598\u2013605 (1990)"},{"key":"1_CR23","unstructured":"Hassibi, B., Stork, D.: Second order derivaties for network prunning: optimal brain surgeon. In: Advance NIPS5, pp. 164\u2013171 (1993)"},{"key":"1_CR24","unstructured":"T. (Google). tfmot.sparsity.keras.PolynomialDecay. https:\/\/www.tensorflow.org\/model_optimization\/api_docs\/python\/tfmot\/sparsity\/keras\/PolynomialDecay. Accessed 10 Jan 2020"},{"key":"1_CR25","unstructured":"Janosi, A., Steinbrunn, W., Pfisterer, M., Detrano, R.: Heart Disease UCI (2019). www.Kaggle.com. https:\/\/www.kaggle.com\/ronitf\/heart-disease-uci. Accessed 10 Jan 2020)"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"102419","DOI":"10.1016\/j.jisa.2019.102419","volume":"50","author":"MA Ferrag","year":"2020","unstructured":"Ferrag, M.A., Maglaras, L., Moschoyiannis, S., Janicke, H.: Deep learning for cyber security intrusion detection: approaches, datasets, and comparative study. J. Inf. Secur. Appl. 50, 102419 (2020). https:\/\/doi.org\/10.1016\/j.jisa.2019.102419","journal-title":"J. Inf. Secur. Appl."},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Goodfellow, I.J., Koenig, N., Muja, M., Pantofaru, C., Sorokin, A., Takayama, L.: Help me help you: interfaces for personal robots. In: 5th ACM\/IEEE International Conference on Human-Robot Interaction HRI 2010, no. March, pp. 187\u2013188 (2010). https:\/\/doi.org\/10.1145\/1734454.1734536","DOI":"10.1145\/1734454.1734536"},{"issue":"7346","key":"1_CR28","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1038\/nature10011","volume":"473","author":"YY Liu","year":"2011","unstructured":"Liu, Y.Y., Slotine, J.J., Barab\u00e1si, A.L.: Controllability of complex networks. Nature 473(7346), 167\u2013173 (2011). https:\/\/doi.org\/10.1038\/nature10011","journal-title":"Nature"},{"issue":"1","key":"1_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-018-0088-x","volume":"3","author":"MR Karlsen","year":"2018","unstructured":"Karlsen, M.R., Moschoyiannis, S.: Evolution of control with learning classifier systems. Appl. Netw. Sci. 3(1), 1\u201336 (2018). https:\/\/doi.org\/10.1007\/s41109-018-0088-x","journal-title":"Appl. Netw. Sci."},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-319-99906-7_21","volume-title":"Rules and Reasoning","author":"MR Karlsen","year":"2018","unstructured":"Karlsen, M.R., Moschoyiannis, S.: Learning condition\u2013action rules for personalised journey recommendations. In: Benzm\u00fcller, C., Ricca, F., Parent, X., Roman, D. (eds.) RuleML+RR 2018. LNCS, vol. 11092, pp. 293\u2013301. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99906-7_21"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Razavi, A., Moschoyiannis, S., Krause, P.: A scale-free business network for digital ecosystems. In: Proceedings of the IEEE Digiial EcoSystems and Technologies (IEEE DEST), pp. 241\u2013246 (2008)","DOI":"10.1109\/DEST.2008.4635166"},{"key":"1_CR32","doi-asserted-by":"publisher","unstructured":"Schoenenberger, L., Tanase, R.: Controlling complex policy problems: a multimethodological approach using system dynamics and network controllability. J. Simul. 12 (2017). https:\/\/doi.org\/10.1080\/17477778.2017.1387335","DOI":"10.1080\/17477778.2017.1387335"},{"issue":"4","key":"1_CR33","doi-asserted-by":"publisher","first-page":"483","DOI":"10.3233\/FI-2015-1222","volume":"138","author":"S Moschoyiannis","year":"2015","unstructured":"Moschoyiannis, S., Krause, P.: True concurrency in long-running transactions for digital ecosystems. Fundam. Informaticae 138(4), 483\u2013514 ( 2015). https:\/\/doi.org\/10.3233\/FI-2015-1222","journal-title":"Fundam. Informaticae"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-642-02818-2_32","volume-title":"Web Engineering","author":"A Razavi","year":"2009","unstructured":"Razavi, A., Marinos, A., Moschoyiannis, S., Krause, P.: RESTful transactions supported by the isolation theorems. In: Gaedke, M., Grossniklaus, M., D\u00edaz, O. (eds.) ICWE 2009. LNCS, vol. 5648, pp. 394\u2013409. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02818-2_32"}],"container-title":["Lecture Notes in Computer Science","From Data to Models and Back"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-70650-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T14:28:02Z","timestamp":1614868082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-70650-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030706494","9783030706500"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-70650-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DataMod","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium: From Data to Models and Back","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"datamod2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/datamod2020.github.io\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","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":"11","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":"3","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":"58% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due  to the Corona pandemic, this event was held virtually.","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)"}}]}}