{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T23:35:58Z","timestamp":1772321758968,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"8-10","license":[{"start":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T00:00:00Z","timestamp":1525651200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Swiss NSF","award":["200021 146606 \/1"],"award-info":[{"award-number":["200021 146606 \/1"]}]},{"name":"Swiss NSF","award":["IZKSZ2 162188"],"award-info":[{"award-number":["IZKSZ2 162188"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10994-018-5701-9","type":"journal-article","created":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T20:00:12Z","timestamp":1525723212000},"page":"1209-1227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Approximate structure learning for large Bayesian networks"],"prefix":"10.1007","volume":"107","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4460-591X","authenticated-orcid":false,"given":"Mauro","family":"Scanagatta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Corani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cassio Polpo","family":"de\u00a0Campos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Zaffalon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,7]]},"reference":[{"key":"5701_CR1","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.artint.2015.03.003","volume":"244","author":"M Bartlett","year":"2017","unstructured":"Bartlett, M., & Cussens, J. (2017). Integer linear programming for the Bayesian network structure learning problem. Artificial Intelligence, 244, 258\u2013271.","journal-title":"Artificial Intelligence"},{"key":"5701_CR2","unstructured":"Berg, J., J\u00e4rvisalo, M., & Malone, B. (2014). Learning optimal bounded treewidth Bayesian networks via maximum satisfiability. In Proceedings of the 17th international conference on artificial intelligence and statistics (pp. 86\u201395)."},{"key":"5701_CR3","unstructured":"Bodlaender, H.\u00a0L., Koster, A. M. C.\u00a0A., van\u00a0den Eijkhof, F., & van\u00a0der Gaag, L.\u00a0C. (2001). Pre-processing for triangulation of probabilistic networks. In Proceedings of the 17th conference on uncertainty in artificial intelligence (pp. 32\u201339)."},{"key":"5701_CR4","first-page":"1287","volume":"5","author":"DM Chickering","year":"2014","unstructured":"Chickering, D. M., Heckerman, D., & Meek, C. (2014). Large-sample learning of Bayesian networks is NP-hard. Journal of Machine Learning Research, 5, 1287\u20131330.","journal-title":"Journal of Machine Learning Research"},{"key":"5701_CR5","first-page":"309","volume":"9","author":"GF Cooper","year":"1992","unstructured":"Cooper, G. F., & Herskovits, E. (1992). A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9, 309\u2013347.","journal-title":"Machine Learning"},{"key":"5701_CR6","unstructured":"Cussens, J. (2011). Bayesian network learning with cutting planes. In Proceedings of the 27th conference on uncertainty in artificial intelligence (pp. 153\u2013160)."},{"key":"5701_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1613\/jair.5203","volume":"58","author":"J Cussens","year":"2017","unstructured":"Cussens, J., J\u00e4rvisalo, M., Korhonen, J. H., & Bartlett, M. (2017). Bayesian network structure learning with integer programming: Polytopes, facets and complexity. Journal of Artificial Intelligence Research, 58, 185\u2013229.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5701_CR8","unstructured":"Cussens, J., Malone, B., & Yuan, C. (2013). IJCAI 2013 tutorial on optimal algorithms for learning Bayesian networks. https:\/\/sites.google.com\/site\/ijcai2013bns\/slides . Accessed Jan 2017."},{"key":"5701_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811357","volume-title":"Modeling and reasoning with Bayesian networks","author":"A Darwiche","year":"2009","unstructured":"Darwiche, A. (2009). Modeling and reasoning with Bayesian networks. Cambridge: Cambridge University Press."},{"key":"5701_CR10","first-page":"663","volume":"12","author":"CP Campos de","year":"2011","unstructured":"de Campos, C. P., & Ji, Q. (2011). Efficient structure learning of Bayesian networks using constraints. Journal of Machine Learning Research, 12, 663\u2013689.","journal-title":"Journal of Machine Learning Research"},{"key":"5701_CR11","doi-asserted-by":"crossref","unstructured":"de\u00a0Campos, C.\u00a0P., Zeng, Z., & Ji, Q. (2009). Structure learning of Bayesian networks using constraints. In Proceedings of the 26th international conference on machine learning (pp. 113\u2013120).","DOI":"10.1145\/1553374.1553389"},{"key":"5701_CR12","first-page":"2699","volume":"9","author":"G Elidan","year":"2008","unstructured":"Elidan, G., & Gould, S. (2008). Learning bounded treewidth Bayesian networks. Journal of Machine Learning Research, 9, 2699\u20132731.","journal-title":"Journal of Machine Learning Research"},{"key":"5701_CR13","unstructured":"Jaakkola, T., Sontag, D., Globerson, A., & Meila, M. (2010). Learning Bayesian network structure using LP relaxations. In Proceedings of the 13th international conference on artificial intelligence and statistics (pp. 358\u2013365)."},{"key":"5701_CR14","first-page":"549","volume":"5","author":"M Koivisto","year":"2004","unstructured":"Koivisto, M., & Sood, K. (2004). Exact Bayesian structure discovery in Bayesian networks. Journal of Machine Learning Research, 5, 549\u2013573.","journal-title":"Journal of Machine Learning Research"},{"key":"5701_CR15","unstructured":"Korhonen, J., & Parviainen, P. (2013). Exact learning of bounded treewidth Bayesian networks. In Proceedings of the 16th international conference on artificial intelligence and statistics (pp. 370\u2013378)."},{"issue":"15","key":"5701_CR16","first-page":"1","volume":"13","author":"Z Liu","year":"2012","unstructured":"Liu, Z., Malone, B., & Yuan, C. (2012). Empirical evaluation of scoring functions for Bayesian network model selection. BMC Bioinformatics, 13(15), 1\u201316.","journal-title":"BMC Bioinformatics"},{"key":"5701_CR17","unstructured":"Lowd, D., & Domingos, P. (2008). Learning arithmetic circuits. In Proceedings of the 24th conference on uncertainty in artificial intelligence (pp. 383\u2013392)."},{"key":"5701_CR18","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1613\/jair.2842","volume":"37","author":"R Mateescu","year":"2010","unstructured":"Mateescu, R., Kask, K., Gogate, V., & Dechter, R. (2010). Join-graph propagation algorithms. Journal of Artificial Intelligence Research, 37, 279\u2013328.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5701_CR19","doi-asserted-by":"crossref","unstructured":"Nie, S., de\u00a0Campos, C.\u00a0P., & Ji, Q. (2015). Learning bounded treewidth Bayesian networks via sampling. In Proceedings of the 13th European conference on symbolic and quantitative approaches to reasoning with uncertainty (pp. 387\u2013396).","DOI":"10.1007\/978-3-319-20807-7_35"},{"key":"5701_CR20","doi-asserted-by":"crossref","unstructured":"Nie, S., de\u00a0Campos, C.\u00a0P., & Ji, Q. (2016). Learning Bayesian networks with bounded treewidth via guided search. In Proceedings of the 30th AAAI conference on artificial intelligence (pp. 3294\u20133300).","DOI":"10.1609\/aaai.v30i1.10418"},{"key":"5701_CR21","first-page":"2285","volume":"27","author":"S Nie","year":"2014","unstructured":"Nie, S., Mau\u00e1, D. D., de Campos, C. P., & Ji, Q. (2014). Advances in learning Bayesian networks of bounded treewidth. Advances in Neural Information Processing Systems, 27, 2285\u20132293.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"5701_CR22","unstructured":"Parviainen, P., Farahani, H.\u00a0S., & Lagergren, J. (2014). Learning bounded treewidth Bayesian networks using integer linear programming. In Proceedings of the 17th international conference on artificial intelligence and statistics (pp. 751\u2013759)."},{"issue":"2\u20134","key":"5701_CR23","first-page":"57","volume":"11","author":"HP Patil","year":"1986","unstructured":"Patil, H. P. (1986). On the structure of k-trees. Journal of Combinatorics, Information and System Sciences, 11(2\u20134), 57\u201364.","journal-title":"Journal of Combinatorics, Information and System Sciences"},{"key":"5701_CR24","doi-asserted-by":"crossref","unstructured":"Poon, H., & Domingos, P. (2011). Sum-product networks: A new deep architecture. In Proceedings of the 27th conference on uncertainty in artificial intelligence (pp. 689\u2013690).","DOI":"10.1109\/ICCVW.2011.6130310"},{"key":"5701_CR25","doi-asserted-by":"publisher","first-page":"111","DOI":"10.2307\/271063","volume":"25","author":"AE Raftery","year":"1995","unstructured":"Raftery, A. E. (1995). Bayesian model selection in social research. Sociological Methodology, 25, 111\u2013164.","journal-title":"Sociological Methodology"},{"key":"5701_CR26","unstructured":"Rooshenas, A., & Lowd, D. (2014). Learning sum-product networks with direct and indirect variable interactions. In Proceedings of the 31st international conference on machine learning (pp. 710\u2013718)."},{"key":"5701_CR27","first-page":"1462","volume":"29","author":"M Scanagatta","year":"2016","unstructured":"Scanagatta, M., Corani, G., de Campos, C. P., & Zaffalon, M. (2016). Learning treewidth-bounded Bayesian networks with thousands of variables. Advances in Neural Information Processing Systems, 29, 1462\u20131470.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"5701_CR28","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.ijar.2018.02.004","volume":"95","author":"M Scanagatta","year":"2018","unstructured":"Scanagatta, M., Corani, G., Zaffalon, M., Yoo, J., & Kang, U. (2018). Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets. International Journal of Approximate Reasoning, 95, 152\u2013166.","journal-title":"International Journal of Approximate Reasoning"},{"key":"5701_CR29","first-page":"1855","volume":"28","author":"M Scanagatta","year":"2015","unstructured":"Scanagatta, M., de Campos, C. P., Corani, G., & Zaffalon, M. (2015). Learning Bayesian networks with thousands of variables. Advances in Neural Information Processing Systems, 28, 1855\u20131863.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"5701_CR30","unstructured":"Silander, T., & Myllymaki, P. A. (2006). A simple approach for finding the globally optimal Bayesian network structure. In Proceedings of the 22nd conference on uncertainty in artificial intelligence (pp. 445\u2013452)."},{"key":"5701_CR31","unstructured":"Teyssier, M., & Koller, D. (2005). Ordering-based search: A simple and effective algorithm for learning Bayesian networks. In Proceedings of the 21st conference on uncertainty in artificial intelligence (pp. 584\u2013590)."},{"key":"5701_CR32","unstructured":"Yuan, C., & Malone, B. (2012). An improved admissible heuristic for learning optimal Bayesian networks. In Proceedings of the 28th conference on uncertainty in artificial intelligence (pp. 924\u2013933)."},{"key":"5701_CR33","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1613\/jair.4039","volume":"48","author":"C Yuan","year":"2013","unstructured":"Yuan, C., & Malone, B. (2013). Learning optimal Bayesian networks: A shortest path perspective. Journal of Artificial Intelligence Research, 48, 23\u201365.","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-018-5701-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5701-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5701-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T16:07:18Z","timestamp":1661184438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-018-5701-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,7]]},"references-count":33,"journal-issue":{"issue":"8-10","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["5701"],"URL":"https:\/\/doi.org\/10.1007\/s10994-018-5701-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,7]]},"assertion":[{"value":"5 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}