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

07/04/2012
by   Marc Teyssier, et al.
0

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. Our approach is based on the well-known fact that the best network (of bounded in-degree) consistent with a given node ordering can be found very efficiently. We therefore propose a search not over the space of structures, but over the space of orderings, selecting for each ordering the best network consistent with it. This search space is much smaller, makes more global search steps, has a lower branching factor, and avoids costly acyclicity checks. We present results for this algorithm on both synthetic and real data sets, evaluating both the score of the network found and in the running time. We show that ordering-based search outperforms the standard baseline, and is competitive with recent algorithms that are much harder to implement.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2013

Learning Equivalence Classes of Bayesian Networks Structures

Approaches to learning Bayesian networks from data typically combine a s...
research
01/23/2013

Learning Bayesian Network Structure from Massive Datasets: The "Sparse Candidate" Algorithm

Learning Bayesian networks is often cast as an optimization problem, whe...
research
01/16/2013

A Branch-and-Bound Algorithm for MDL Learning Bayesian Networks

This paper extends the work in [Suzuki, 1996] and presents an efficient ...
research
11/24/2014

A Greedy, Flexible Algorithm to Learn an Optimal Bayesian Network Structure

In this report paper we first present a report of the Advanced Machine L...
research
07/18/2022

CausNet : Generational orderings based search for optimal Bayesian networks via dynamic programming with parent set constraints

Finding a globally optimal Bayesian Network using exhaustive search is a...
research
06/27/2012

Convex Structure Learning for Bayesian Networks: Polynomial Feature Selection and Approximate Ordering

We present a new approach to learning the structure and parameters of a ...
research
04/27/2017

A quantitative assessment of the effect of different algorithmic schemes to the task of learning the structure of Bayesian Networks

One of the most challenging tasks when adopting Bayesian Networks (BNs) ...

Please sign up or login with your details

Forgot password? Click here to reset