Generalized loopy 2U: A new algorithm for approximate inference in credal networks

Proceedings of the 4th European Workshop on Probabilistic Graphical Models, PGM 2008

Volumn , Issue , 2008, Pages 17-24

  Antonucci, Alessandro ^a   Zaffalon, Marco ^a   Sun, Yi ^a   De Campos, Cassio P ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE ALGORITHMS; APPROXIMATE INFERENCE; BAYESIAN; BAYESIAN NETS; BELIEF UPDATING; BINARY VARIABLES; CREDAL NETWORKS; EMPIRICAL TEST; NON-BINARY; NP-HARD; POLYNOMIAL-TIME; POLYTREES; SCALABLE ALGORITHMS;

ALGORITHMS; POLYNOMIAL APPROXIMATION;

INFERENCE ENGINES;

EID: 80053148284     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. A. Antonucci and M. Zaffalon. 2008. Decision-theoretic specification of credal networks: A unified language for uncertain modeling with sets of Bayesian networks. Int. J. Approx. Reasoning. Forthcoming.
2. A. Antonucci, M. Zaffalon, J. S. Ide, and F. G. Coz-man. 2006. Binarization algorithms for approximate updating in credal nets. In Proceedings of the third European Starting AI Researcher Symposium, pages 120-131, Amsterdam. IOS Press.
3. A. Cano, M. Ǵomez, S. Moral, and J. Abelĺan. 2007. Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks. International Journal of Approximate Reasoning, 44(3):261-280.
4. F. G. Cozman. 2005. Graphical models for imprecise probabilities. Int. J. Approx. Reasoning, 39(2-3):167-184.
5. J. C. da Rocha, F. G. Cozman, and C. P. de Campos. 2003. Inference in polytrees with sets of probabilities. In Conference on Uncertainty in Artificial Intelligence, pages 217-224, Acapulco.
6. C. P. de Campos and F. G. Cozman. 2005. The inferential complexity of Bayesian and credal networks. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 1313-1318, Edinburgh.
7. C. P. de Campos and F. G. Cozman. 2007. Inference in credal networks through integer programming. In Proceedings of the Fifth International Symposium on Imprecise Probability: Theories andAp-plications, Prague. Action M Agency.
8. E. Fagiuoli and M. Zaffalon. 1998. 2U: an exact interval propagation algorithm for polytrees with binary variables. Artificial Intelligence, 106(1):77-107.
9. J. S. Ide and F. G. Cozman. 2004. IPE and L2U: Approximate algorithms for credal networks. In Proceedings of the Second Starting AI Researcher Symposium, pages 118-127, Amsterdam. IOS Press.
10. J. Pearl. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo.
11. P. Walley. 1991. Statistical Reasoning with Imprecise Probabilities. Chapman and Hall, New York.