Thirty years of credal networks: Specification, algorithms and complexity

Denis Deratani Mauá, Fabio Gagliardi Cozman

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

2 Citas (Scopus)

Resumen

Credal networks generalize Bayesian networks to allow for imprecision in probability values. This paper reviews the main results on credal networks under strong independence, as there has been significant progress in the literature during the last decade or so. We focus on computational aspects, summarizing the main algorithms and complexity results for inference and decision making. We address the question “What is really known about strong extensions of credal networks?” by looking at theoretical results and by presenting a short summary of real applications.

Idioma originalInglés
Páginas (desde-hasta)133-157
Número de páginas25
PublicaciónInternational Journal of Approximate Reasoning
Volumen126
DOI
EstadoPublicada - nov 2020
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'Thirty years of credal networks: Specification, algorithms and complexity'. En conjunto forman una huella única.

Citar esto