Importance sampling algorithms for the propagation of probabilities in belief networks
From MaRDI portal
Publication:1125700
DOI10.1016/0888-613X(96)00013-8zbMath0949.68579MaRDI QIDQ1125700
Serafín Moral, Jose E. Cano, Luis D. Hernández
Publication date: 4 January 2000
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
68W05: Nonnumerical algorithms
68T35: Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence
Related Items
Importance sampling in Bayesian networks using probability trees., A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques, Uncertainty analysis for rolling contact fatigue failure probability of silicon nitride ball bearings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Evidential reasoning using stochastic simulation of causal models
- Probability propagation
- The computational complexity of probabilistic inference using Bayesian belief networks
- Probabilistic Inference and Influence Diagrams
- An Accurate Approximation to the Sampling Distribution of the Studentized Extreme Value Statistic