A credal network associates a directed acyclic graph with a collection of sets of probability measures; it offers a compact representation for sets of multivariate distributions. In this paper we present a new algorithm for inference in credal networks based on an integer programming reformulation. We are concerned with computation of lower/upper probabilities for a variable in a given credal network. Experiments reported in this paper indicate that this new algorithm has better performance than existing ones for some important classes of networks. Copyright © 2007 by SIPTA.
|Idioma original||Inglés estadounidense|
|Número de páginas||10|
|Estado||Publicada - 1 dic 2007|
|Publicado de forma externa||Sí|
|Evento||ISIPTA 2007 - Proceedings of the 5th International Symposium on Imprecise Probability: Theories and Applications - |
Duración: 1 dic 2007 → …
|Conferencia||ISIPTA 2007 - Proceedings of the 5th International Symposium on Imprecise Probability: Theories and Applications|
|Período||1/12/07 → …|
De Campos, C. P., & Cozman, F. G. (2007). Inference in credal networks through integer programming. 145-154. Papel presentado en ISIPTA 2007 - Proceedings of the 5th International Symposium on Imprecise Probability: Theories and Applications, .