The inferential complexity of bayesian and credal networks

Cassio Polpo de Campos, Fabio Gagliardi Cozman

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureHoofdstukAcademicpeer review

51 Citaties (Scopus)

Uittreksel

This paper presents new results on the complexity of graph-theoretical models that represent probabilities (Bayesian networks) and that represent interval and set valued probabilities (credal networks). We define a new class of networks with bounded width, and introduce a new decision problem for Bayesian networks, the maximin a posteriori. We present new links between the Bayesian and credal networks, and present new results both for Bayesian networks (most probable explanation with observations, maximin a posteriori) and for credal networks (bounds on probabilities a posteriori, most probable explanation with and without observations, maximum a posteriori).

Originele taal-2Engels
TitelInternational Joint Conference on Artificial Intelligence (IJCAI)
Pagina's1313-1318
Aantal pagina's6
StatusGepubliceerd - 1 dec 2005
Extern gepubliceerdJa
Evenement19th International Joint Conference on Artificial Intelligence, IJCAI 2005 - Edinburgh, Verenigd Koninkrijk
Duur: 30 jul 20055 aug 2005

Publicatie series

NaamIJCAI International Joint Conference on Artificial Intelligence
ISSN van geprinte versie1045-0823

Congres

Congres19th International Joint Conference on Artificial Intelligence, IJCAI 2005
LandVerenigd Koninkrijk
StadEdinburgh
Periode30/07/055/08/05

Vingerafdruk

Bayesian networks

Bibliografische nota

(oral presentation, double-blind peer reviewed by >3 reviewers)

Citeer dit

de Campos, C. P., & Cozman, F. G. (2005). The inferential complexity of bayesian and credal networks. In International Joint Conference on Artificial Intelligence (IJCAI) (blz. 1313-1318). (IJCAI International Joint Conference on Artificial Intelligence).
de Campos, Cassio Polpo ; Cozman, Fabio Gagliardi. / The inferential complexity of bayesian and credal networks. International Joint Conference on Artificial Intelligence (IJCAI). 2005. blz. 1313-1318 (IJCAI International Joint Conference on Artificial Intelligence).
@inbook{0f01a3a7811a446c8c49f70b41d013a1,
title = "The inferential complexity of bayesian and credal networks",
abstract = "This paper presents new results on the complexity of graph-theoretical models that represent probabilities (Bayesian networks) and that represent interval and set valued probabilities (credal networks). We define a new class of networks with bounded width, and introduce a new decision problem for Bayesian networks, the maximin a posteriori. We present new links between the Bayesian and credal networks, and present new results both for Bayesian networks (most probable explanation with observations, maximin a posteriori) and for credal networks (bounds on probabilities a posteriori, most probable explanation with and without observations, maximum a posteriori).",
author = "{de Campos}, {Cassio Polpo} and Cozman, {Fabio Gagliardi}",
note = "(oral presentation, double-blind peer reviewed by >3 reviewers)",
year = "2005",
month = "12",
day = "1",
language = "English",
series = "IJCAI International Joint Conference on Artificial Intelligence",
pages = "1313--1318",
booktitle = "International Joint Conference on Artificial Intelligence (IJCAI)",

}

de Campos, CP & Cozman, FG 2005, The inferential complexity of bayesian and credal networks. in International Joint Conference on Artificial Intelligence (IJCAI). IJCAI International Joint Conference on Artificial Intelligence, blz. 1313-1318, Edinburgh, Verenigd Koninkrijk, 30/07/05.

The inferential complexity of bayesian and credal networks. / de Campos, Cassio Polpo; Cozman, Fabio Gagliardi.

International Joint Conference on Artificial Intelligence (IJCAI). 2005. blz. 1313-1318 (IJCAI International Joint Conference on Artificial Intelligence).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureHoofdstukAcademicpeer review

TY - CHAP

T1 - The inferential complexity of bayesian and credal networks

AU - de Campos, Cassio Polpo

AU - Cozman, Fabio Gagliardi

N1 - (oral presentation, double-blind peer reviewed by >3 reviewers)

PY - 2005/12/1

Y1 - 2005/12/1

N2 - This paper presents new results on the complexity of graph-theoretical models that represent probabilities (Bayesian networks) and that represent interval and set valued probabilities (credal networks). We define a new class of networks with bounded width, and introduce a new decision problem for Bayesian networks, the maximin a posteriori. We present new links between the Bayesian and credal networks, and present new results both for Bayesian networks (most probable explanation with observations, maximin a posteriori) and for credal networks (bounds on probabilities a posteriori, most probable explanation with and without observations, maximum a posteriori).

AB - This paper presents new results on the complexity of graph-theoretical models that represent probabilities (Bayesian networks) and that represent interval and set valued probabilities (credal networks). We define a new class of networks with bounded width, and introduce a new decision problem for Bayesian networks, the maximin a posteriori. We present new links between the Bayesian and credal networks, and present new results both for Bayesian networks (most probable explanation with observations, maximin a posteriori) and for credal networks (bounds on probabilities a posteriori, most probable explanation with and without observations, maximum a posteriori).

UR - http://www.scopus.com/inward/record.url?scp=84880707438&partnerID=8YFLogxK

M3 - Chapter

T3 - IJCAI International Joint Conference on Artificial Intelligence

SP - 1313

EP - 1318

BT - International Joint Conference on Artificial Intelligence (IJCAI)

ER -

de Campos CP, Cozman FG. The inferential complexity of bayesian and credal networks. In International Joint Conference on Artificial Intelligence (IJCAI). 2005. blz. 1313-1318. (IJCAI International Joint Conference on Artificial Intelligence).