Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9651741 | International Journal of Approximate Reasoning | 2005 | 18 Pages |
Abstract
A credal network is a graphical representation for a set of joint probability distributions. In this paper we discuss algorithms for exact and approximate inferences in credal networks. We propose a branch-and-bound framework for inference, and focus on inferences for polytree-shaped networks. We also propose a new algorithm, A/R+, for outer approximations in polytree-shaped credal networks.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
José Carlos Ferreira da Rocha, Fabio Gagliardi Cozman,