{"type":"ScholarlyArticle","title":"Learning Optimal Bayesian Networks Using A* Search","authors":[{"name":"Changhe Yuan","slug":"changhe-yuan","given":"Changhe","family":"Yuan","affiliation":""},{"name":"Brandon M. Malone","slug":"brandon-m-malone","given":"Brandon M.","family":"Malone","affiliation":""},{"name":"XiaoJian Wu","slug":"xiaojian-wu","given":"Xiaojian","family":"Wu","affiliation":""}],"abstract":"This paper formulates learning optimal Bayesian network as a shortest path finding problem. An A* search algorithm is introduced to solve the problem. With the guidance of a consistent heuristic, the algorithm learns an optimal Bayesian networkby only searching the most promising parts of the solution space. Empirical results show that the A*search algorithm significantly improves the time and space efficiency of existing methods on a set of benchmark datasets.","doi":"10.5591/978-1-57735-516-8/IJCAI11-364","url":"https://ijcai.org/proceedings/2011/364","pdf":"https://ijcai.org/proceedings/2011/0364.pdf","markdown":"https://ijcai.org/proceedings/2011/364.md","bibtex":"https://ijcai.org/proceedings/2011/bibtex/364","volume":{"slug":"2011","title":"Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2011","url":"https://ijcai.org/proceedings/2011/","year":2011,"location":"Barcelona, Catalonia, Spain","dates":"16–22 July 2011","editors":"Toby Walsh","isbn":"978-1-57735-512-0; 978-1-57735-513-7; 978-1-57735-514-4; 978-1-57735-515-1; 978-1-57735-516-8","publisher":"AAAI Press/International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":364,"pages":{"first":2186,"last":2190},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}