Efficient inference in Bayes networks as a combinatorial optimization problem

DOI10.1016/0888-613X(94)90019-1zbMath0808.68098MaRDI QIDQ1332727

Bruce D'Ambrosio, Zhao-Yu Li

Publication date: 5 September 1994

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

zbMATH Keywords

probabilistic inferenceBayesian belief networksexact algorithmsoptimal factoring

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Knowledge representation (68T30)

Related Items

Using probability trees to compute marginals with imprecise probabilities, Approximate algorithms for credal networks with binary variables, A logical notion of conditional independence: properties and applications, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, Comparison of multiagent inference methods in multiply sectioned Bayesian networks., Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering, Operating with potentials of discrete variables, Recursive conditioning, Anytime anyspace probabilistic inference, Understanding the scalability of Bayesian network inference using clique tree growth curves, Improvements to variable elimination and symbolic probabilistic inference for evaluating influence diagrams, A simple graphical approach for understanding probabilistic inference in Bayesian networks, Inference in belief networks: A procedural guide, Local expression languages for probabilistic dependence, Lazy evaluation in penniless propagation over join trees

Cites Work

• Fusion and propagation with multiple observations in belief networks
• Probabilistic Inference and Influence Diagrams
• An algebra of bayesian belief universes for knowledge‐based systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item