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
Robust Bayes classifiers, Epistemic irrelevance in credal nets: the case of imprecise Markov trees, Updating beliefs with incomplete observations, Quasi-Bayesian analysis using imprecise probability assessments and the generalized Bayes' rule, Computing lower and upper expectations under epistemic independence, Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks, Credal networks, Computing posterior upper expectations, 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, Unnamed Item
Cites Work