Hybrid algorithms for approximate belief updating in Bayes nets
From MaRDI portal
Publication:1809372
Recommendations
Cites work
- scientific article; zbMATH DE number 4060768 (Why is no real title available?)
- scientific article; zbMATH DE number 43238 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Exploiting case-based independence for approximating marginal probabilities
- Finding MAPs for belief networks is NP-hard
- Probabilistic Horn abduction and Bayesian networks
- The computational complexity of probabilistic inference using Bayesian belief networks
- The role of relevance in explanation. I: Irrelevance as statistical independence
Cited in
(9)- DIRECTING GENETIC ALGORITHMS FOR PROBABILISTIC REASONING THROUGH REINFORCEMENT LEARNING
- Dynamic importance sampling in Bayesian networks based on probability trees
- Bayes networks for estimating the number of solutions of constraint networks
- Approximate probability propagation with mixtures of truncated exponentials
- scientific article; zbMATH DE number 5117149 (Why is no real title available?)
- A framework for building knowledge-bases under uncertainty
- Estimating mixtures of truncated exponentials in hybrid Bayesian networks
- Approximate credal network updating by linear programming with applications to decision making
- Lazy evaluation in penniless propagation over join trees
This page was built for publication: Hybrid algorithms for approximate belief updating in Bayes nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809372)