The inferential complexity of bayesian and credal networks

Cassio Polpo De Campos, Fabio Gagliardi Cozman

Resultado de la investigación: Contribución a una conferenciaArtículo de conferencia

55 Citas (Scopus)

Resumen

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).
Idioma originalInglés estadounidense
Páginas1313-1318
Número de páginas6
EstadoPublicada - 1 dic 2005
Publicado de forma externa
EventoIJCAI International Joint Conference on Artificial Intelligence -
Duración: 1 dic 2005 → …

Conferencia

ConferenciaIJCAI International Joint Conference on Artificial Intelligence
Período1/12/05 → …

Huella Profundice en los temas de investigación de 'The inferential complexity of bayesian and credal networks'. En conjunto forman una huella única.

  • Citar esto

    De Campos, C. P., & Cozman, F. G. (2005). The inferential complexity of bayesian and credal networks. 1313-1318. Papel presentado en IJCAI International Joint Conference on Artificial Intelligence, .