Equivalence Between Bayesian and Credal Nets on an Updating Problem
We establish an intimate connection between Bayesian and credal nets. Bayesian nets are precise graphical models, credal nets extend Bayesian nets to imprecise probability. We focus on traditional belief updating with credal nets, and on the kind of belief updating that arises with Bayesian nets when the reason for the missingness of some of the unobserved variables in the net is unknown. We show that the two updating problems are formally the same.
KeywordsBayesian Network Mass Function Probability Table Markov Condition Imprecise Probability
Unable to display preview. Download preview PDF.
- A. Cano, J. Cano, and S. Moral. Convex sets of probabilities propagation by simulated annealing on a tree of cliques. In Proceedings of the Fifth International Conference (IPMU ’94), pages 978–983, Paris, 1994.Google Scholar
- J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, 1988.Google Scholar
- M. Zaffalon. Conservative rules for predictive inference with incomplete data. In F.G. Cozman, R. Nau, and T. Seidenfeld, editors, Proceedings of the Fourth International Symposium on Imprecise Probabilities and Their Applications (ISIPTA ’05), pages 406–415, Pittsburgh, 2005.Google Scholar