Local computation in credal networks

Fabio Gagliardi Cozman; Cassio P. de Campos

Local computation in credal networks

Fabio Gagliardi Cozman, Cassio P. de Campos

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

1 Downloads (Pure)

Abstract

The goal of this contribution is to discuss local computation in credal networks — graphical models that can represent imprecise and indeterminate probability values. We analyze the inference problem in credal networks, discuss how inference algorithms can benefit from local computation, and suggest that local computation can be particularly important in approximate inference algorithms.

Original language	English
Title of host publication	Proceedings of the Workshop on Local Computation for Logics and Uncertainty
Publisher	ECAI
Pages	5-11
Number of pages	7
Publication status	Published - 2004
Externally published	Yes

Access to Document

author versionFinal author version , 89.2 KB

Cite this

@inbook{e672a2182bdc45f1861ff184af02a36e,

title = "Local computation in credal networks",

abstract = "The goal of this contribution is to discuss local computation in credal networks — graphical models that can represent imprecise and indeterminate probability values. We analyze the inference problem in credal networks, discuss how inference algorithms can benefit from local computation, and suggest that local computation can be particularly important in approximate inference algorithms.",

author = "Cozman, {Fabio Gagliardi} and {de Campos}, {Cassio P.}",

year = "2004",

language = "English",

pages = "5--11",

booktitle = "Proceedings of the Workshop on Local Computation for Logics and Uncertainty",

publisher = "ECAI",

}

TY - CHAP

T1 - Local computation in credal networks

AU - Cozman, Fabio Gagliardi

AU - de Campos, Cassio P.

PY - 2004

Y1 - 2004

N2 - The goal of this contribution is to discuss local computation in credal networks — graphical models that can represent imprecise and indeterminate probability values. We analyze the inference problem in credal networks, discuss how inference algorithms can benefit from local computation, and suggest that local computation can be particularly important in approximate inference algorithms.

AB - The goal of this contribution is to discuss local computation in credal networks — graphical models that can represent imprecise and indeterminate probability values. We analyze the inference problem in credal networks, discuss how inference algorithms can benefit from local computation, and suggest that local computation can be particularly important in approximate inference algorithms.

M3 - Chapter

SP - 5

EP - 11

BT - Proceedings of the Workshop on Local Computation for Logics and Uncertainty

PB - ECAI

ER -