Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks

Authors:
Andrés Cano;Manuel Gómez;Serafín Moral;Joaquín Abellán
Affiliations:
Department of Computer Science and Artificial Intelligence, E.T.S. Ingeniería Informática, University of Granada, 18071 Granada, Spain;Department of Computer Science and Artificial Intelligence, E.T.S. Ingeniería Informática, University of Granada, 18071 Granada, Spain;Department of Computer Science and Artificial Intelligence, E.T.S. Ingeniería Informática, University of Granada, 18071 Granada, Spain;Department of Computer Science and Artificial Intelligence, E.T.S. Ingeniería Informática, University of Granada, 18071 Granada, Spain
Venue:
International Journal of Approximate Reasoning
Year:
2007

Citing 12
Cited 7

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Constraint propagation with imprecise conditional probabilities

Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
Towards precision of probabilistic bounds propagation

UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Credal networks

Artificial Intelligence
Strong Conditional Independence for Credal Sets

Annals of Mathematics and Artificial Intelligence
Interval Influence Diagrams

UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence
Axioms for probability and belief-function proagation

UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Graphical models for imprecise probabilities

International Journal of Approximate Reasoning
Inference with separately specified sets of probabilities in credal networks

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Irrelevance and independence relations in Quasi-Bayesian networks

UAI'98 Proceedings of the Fourteenth 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
Binary join trees

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence

Approximate algorithms for credal networks with binary variables

International Journal of Approximate Reasoning
Probabilistic representation and approximate inference of type-2 fuzzy events in Bayesian networks with interval probability parameters

Expert Systems with Applications: An International Journal
Credal networks for military identification problems

International Journal of Approximate Reasoning
Generalized loopy 2U: A new algorithm for approximate inference in credal networks

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

International Journal of Approximate Reasoning
Learning recursive probability trees from probabilistic potentials

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.01

Visualization

Abstract

This paper proposes two new algorithms for inference in credal networks. These algorithms enable probability intervals to be obtained for the states of a given query variable. The first algorithm is approximate and uses the hill-climbing technique in the Shenoy-Shafer architecture to propagate in join trees; the second is exact and is a modification of Rocha and Cozman's branch-and-bound algorithm, but applied to general directed acyclic graphs.