{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T04:41:55Z","timestamp":1726116115079},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030698850"},{"type":"electronic","value":"9783030698867"}],"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-69886-7_1","type":"book-chapter","created":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T16:18:56Z","timestamp":1613751536000},"page":"1-13","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Accelerating the Backpropagation Algorithm by Using NMF-Based Method on Deep Neural Networks"],"prefix":"10.1007","author":[{"given":"Suhyeon","family":"Baek","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-4994-2499","authenticated-orcid":false,"given":"Akira","family":"Imakura","sequence":"additional","affiliation":[]},{"given":"Tetsuya","family":"Sakurai","sequence":"additional","affiliation":[]},{"given":"Ichiro","family":"Kataoka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,20]]},"reference":[{"key":"1_CR1","unstructured":"Abadi, M., et al.: Tensorflow: a system for large-scale machine learning. In: 12th $$\\{$$USENIX$$\\}$$ Symposium on Operating Systems Design and Implementation ($$\\{$$OSDI$$\\}$$ 2016), pp. 265\u2013283 (2016)"},{"key":"1_CR2","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-642-20998-7_62","volume-title":"Ubiquitous Computing and Multimedia Applications","author":"N Abdul Hamid","year":"2011","unstructured":"Abdul Hamid, N., Mohd Nawi, N., Ghazali, R., Mohd Salleh, M.N.: Accelerating learning performance of back propagation algorithm by using adaptive gain together with adaptive momentum and adaptive learning rate on classification problems. In: Kim, T., Adeli, H., Robles, R.J., Balitanas, M. (eds.) UCMA 2011. CCIS, vol. 151, pp. 559\u2013570. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20998-7_62"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.18178\/ijmlc.2018.8.3.686","volume":"8","author":"R Arai","year":"2018","unstructured":"Arai, R., Imakura, A., Sakurai, T.: An improvement of the nonlinear semi-NMF based method by considering bias vectors and regularization for deep neural networks. Int. J. Mach. Learn. Comput. 8, 191\u2013197 (2018). https:\/\/doi.org\/10.18178\/ijmlc.2018.8.3.686","journal-title":"Int. J. Mach. Learn. Comput."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bengio, Y., Lamblin, P., Popovici, P., Larochelle, H.: Greedy layer-wise training of deep networks. In: Advances in Neural Information Processing Systems, vol. 19. MIT Press, Cambridge (2007)","DOI":"10.7551\/mitpress\/7503.003.0024"},{"key":"1_CR5","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"1_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/0471725250","volume-title":"Robust Statistics","author":"P Huber","year":"1981","unstructured":"Huber, P., Wiley, J., InterScience, W.: Robust Statistics. Wiley, New York (1981)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11063-017-9642-2","volume":"47","author":"A Imakura","year":"2017","unstructured":"Imakura, A., Inoue, Y., Sakurai, T., Futamura, Y.: Parallel implementation of the nonlinear semi-NMF based alternating optimization method for deep neural networks. Neural Process. Lett. 47, 1\u201313 (2017). https:\/\/doi.org\/10.1007\/s11063-017-9642-2","journal-title":"Neural Process. Lett."},{"key":"1_CR8","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization (2014). http:\/\/arxiv.org\/abs\/1412.6980, cite arxiv:1412.6980 Comment: Published as a conference paper at the 3rd International Conference for Learning Representations, San Diego (2015)"},{"key":"1_CR9","unstructured":"Nair, V., Hinton, G.E.: Rectified linear units improve restricted Boltzmann machines. In: F\u00fcrnkranz, J., Joachims, T. (eds.) Proceedings of the 27th International Conference on Machine Learning (ICML 2010), pp. 807\u2013814 (2010)"},{"key":"1_CR10","unstructured":"Otair, M., Walid, A.S.: Speeding up back-propagation neural networks. In: Proceedings of the 2005 Informing Science and IT Education Joint Conference, vol. 1 (0002)"},{"issue":"6088","key":"1_CR11","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"DE Rumelhart","year":"1986","unstructured":"Rumelhart, D.E., Hinton, G.E., Williams, R.J.: Learning Representations by Back-propagating Errors. Nature 323(6088), 533\u2013536 (1986). https:\/\/doi.org\/10.1038\/323533a0. http:\/\/www.nature.com\/articles\/323533a0","journal-title":"Nature"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-319-46681-1_43","volume-title":"Neural Information Processing","author":"T Sakurai","year":"2016","unstructured":"Sakurai, T., Imakura, A., Inoue, Y., Futamura, Y.: Alternating optimization method based on nonnegative matrix factorizations for deep neural networks. In: Hirose, A., Ozawa, S., Doya, K., Ikeda, K., Lee, M., Liu, D. (eds.) ICONIP 2016. LNCS, vol. 9950, pp. 354\u2013362. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46681-1_43"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCSE.2011.37","volume":"13","author":"S van der Walt","year":"2011","unstructured":"van der Walt, S., Colbert, S.C., Varoquaux, G.: The numpy array: a structure for efficient numerical computation. Comput. Sci. Eng. 13(2), 22\u201330 (2011). http:\/\/dblp.uni-trier.de\/db\/journals\/cse\/cse13.html#WaltCV11","journal-title":"Comput. Sci. Eng."}],"container-title":["Lecture Notes in Computer Science","Knowledge Management and Acquisition for Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69886-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T10:38:30Z","timestamp":1697884710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69886-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030698850","9783030698867"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69886-7_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":"20 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim Knowledge Acquisition Workshop","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yokohama","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkaw2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.pkaw.org\/pkaw2020\/","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":"28","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":"10","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":"5","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":"36% - 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":"2,5","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)"}}]}}