Approximate algorithms for credal networks with binary variables
From MaRDI portal
Publication:2379306
DOI10.1016/j.ijar.2007.09.003zbMath1184.68510WikidataQ57975691 ScholiaQ57975691MaRDI QIDQ2379306
Fabio Gagliardi Cozman, Jaime Shinsuke Ide
Publication date: 19 March 2010
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2007.09.003
68T37: Reasoning under uncertainty in the context of artificial intelligence
68W25: Approximation algorithms
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
- Probabilistic logic
- Interval probability propagation
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- Efficient inference in Bayes networks as a combinatorial optimization problem
- Using probability trees to compute marginals with imprecise probabilities
- Credal networks
- Stochastic independence in a coherent setting
- A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
- Anytime anyspace probabilistic inference
- An introduction to variational methods for graphical models
- Measures of uncertainty in expert systems
- An axiomatic framework for propagating uncertainty in directed acyclic networks
- Graphical models for imprecise probabilities
- Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
- On the hardness of approximate reasoning
- Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology
- Probabilistic Networks and Expert Systems
- Identifying independence in bayesian networks
- Coherent numerical and ordinal probabilistic assessments
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Recursive conditioning
