Evidence propagation in credal networks: An exact algorithm based on separately specified sets of probability

José Carlos F. da Rocha, Fabio G. Cozman

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferencia

3 Citas (Scopus)

Resumen

© Springer-Verlag Berlin Heidelberg 2002. Probabilistic models and graph-based independence languages have often been combined in artificial intelligence research. The Bayesian network formalism is probably the best example of this type of association. In this article we focus on graphical structures that associate graphs with sets of probability measures — the result is referred to as a credal network. We describe credal networks and review an algorithm for evidential reasoning that we have recently developed. The algorithm substantially simplifies the computation of upper and lower probabilities by exploiting an independence assumption (strong independence) and a representation based on separately specified sets of probability measures. The algorithm is particularly efficient when applied to polytree structures. We then discuss a strategy for approximate reasoning in multi-connected networks, based on conditioning.
Idioma originalInglés estadounidense
Título de la publicación alojadaEvidence propagation in credal networks: An exact algorithm based on separately specified sets of probability
Páginas376-385
Número de páginas10
ISBN (versión digital)3540001247, 9783540001249
DOI
EstadoPublicada - 1 ene 2002
Publicado de forma externa
EventoLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) -
Duración: 1 ene 2018 → …

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen2507
ISSN (versión impresa)0302-9743

Conferencia

ConferenciaLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Período1/01/18 → …

Huella Profundice en los temas de investigación de 'Evidence propagation in credal networks: An exact algorithm based on separately specified sets of probability'. En conjunto forman una huella única.

  • Citar esto

    da Rocha, J. C. F., & Cozman, F. G. (2002). Evidence propagation in credal networks: An exact algorithm based on separately specified sets of probability. En Evidence propagation in credal networks: An exact algorithm based on separately specified sets of probability (pp. 376-385). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2507). https://doi.org/10.1007/3-540-36127-8_36