Evaluation of Bayesian networks with flexible state-space abstraction methods
From MaRDI portal
(Redirected from Publication:1603306)
Recommendations
Cites work
- An algebra of bayesian belief universes for knowledge‐based systems
- An optimal approximation algorithm for Bayesian inference
- Approximating MAPs for belief networks is NP-hard and other theorems
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Deliberation scheduling for problem solving in time-constrained environments
- Evidential reasoning using stochastic simulation of causal models
- Finding MAPs for belief networks is NP-hard
- scientific article; zbMATH DE number 4060768 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 1222282 (Why is no real title available?)
- scientific article; zbMATH DE number 1149408 (Why is no real title available?)
- scientific article; zbMATH DE number 1149419 (Why is no real title available?)
- scientific article; zbMATH DE number 1149441 (Why is no real title available?)
- Local conditioning in Bayesian networks
- On Information and Sufficiency
- On linear potential functions for approximating Bayesian computations
- On the hardness of approximate reasoning
- Probabilistic Inference and Influence Diagrams
- Probabilistic inference in multiply connected belief networks using loop cutsets
- The computational complexity of probabilistic inference using Bayesian belief networks
Cited in
(3)
This page was built for publication: Evaluation of Bayesian networks with flexible state-space abstraction methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603306)