Proceedings

Learning Optimal Bayesian Networks Using A* Search

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 2186-2190.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-364

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.

Changhe Yuan, Brandon M. Malone, and Xiaojian Wu. 2011. Learning Optimal Bayesian Networks Using A* Search. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 2186–2190. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-364
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards