Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm

José Carlos Ferreira Da Rocha, Fabio Gagliardi Cozman

Research output: Contribution to conferenceConference Paper

9 Scopus citations

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. © 2004 Elsevier Inc. All rights reserved.
Original languageAmerican English
Pages279-296
Number of pages18
DOIs
StatePublished - 1 Jan 2005
Externally publishedYes
EventInternational Journal of Approximate Reasoning -
Duration: 1 Jun 2005 → …

Conference

ConferenceInternational Journal of Approximate Reasoning
Period1/06/05 → …

Fingerprint

Dive into the research topics of 'Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm'. Together they form a unique fingerprint.

Cite this