AAAI Publications, Twenty-Second International Joint Conference on Artificial Intelligence

Font Size: 
Learning Optimal Bayesian Networks Using A* Search
Changhe Yuan, Brandon Malone, Xiaojian Wu

Last modified: 2011-06-28


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.

Full Text: PDF