Lazy evaluation in penniless propagation over join trees

DOI10.1002/net.10024zbMath1014.68161OpenAlexW2083973047WikidataQ57551203 ScholiaQ57551203MaRDI QIDQ3150127

Andrés Cano, Antonio Salmerón, Serafín Moral

Publication date: 29 September 2002

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10024

zbMATH Keywords

Bayesian networkslazy evaluationjoin treespenniless propagation

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items

New strategies for finding multiplicative decompositions of probability trees ⋮ FAST FACTORISATION OF PROBABILISTIC POTENTIALS AND ITS APPLICATION TO APPROXIMATE INFERENCE IN BAYESIAN NETWORKS ⋮ Bayesian network inference using marginal trees ⋮ Dynamic importance sampling in Bayesian networks based on probability trees ⋮ Novel strategies to approximate probability trees in penniless propagation ⋮ Join tree propagation with prioritized messages ⋮ Approximate probability propagation with mixtures of truncated exponentials ⋮ Decomposition of influence diagrams

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient inference in Bayes networks as a combinatorial optimization problem
• An optimal approximation algorithm for Bayesian inference
• Importance sampling in Bayesian networks using probability trees.
• Hybrid algorithms for approximate belief updating in Bayes nets
• Binary join trees for computing marginals in the Shenoy-Shafer architecture
• A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques
• Lazy propagation: A junction tree inference algorithm based on lazy evaluation
• On Information and Sufficiency

This page was built for publication: Lazy evaluation in penniless propagation over join trees