Mixing exact and importance sampling propagation algorithms in dependence graphs

DOI10.1002/(SICI)1098-111X(199708)12:8%3C553::AID-INT1%3E3.0.CO;2-JMaRDI QIDQ4363345zbMATH OpenOpenAlexFDO

Authors Luis D. Hernández, Serafin Moral

Publication date 26 February 1998

Full work available at URL https://doi.org/10.1002/(sici)1098-111x(199708)12:8%3C553::aid-int1%3E3.0.co;2-j

zbMATH Keywords

junction tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Parallel algorithms in computer science (68W10)

Recommendations

• Importance sampling in Bayesian networks using probability trees.
• Importance sampling algorithms for the propagation of probabilities in belief networks
• A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques
• Dynamic importance sampling in Bayesian networks based on probability trees
• scientific article; zbMATH DE number 1553119

Cited in

(4)

• Imprecise Monte Carlo simulation and iterative importance sampling for the estimation of lower previsions
• Importance sampling in Bayesian networks using probability trees.
• Importance sampling-based estimation over AND/OR search spaces for graphical models
• A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques

This page was built for publication: Mixing exact and importance sampling propagation algorithms in dependence graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4363345)