Approximate algorithms for credal networks with binary variables

Jaime Shinsuke Ide, Fabio Gagliardi Cozman

Research output: Contribution to journalArticlepeer-review

15 Scopus citations


This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can represent incomplete or vague beliefs, lack of data, and disagreements among experts; they can also encode models based on belief functions and possibilistic measures. All algorithms for approximate inference in this paper rely on exact inferences in credal networks based on polytrees with binary variables, as these inferences have polynomial complexity. We are inspired by approximate algorithms for Bayesian networks; thus the Loopy 2U algorithm resembles Loopy Belief Propagation, while the Iterated Partial Evaluation and Structured Variational 2U algorithms are, respectively, based on Localized Partial Evaluation and variational techniques. © 2007 Elsevier Inc. All rights reserved.
Original languageAmerican English
Pages (from-to)275-296
Number of pages22
JournalInternational Journal of Approximate Reasoning
StatePublished - 1 Apr 2008
Externally publishedYes


Dive into the research topics of 'Approximate algorithms for credal networks with binary variables'. Together they form a unique fingerprint.

Cite this