Lower Bound Bayesian Networks - An Efficient Inference of Lower Bounds on Probability Distributions in Bayesian Networks
Daniel AndradeBernhard SickPublished in: CoRR (2012)
Keyphrases
- bayesian networks
- lower bound
- probability distribution
- upper bound
- random variables
- branch and bound algorithm
- probabilistic inference
- branch and bound
- exact inference
- probabilistic reasoning
- inference in bayesian networks
- bayesian network inference
- np hard
- optimal solution
- lower and upper bounds
- conditional independence
- structure learning
- multiply sectioned bayesian networks
- belief networks
- graphical models
- conditional probabilities
- worst case
- quadratic assignment problem
- probabilistic model
- lower bounding
- objective function
- optimal cost
- parameter learning
- upper and lower bounds
- dynamic bayesian networks
- linear programming relaxation
- randomly generated problems
- variable elimination
- hidden variables
- lagrangian relaxation
- vc dimension
- knapsack problem
- sufficiently accurate
- approximate inference