Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
Advances in Bayesian Network Learning using Integer Programming
James Cussens, Mark Bartlett
We consider the problem of learning Bayesian networks (BNs) from complete discrete data. This problem of discrete optimisation is formulated as an integer program (IP). We describe the various steps we have taken to allow efficient solving of this IP. These are (i) efficient search for cutting planes, (ii) a fast greedy algorithm to find high-scoring (perhaps not optimal) BNs and (iii) tightening the linear relaxation of the IP. After relating this BN learning problem to set covering and the multidimensional 0-1 knapsack problem, we present our empirical results. These show improvements, sometimes dramatic, over earlier results.
Pages: 182-191
PS Link:
PDF Link: /papers/13/p182-cussens.pdf
AUTHOR = "James Cussens and Mark Bartlett",
TITLE = "Advances in Bayesian Network Learning using Integer Programming",
BOOKTITLE = "Proceedings of the Twenty-Ninth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-13)",
ADDRESS = "Corvallis, Oregon",
YEAR = "2013",
PAGES = "182--191"

hosted by DSL   •   site info   •   help