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. © 2004 Elsevier Inc. All rights reserved.
|Original language||American English|
|Number of pages||18|
|State||Published - 1 Jan 2005|
|Event||International Journal of Approximate Reasoning - |
Duration: 1 Jun 2005 → …
|Conference||International Journal of Approximate Reasoning|
|Period||1/06/05 → …|