{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:48:36Z","timestamp":1742928516836,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304928"},{"type":"electronic","value":"9783030304935"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-30493-5_35","type":"book-chapter","created":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T20:03:41Z","timestamp":1568145821000},"page":"353-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Chow-Liu Forest Based Regularization of Deep Belief Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0560-5845","authenticated-orcid":false,"given":"Alex","family":"Sarishvili","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3185-4901","authenticated-orcid":false,"given":"Andreas","family":"Wirsen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6612-8037","authenticated-orcid":false,"given":"Mats","family":"Jirstrand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,9]]},"reference":[{"key":"35_CR1","first-page":"1205","volume":"4","author":"FR Bach","year":"2003","unstructured":"Bach, F.R., Jordan, M.I.: Beyond independent components: trees and clusters. J. Mach. Learn. Res. 4, 1205\u20131233 (2003)","journal-title":"J. Mach. Learn. Res."},{"issue":"10","key":"35_CR2","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1109\/TNNLS.2015.2496947","volume":"27","author":"PP Brahma","year":"2016","unstructured":"Brahma, P.P., Wu, D., She, Y.: Why deep learning works: a manifold disentanglement perspective. IEEE Trans. Neural Netw. Learn. Syst. 27(10), 1997\u20132007 (2016). https:\/\/doi.org\/10.1109\/TNNLS.2015.2496947","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"14","author":"C Chow","year":"1968","unstructured":"Chow, C., Liu, C.: Approximating discrete probability distributions with dependence trees. IEEE Trans. Inf. Theory 14, 462\u2013467 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"35_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/047174882X","volume-title":"Elements of Information Theory","author":"Thomas M. Cover","year":"2005","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley Interscience (2006). https:\/\/doi.org\/10.1002\/047174882X"},{"issue":"2\/3","key":"35_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1007417612269","volume":"29","author":"Sanjoy Dasgupta","year":"1997","unstructured":"Dasgupta, S.: The Sample Complexity of Learning Fixed-Structure Bayesian Networks. Kluwer Academic Publishers, Boston (1999). https:\/\/doi.org\/10.1023\/A:1007417612269","journal-title":"Machine Learning"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-33275-3_2","volume-title":"Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications","author":"A Fischer","year":"2012","unstructured":"Fischer, A., Igel, C.: An introduction to restricted Boltzmann machines. In: Alvarez, L., Mejail, M., Gomez, L., Jacobo, J. (eds.) CIARP 2012. LNCS, vol. 7441, pp. 14\u201336. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33275-3_2"},{"issue":"8","key":"35_CR7","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1162\/089976602760128018","volume":"14","author":"Geoffrey E. Hinton","year":"2002","unstructured":"Hinton, G.E.: Training products of experts by minimizing contrastive divergence. Neural Comput. 14(8) (2002). https:\/\/doi.org\/10.1162\/089976602760128018","journal-title":"Neural Computation"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-642-35289-8_32","volume-title":"Neural Networks: Tricks of the Trade","author":"GE Hinton","year":"2012","unstructured":"Hinton, G.E.: A practical guide to training restricted Boltzmann machines. In: Montavon, G., Orr, G.B., M\u00fcller, K.-R. (eds.) Neural Networks: Tricks of the Trade. LNCS, vol. 7700, pp. 599\u2013619. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35289-8_32"},{"issue":"7","key":"35_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1162\/neco.2006.18.7.1527","volume":"18","author":"GE Hinton","year":"2006","unstructured":"Hinton, G.E., Osindero, S., Teh, Y.: A fast learning algorithm for deep belief nets. Neural Comput. 18(7), 27\u201354 (2006). https:\/\/doi.org\/10.1162\/neco.2006.18.7.1527","journal-title":"Neural Comput."},{"issue":"2","key":"35_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1017\/S0269888910000275","volume":"26","author":"Simon Parsons","year":"2011","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models, Principles and Techniques. MIT Press, Cambridge (2009). https:\/\/doi.org\/10.1017\/S0269888910000275","journal-title":"The Knowledge Engineering Review"},{"key":"35_CR11","volume-title":"Graphical Models in a Nutshell","author":"D Koller","year":"2007","unstructured":"Koller, D., Friedman, N., Getoor, L., Taskar, B.: Graphical Models in a Nutshell. MIT Press, Cambridge (2007). https:\/\/doi.org\/10.1.1.146.2935"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1613\/jair.914","volume":"15","author":"C. Meek","year":"2001","unstructured":"Meek, C.: Finding a path is harder than finding a tree. J. Artif. Intell. Res. 15 (2001). https:\/\/doi.org\/10.1613\/jair.914","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"35_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s11122-005-0012-8","volume":"41","author":"MS Pinsker","year":"2005","unstructured":"Pinsker, M.S.: On estimation of information via variation. Probl. Inf. Transm. 41(2), 71\u201375 (2005). https:\/\/doi.org\/10.1007\/s11122-005-0012-8","journal-title":"Probl. Inf. Transm."},{"key":"35_CR14","doi-asserted-by":"publisher","unstructured":"Salakhutdinov, R., Mnih, A., Hinton, G.E.: Restricted Boltzmann machines for collaborative filtering. In: International Conference on Machine Learning 24 (2007). https:\/\/doi.org\/10.1145\/1273496.1273596","DOI":"10.1145\/1273496.1273596"},{"key":"35_CR15","first-page":"1617","volume":"12","author":"VYF Tan","year":"2011","unstructured":"Tan, V.Y.F., Anandkumar, A., Willsky, A.: Learning high-dimensional markov forest distributions: analysis of error rates. J. Mach. Learn. Res. 12, 1617\u20131653 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"35_CR16","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks and Machine Learning \u2013 ICANN 2019: Workshop and Special Sessions"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30493-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:51:04Z","timestamp":1710348664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30493-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304928","9783030304935"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30493-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICANN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Neural Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icann2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/e-nns.org\/icann2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}