Hybrid algorithms for approximate belief updating in Bayes nets
DOI10.1016/S0888-613X(97)00012-1zbMATH Open0939.68119WikidataQ57518796 ScholiaQ57518796MaRDI QIDQ1809372FDOQ1809372
Authors: Yanyan Li 
Publication date: 20 December 1999
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Recommendations
Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Finding MAPs for belief networks is NP-hard
- Probabilistic Horn abduction and Bayesian networks
- The computational complexity of probabilistic inference using Bayesian belief networks
- Title not available (Why is that?)
- Exploiting case-based independence for approximating marginal probabilities
- The role of relevance in explanation. I: Irrelevance as statistical independence
Cited In (9)
- Title not available (Why is that?)
- Dynamic importance sampling in Bayesian networks based on probability trees
- Bayes networks for estimating the number of solutions of constraint networks
- A framework for building knowledge-bases under uncertainty
- Lazy evaluation in penniless propagation over join trees
- Approximate credal network updating by linear programming with applications to decision making
- Estimating mixtures of truncated exponentials in hybrid Bayesian networks
- DIRECTING GENETIC ALGORITHMS FOR PROBABILISTIC REASONING THROUGH REINFORCEMENT LEARNING
- Approximate probability propagation with mixtures of truncated exponentials
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)
