{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:10Z","timestamp":1740123190915,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T00:00:00Z","timestamp":1561593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T00:00:00Z","timestamp":1561593600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["GRK 1653"],"award-info":[{"award-number":["GRK 1653"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10994-019-05813-2","type":"journal-article","created":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T17:03:00Z","timestamp":1561654980000},"page":"135-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Sum\u2013product graphical models"],"prefix":"10.1007","volume":"109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2749-3530","authenticated-orcid":false,"given":"Mattia","family":"Desana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Schn\u00f6rr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,27]]},"reference":[{"key":"5813_CR1","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1109\/TPAMI.2015.2465955","volume":"38","author":"M Amer","year":"2015","unstructured":"Amer, M., & Todorovic, S. (2015). Sum product networks for activity recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 38, 800\u2013813.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5813_CR2","unstructured":"Bacchus, F., Dalmao, S., & Pitassi, T. (2012). Value elimination: Bayesian inference via backtracking search. CoRR, arXiv:1212.2452 ."},{"key":"5813_CR3","unstructured":"Bach, F.\u00a0R., & Jordan, M.\u00a0I. (2001). Thin junction trees. In Advances in neural information processing systems, vol 14. MIT Press, pp. 569\u2013576."},{"key":"5813_CR4","unstructured":"Boutilier, C., Friedman, N., Goldszmidt, M., & Koller, D. (1996). Context-specific independence in Bayesian networks. pp. 115\u2013123."},{"key":"5813_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, W.-C., Kok, S., Pham, H.\u00a0V., Chieu, H.\u00a0L., & Chai, K.\u00a0M. (2014). Language modeling with sum\u2013product networks. InAnnual conference of the international speech communication association 15 (INTERSPEECH 2014).","DOI":"10.21437\/Interspeech.2014-476"},{"key":"5813_CR6","unstructured":"Chickering, D.\u00a0M., Heckerman, D., & Meek, C. (2013). A Bayesian approach to learning Bayesian networks with local structure. CoRR, arXiv:1302.1528 ."},{"key":"5813_CR7","first-page":"1771","volume":"12","author":"MJ Choi","year":"2011","unstructured":"Choi, M. J., Tan, V. Y. F., Anandkumar, A., & Willsky, A. S. (2011). Learning latent tree graphical models. Journal of Machine Learning Research, 12, 1771\u20131812.","journal-title":"Journal of Machine Learning Research"},{"key":"5813_CR8","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"14","author":"CI Chow","year":"1968","unstructured":"Chow, C. I., & Liu, C. N. (1968). Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14, 462\u2013467.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5813_CR9","unstructured":"Conaty, D., Mau\u00e1, D.\u00a0D., & de\u00a0Campos, C.\u00a0P. (2017). Approximation complexity of maximum a posteriori inference in sum\u2013product networks. In Elidan, G., & Kersting, K. (Eds), Proceedings of the thirty-third conference on uncertainty in artificial intelligence. AUAI Press, pp. 322\u2013331."},{"key":"5813_CR10","volume-title":"Probabilistic networks and expert systems","author":"R Cowell","year":"2003","unstructured":"Cowell, R., Dawid, A., Lauritzen, S., & Spiegelhalter, D. (2003). Probabilistic networks and expert systems. Berlin: Springer."},{"key":"5813_CR11","first-page":"409","volume-title":"KR","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A. (2002). A logical approach to factoring belief networks. In D. Fensel, F. Giunchiglia, D. L. McGuinness, & M.-A. Williams (Eds.), KR (pp. 409\u2013420). Burlington: Morgan Kaufmann."},{"issue":"3","key":"5813_CR12","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/765568.765570","volume":"50","author":"A Darwiche","year":"2003","unstructured":"Darwiche, A. (2003). A differential approach to inference in Bayesian networks. Journal of the ACM, 50(3), 280\u2013305.","journal-title":"Journal of the ACM"},{"issue":"2\u20133","key":"5813_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.artint.2006.11.003","volume":"171","author":"R Dechter","year":"2007","unstructured":"Dechter, R., & Mateescu, R. (2007). AND\/OR search spaces for graphical models. Artificial Intelligence, 171(2\u20133), 73\u2013106.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"5813_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 39(1), 1\u201338.","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"5813_CR15","unstructured":"Desana, M. & Schn\u00f6rr, C. (2016). Expectation maximization for sum\u2013product networks as exponential family mixture models. CoRR, arXiv:1604.07243 ."},{"key":"5813_CR16","volume-title":"Graph theory","author":"R Diestel","year":"2006","unstructured":"Diestel, R. (2006). Graph theory (3rd ed.). Berlin: Springer.","edition":"3"},{"key":"5813_CR17","doi-asserted-by":"publisher","first-page":"8092","DOI":"10.1073\/pnas.0731829100","volume":"100","author":"A Fridman","year":"2003","unstructured":"Fridman, A. (2003). Mixed Markov models. PNAS, 100, 8092\u20138096.","journal-title":"PNAS"},{"key":"5813_CR18","unstructured":"Gens, R., & Domingos, P. (2012). Discriminative learning of sum\u2013product networks. In NIPS, pp. 3248\u20133256."},{"key":"5813_CR19","first-page":"873","volume":"3","author":"R Gens","year":"2013","unstructured":"Gens, R., & Domingos, P. (2013). Learning the structure of sum\u2013product networks. ICML, 3, 873\u2013880.","journal-title":"ICML"},{"key":"5813_CR20","first-page":"748","volume-title":"Advances in neural information processing systems","author":"V Gogate","year":"2010","unstructured":"Gogate, V., Webb, W., & Domingos, P. (2010). Learning efficient Markov networks. In J. Lafferty, C. Williams, J. Shawe-Taylor, R. Zemel, & A. Culotta (Eds.), Advances in neural information processing systems (Vol. 23, pp. 748\u2013756). Red Hook: Curran Associates Inc."},{"key":"5813_CR21","doi-asserted-by":"publisher","first-page":"2006","DOI":"10.1162\/neco.2006.18.7.1527","volume":"18","author":"GE Hinton","year":"2006","unstructured":"Hinton, G. E., & Osindero, S. (2006). A fast learning algorithm for deep belief nets. Neural Computation, 18, 2006.","journal-title":"Neural Computation"},{"key":"5813_CR22","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1162\/neco.1994.6.2.181","volume":"6","author":"MI Jordan","year":"1994","unstructured":"Jordan, M. I. (1994). Hierarchical mixtures of experts and the EM algorithm. Neural Computation, 6, 181\u2013214.","journal-title":"Neural Computation"},{"issue":"10","key":"5813_CR23","doi-asserted-by":"publisher","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V Kolmogorov","year":"2006","unstructured":"Kolmogorov, V. (2006). Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(10), 1568\u20131583.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"5813_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., & Zabih, R. (2004). What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(2), 147\u2013159.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5813_CR25","unstructured":"Lowd, D., & Domingos, P. (2012). Learning arithmetic circuits. CoRR, arXiv:1206.3271 ."},{"key":"5813_CR26","unstructured":"Mcallester, D., Collins, M., & Pereira, F. (2004). Case-factor diagrams for structured probabilistic modeling. In Proceedings of the twentieth conference on uncertainty in artificial intelligence (UAI 04), pp. 382\u2013391."},{"key":"5813_CR27","doi-asserted-by":"crossref","unstructured":"Mei, J., Jiang, Y., & Tu, K. (2018). Maximum a posteriori inference in sum\u2013product networks.","DOI":"10.1609\/aaai.v32i1.11550"},{"key":"5813_CR28","first-page":"1","volume":"1","author":"M Meila","year":"2000","unstructured":"Meila, M., & Jordan, M. I. (2000). Learning with mixtures of trees. Journal of Machine Learning Research, 1, 1\u201348.","journal-title":"Journal of Machine Learning Research"},{"key":"5813_CR29","unstructured":"Minka, T., & Winn, J. (2009). Gates. In Advances in neural information processing systems 21."},{"key":"5813_CR30","doi-asserted-by":"crossref","unstructured":"Neal, R., & Hinton, G.\u00a0E. (1998). A view of the EM algorithm that justifies incremental, sparse, and other variants. In Learning in graphical models. Kluwer Academic Publishers, pp. 355\u2013368.","DOI":"10.1007\/978-94-011-5014-9_12"},{"key":"5813_CR31","unstructured":"Peharz, R. (2015). Foundations of sum\u2013product networks for probabilistic modeling (PhD thesis). Researchgate:273000973."},{"key":"5813_CR32","unstructured":"Peharz, R., Gens, R., Pernkopf, F., & Domingos, P.\u00a0M. (2016). On the latent variable interpretation in sum\u2013product networks. CoRR, arXiv:1601.06180 ."},{"key":"5813_CR33","unstructured":"Pletscher, P., Ong, C.\u00a0S., & Buhmann, J.\u00a0M. (2009). Spanning tree approximations for conditional random fields. In Dyk, D. A.\u00a0V., & Welling, M. (Eds.), AISTATS, volume\u00a05 of JMLR proceedings, pp. 408\u2013415. JMLR.org."},{"key":"5813_CR34","unstructured":"Poole, D.\u00a0L., & Zhang, N.\u00a0L. (2011). Exploiting contextual independence in probabilistic inference. CoRR, arXiv:1106.4864 ."},{"key":"5813_CR35","doi-asserted-by":"crossref","unstructured":"Poon, H., & Domingos, P. (2011). Sum\u2013product networks: A new deep architecture. In UAI 2011, Proceedings of the twenty-seventh conference on uncertainty in artificial intelligence, Barcelona, Spain, July 14\u201317, 2011, pp. 337\u2013346.","DOI":"10.1109\/ICCVW.2011.6130310"},{"key":"5813_CR36","unstructured":"Rahman, T.m & Gogate, V. (2016a). Learning ensembles of cutset networks. In Proceedings of the thirtieth AAAI conference on artificial intelligence, February 12\u201317, 2016, Phoenix, AZ, USA, pp. 3301\u20133307."},{"key":"5813_CR37","unstructured":"Rahman, T., & Gogate, V. (2016b). Merging strategies for sum\u2013product networks: From trees to graphs. In Proceedings of the thirty-second conference on uncertainty in artificial intelligence, UAI 2016, June 25\u201329, 2016, New York City, NY, USA."},{"key":"5813_CR38","doi-asserted-by":"crossref","unstructured":"Rahman, T., Kothalkar, P., & Gogate, V. (2014). Cutset networks: A simple, tractable, and scalable approach for improving the accuracy of Chow\u2013Liu trees. In Machine learning and knowledge discovery in databases\u2014European conference, ECML PKDD 2014, Nancy, France, September 15\u201319, 2014. Proceedings, Part II, pp. 630\u2013645.","DOI":"10.1007\/978-3-662-44851-9_40"},{"key":"5813_CR39","unstructured":"Rooshenas, A., & Lowd, D. (2014). Learning sum\u2013product networks with direct and indirect variable interactions. In Jebara, T., & Xing, E.\u00a0P., (Eds.), Proceedings of the 31st international conference on machine learning (ICML-14). JMLR workshop and conference proceedings, pp. 710\u2013718."},{"key":"5813_CR40","doi-asserted-by":"crossref","unstructured":"Vergari, A., Mauro, N.\u00a0D., & Esposito, F. (2015). Simplifying, regularizing and strengthening sum\u2013product network structure learning. In Proceedings of the 2015th European conference on machine learning and knowledge discovery in databases\u2014Volume Part II, ECMLPKDD\u201915, Switzerland. Springer, pp. 343\u2013358.","DOI":"10.1007\/978-3-319-23525-7_21"},{"issue":"1\u20132","key":"5813_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000001","volume":"1","author":"MJ Wainwright","year":"2008","unstructured":"Wainwright, M. J., & Jordan, M. I. (2008). Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning, 1(1\u20132), 1\u2013305.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"5813_CR42","unstructured":"Zhao, H., Melibari, M., & Poupart, P. (2015). On the relationship between sum\u2013product networks and Bayesian networks. CoRR, arXiv:1501.01239 ."},{"key":"5813_CR43","unstructured":"Zhao, H., Poupart, P., & Gordon, G. (2016). A unified approach for learning the parameters of sum\u2013product networks. In Proceedings of the 29th advances in neural information processing systems (NIPS 2016)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05813-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-019-05813-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05813-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T04:46:59Z","timestamp":1663822019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-019-05813-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,27]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["5813"],"URL":"https:\/\/doi.org\/10.1007\/s10994-019-05813-2","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2019,6,27]]},"assertion":[{"value":"19 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}