Novel strategies to approximate probability trees in penniless propagation
From MaRDI portal
Publication:4416286
DOI10.1002/int.10083zbMath1028.68163WikidataQ57551201 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
68T35: Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence
Related Items
Approximate probability propagation with mixtures of truncated exponentials, Dynamic importance sampling in Bayesian networks based on probability trees, A review on evolutionary algorithms in Bayesian network learning and inference tasks
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