Updating credal networks is approximable in polynomial time

DOI10.1016/J.IJAR.2012.06.014MaRDI QIDQ2375322zbMATH OpenOpenAlexDBLPWikidataFDO

Authors D. D. Maua, M. Zaffalon, C. P. De Campos

Publication date 13 June 2013

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2012.06.014

zbMATH Keywords

approximation schemecredal networksprobabilistic graphical modelsvaluation algebra

Mathematics Subject Classification ID

Multivariate analysis and fuzziness (62H86) Reasoning under uncertainty in the context of artificial intelligence (68T37) Approximation algorithms (68W25)

Recommendations

• Approximate credal network updating by linear programming with applications to decision making
• Approximating credal network inferences by linear programming
• Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
• Thirty years of credal networks: specification, algorithms and complexity
• Approximate algorithms for credal networks with binary variables

Cites work

• 2U: an exact interval propagation algorithm for polytrees with binary variables
• Computing the Minimum Fill-In is NP-Complete
• Credal networks
• Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks
• Enabling local computation for partially ordered preferences
• Epistemic irrelevance in credal nets: the case of imprecise Markov trees
• 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 48344 (Why is no real title available?)
• scientific article; zbMATH DE number 1945067 (Why is no real title available?)
• Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
• On the Average Number of Maxima in a Set of Vectors and Applications
• Ordered valuation algebras: A generic framework for approximating inference
• Safe reduction rules for weighted treewidth
• Semiring induced valuation algebras: exact and approximate local computation algorithms

Cited in

(12)

• Robustifying sum-product networks
• Compatibility, desirability, and the running intersection property
• An axiomatic framework for influence diagram computation with partially ordered preferences
• Thirty years of credal networks: specification, algorithms and complexity
• Approximate credal network updating by linear programming with applications to decision making
• scientific article; zbMATH DE number 5117149 (Why is no real title available?)
• scientific article; zbMATH DE number 2014741 (Why is no real title available?)
• Exploiting Bayesian network sensitivity functions for inference in credal networks
• Approximating credal network inferences by linear programming
• Beyond tree-shaped credal probabilistic circuits
• Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
• Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams

This page was built for publication: Updating credal networks is approximable in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375322)