Topics
Integer programmingSoftware
The problem of learning the structure ofBayesian networks from complete discretedata with a limit on parent set size is consid-ered. Learning is cast explicitly as an optimi-sation problem where the goal is to find a BNstructure which maximises log marginal like-lihood (BDe score). Integer programming,specifically the SCIP framework, is used tosolve this optimisation problem. Acyclic-ity constraints are added to the integer pro-gram (IP) during solving in the form of cut-ting planes. Finding good cutting planes isthe key to the success of the approach—thesearch for such cutting planes is effected usinga sub-IP. Results show that this is a particu-larly fast method for exact BN learning
Learning Bayesian networks is often cast as an optimization problem, where the computational task is...
\u3cp\u3eWe present a method for learning Bayesian networks from data sets containing thousands of v...
Learning Bayesian network (BN) structure from data is a typical NP-hard problem. But almost existing...
The problem of learning the structure ofBayesian networks from complete discretedata with a limit on...
We consider the problem of learning Bayesiannetworks (BNs) from complete discrete data.This problem ...
The challenging task of learning structures of probabilistic graphical models is an important proble...
A way of implementing domain-specific cutting planes in branch-and-cut based Mixed-Integer Programmi...
Bayesian networks are a commonly used method of representing conditional probability relationships b...
Bayesian networks are a commonly used method of representing conditional probability relationships b...
The challenging task of learning structures of probabilistic graphical models is an important proble...
AbstractIn this paper, designing a Bayesian network structure to maximize a score function based on ...
It is well known in the literature that the problem of learning the structure of Bayesian networks i...
In many applications one wants to compute conditional probabilities given a Bayesian network. This i...
Bayesian networks are a widely used graphical model which formalize reasoning under uncertainty. Unf...
\u3cp\u3eThis paper addresses the problem of learning Bayesian network structures from data based on...
Learning Bayesian networks is often cast as an optimization problem, where the computational task is...
\u3cp\u3eWe present a method for learning Bayesian networks from data sets containing thousands of v...
Learning Bayesian network (BN) structure from data is a typical NP-hard problem. But almost existing...
The problem of learning the structure ofBayesian networks from complete discretedata with a limit on...
We consider the problem of learning Bayesiannetworks (BNs) from complete discrete data.This problem ...
The challenging task of learning structures of probabilistic graphical models is an important proble...
A way of implementing domain-specific cutting planes in branch-and-cut based Mixed-Integer Programmi...
Bayesian networks are a commonly used method of representing conditional probability relationships b...
Bayesian networks are a commonly used method of representing conditional probability relationships b...
The challenging task of learning structures of probabilistic graphical models is an important proble...
AbstractIn this paper, designing a Bayesian network structure to maximize a score function based on ...
It is well known in the literature that the problem of learning the structure of Bayesian networks i...
In many applications one wants to compute conditional probabilities given a Bayesian network. This i...
Bayesian networks are a widely used graphical model which formalize reasoning under uncertainty. Unf...
\u3cp\u3eThis paper addresses the problem of learning Bayesian network structures from data based on...
Learning Bayesian networks is often cast as an optimization problem, where the computational task is...
\u3cp\u3eWe present a method for learning Bayesian networks from data sets containing thousands of v...
Learning Bayesian network (BN) structure from data is a typical NP-hard problem. But almost existing...
Add to ORKG