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

José Carlos Ferreira Da Rocha; Fabio Gagliardi Cozman

doi:10.1016/j.ijar.2004.10.009

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 conference › Conference 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 language	American English
Pages	279-296
Number of pages	18
DOIs	https://doi.org/10.1016/j.ijar.2004.10.009
State	Published - 1 Jan 2005
Externally published	Yes
Event	International Journal of Approximate Reasoning - Duration: 1 Jun 2005 → …

Conference

Conference	International Journal of Approximate Reasoning
Period	1/06/05 → …

Access to Document

10.1016/j.ijar.2004.10.009

Cite this

@conference{bb5ec1a9caec441f98474e3eb46ed2f6,

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

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. {\textcopyright} 2004 Elsevier Inc. All rights reserved.",

author = "{Da Rocha}, {Jos{\'e} Carlos Ferreira} and Cozman, {Fabio Gagliardi}",

year = "2005",

month = jan,

day = "1",

doi = "10.1016/j.ijar.2004.10.009",

language = "American English",

pages = "279--296",

note = "International Journal of Approximate Reasoning ; Conference date: 01-06-2005",

}

TY - CONF

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

AU - Da Rocha, José Carlos Ferreira

AU - Cozman, Fabio Gagliardi

PY - 2005/1/1

Y1 - 2005/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=16344378086&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=16344378086&origin=inward

U2 - 10.1016/j.ijar.2004.10.009

DO - 10.1016/j.ijar.2004.10.009

M3 - Conference Paper

SP - 279

EP - 296

T2 - International Journal of Approximate Reasoning

Y2 - 1 June 2005

ER -

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

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this