2U: an exact interval propagation algorithm for polytrees with binary variables
From MaRDI portal
Publication:1275598
DOI10.1016/S0004-3702(98)00089-7zbMath0909.68083MaRDI QIDQ1275598
Marco Zaffalon, Enrico Fagiuoli
Publication date: 12 January 1999
Published in: Artificial Intelligence (Search for Journal in Brave)
Related Items (22)
Updating credal networks is approximable in polynomial time ⋮ Approximate algorithms for credal networks with binary variables ⋮ Graphical models for imprecise probabilities ⋮ Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm ⋮ Handling epistemic and aleatory uncertainties in probabilistic circuits ⋮ Credal networks under epistemic irrelevance ⋮ Roughian: Rough information analysis ⋮ Computing lower and upper expectations under epistemic independence ⋮ Sets of probability distributions, independence, and convexity ⋮ Epistemic irrelevance in credal nets: the case of imprecise Markov trees ⋮ Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ Efficient belief propagation in second-order Bayesian networks for singly-connected graphs ⋮ On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables ⋮ On the complexity of propositional and relational credal networks ⋮ Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks ⋮ Robust Bayes classifiers ⋮ Unifying parameter learning and modelling complex systems with epistemic uncertainty using probability interval ⋮ Credal networks ⋮ Computing posterior upper expectations ⋮ Updating beliefs with incomplete observations ⋮ Quasi-Bayesian analysis using imprecise probability assessments and the generalized Bayes' rule
Cites Work
This page was built for publication: 2U: an exact interval propagation algorithm for polytrees with binary variables
