Novel strategies to approximate probability trees in penniless propagation

DOI10.1002/int.10083zbMath1028.68163OpenAlexW2151325927WikidataQ57551201 ScholiaQ57551201MaRDI QIDQ4416286

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

Publication date: 31 July 2003

Published in: International Journal of Intelligent Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/int.10083

zbMATH Keywords

Penniless propagation algorithm

Mathematics Subject Classification ID

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

Related Items (3)

A review on evolutionary algorithms in Bayesian network learning and inference tasks ⋮ Dynamic importance sampling in Bayesian networks based on probability trees ⋮ Approximate probability propagation with mixtures of truncated exponentials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Importance sampling in Bayesian networks using probability trees.
• Binary join trees for computing marginals in the Shenoy-Shafer architecture
• Lazy propagation: A junction tree inference algorithm based on lazy evaluation
• Lazy evaluation in penniless propagation over join trees
• On Information and Sufficiency

This page was built for publication: Novel strategies to approximate probability trees in penniless propagation