32 citations · 59 across the 5 of their papers we have counts for
Showing 2012 · cs.AIShow all
2 papers · 2 filters
cs.AI2012★ 32 cited
An Improved Admissible Heuristic for Learning Optimal Bayesian Networks
Changhe Yuan, Brandon Malone
Recently two search algorithms, A* and breadth-first branch and bound (BFBnB), were developed based on a simple admissible heuristic for learning Bayesian network structures that o…
cs.AI2012★ 9 cited
Improving the Scalability of Optimal Bayesian Network Learning with External-Memory Frontier Breadth-First Branch and Bound Search
Brandon Malone, Changhe Yuan, Eric A. Hansen +1
Previous work has shown that the problem of learning the optimal structure of a Bayesian network can be formulated as a shortest path finding problem in a graph and solved using A*…