Approximate algorithms for credal networks with binary variables
From MaRDI portal
Publication:2379306
Recommendations
- Approximating credal network inferences by linear programming
- Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
- Approximation algorithms for restricted Bayesian network structures
- Probabilistic inference in credal networks: new complexity results
- A randomized approximation algorithm for probabilistic inference on bayesian belief networks
- Approximate inference in Bayesian networks: parameterized complexity results
- Approximate credal network updating by linear programming with applications to decision making
- Approximate inference in Bayesian networks using binary probability trees
Cites work
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
- An axiomatic framework for propagating uncertainty in directed acyclic networks
- An introduction to variational methods for graphical models
- Anytime anyspace probabilistic inference
- Coherent numerical and ordinal probabilistic assessments
- Correctness of belief propagation in Gaussian graphical models of arbitrary topology
- Credal networks
- Efficient inference in Bayes networks as a combinatorial optimization problem
- Graphical models for imprecise probabilities
- Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
- scientific article; zbMATH DE number 5117149 (Why is no real title available?)
- scientific article; zbMATH DE number 4060768 (Why is no real title available?)
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 1222282 (Why is no real title available?)
- scientific article; zbMATH DE number 1095142 (Why is no real title available?)
- scientific article; zbMATH DE number 1149420 (Why is no real title available?)
- scientific article; zbMATH DE number 2046116 (Why is no real title available?)
- scientific article; zbMATH DE number 840151 (Why is no real title available?)
- scientific article; zbMATH DE number 4189220 (Why is no real title available?)
- Identifying independence in bayesian networks
- Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
- Interval probability propagation
- Measures of uncertainty in expert systems
- On the hardness of approximate reasoning
- Probabilistic logic
- Probabilistic Networks and Expert Systems
- Recursive conditioning
- Stochastic independence in a coherent setting
- Using kappas as indicators of strength in qualitative probabilistic networks
- Using probability trees to compute marginals with imprecise probabilities
Cited in
(9)- Thirty years of credal networks: specification, algorithms and complexity
- Unifying parameter learning and modelling complex systems with epistemic uncertainty using probability interval
- Approximate credal network updating by linear programming with applications to decision making
- Updating credal networks is approximable in polynomial time
- Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
- Approximating credal network inferences by linear programming
- A comparison of evidential networks and compositional models
- Divergence measures and approximate algorithms for valuation based systems
- Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
This page was built for publication: Approximate algorithms for credal networks with binary variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379306)
