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

Authors:
José Carlos Ferreira da Rocha;Fabio Gagliardi Cozman
Affiliations:
Dept. de Informática, Universidade Estadual de Ponta Grossa, Ponta Grossa 84010-919, PR-Brazil;Escola Politécnica, Universidade de São Paulo, Av. Prof. Mello Moraes 2231, Cidade Universitária, São Paulo 05508-900, SP-Brazil
Venue:
International Journal of Approximate Reasoning
Year:
2005

Citing 12
Cited 4

Dynamic programming: deterministic and stochastic models

Dynamic programming: deterministic and stochastic models
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Bayesian logic

Decision Support Systems - Special issue on logic modeling
2U: an exact interval propagation algorithm for polytrees with binary variables

Artificial Intelligence
Credal networks

Artificial Intelligence
Geometric foundations for interval-based probabilities

Annals of Mathematics and Artificial Intelligence
Random Generation of Bayesian Networks

SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Separation Properties of Sets of Probability Measures

UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Uncertainty Management Using Probability Intervals

IPMU'94 Selected papers from the 5th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems, Advances in Intelligent Computing
Inference with separately specified sets of probabilities in credal networks

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Robustness analysis of Bayesian networks with local convex sets of distributions

UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Inference in polytrees with sets of probabilities

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence

Approximate algorithms for credal networks with binary variables

International Journal of Approximate Reasoning
Credal networks for military identification problems

International Journal of Approximate Reasoning
Updating credal networks is approximable in polynomial time

International Journal of Approximate Reasoning
Approximating credal network inferences by linear programming

ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.