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

José Carlos Ferreira Da Rocha, Fabio Gagliardi Cozman

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

8 Citas (Scopus)

Resumen

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.
Idioma originalInglés estadounidense
Páginas279-296
Número de páginas18
DOI
EstadoPublicada - 1 ene 2005
Publicado de forma externa
EventoInternational Journal of Approximate Reasoning -
Duración: 1 jun 2005 → …

Conferencia

ConferenciaInternational Journal of Approximate Reasoning
Período1/06/05 → …

Huella Profundice en los temas de investigación de 'Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm'. En conjunto forman una huella única.

  • Citar esto

    Da Rocha, J. C. F., & Cozman, F. G. (2005). Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm. 279-296. Papel presentado en International Journal of Approximate Reasoning, . https://doi.org/10.1016/j.ijar.2004.10.009