Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian Networks

Understand

One of the basic tasks for Bayesian networks (BNs) is that of learning a network structure from data.

• The BN-learning problem is NP-hard, so the standard solution is heuristic search.
• Many approaches have been proposed for this task, but only a very small number outperform the baseline of greedy hill-climbing with tabu lists; moreover, many of the proposed algorithms are quite complex and hard to implement.
• In this paper, we propose a very simple and easy-to-implement method for addressing this task.