Likelihoods and Explanations in Bayesian Networks

  • David H. Glass

Summary

We investigate the problem of calculating likelihoods in Bayesian networks. This is highly relevant to the issue of explanation in such networks and is in many ways complementary to the MAP approach which searches for the explanation that is most probable given evidence. Likelihoods are also of general statistical interest and can be useful if the value of a particular variable is to be maximized. After looking at the simple case where only parents of nodes are considered in the explanation set, we go on to look at tree-structured networks and then at a general approach for obtaining likelihoods.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Pearl J (1988) Probabilistic Reasoning in Intelligent Systems. Morgan Kaufman, San MateoGoogle Scholar
  2. 2.
    Pearl J (2000) Causality: Models, Reasoning and Inference. Cambridge University Press, CambridgeMATHGoogle Scholar
  3. 3.
    Shimony AE (1991) Explanation, irrelevance and statistical independence. In: Proceedings of AAAI, pp. 482–487Google Scholar
  4. 4.
    Suermondt HJ (1992) Explanation in Bayesian belief networks. Ph.D thesis, Stanford UniversityGoogle Scholar
  5. 5.
    Henrion M, Druzdzel MJ (1990) Qualitative propagation and scenario-based approaches to explanation of probabilistic reasoning. In: Proceedings of the 6th Conference on Uncertainty in AI, pp. 17–32Google Scholar
  6. 6.
    Chajewska U, Halpern JY (1997) Defining explanation in probabilistic systems. In: Proceedings of the 13th Conference on Uncertainty in AI, pp. 62–71Google Scholar
  7. 7.
    Halpern JY, Pearl J (2001) Causes and Explanations: a Structural-Model Approach – Part I: Causes. In: Proceedings of the 17th Conference on Uncertainty in AI, pp. 194–202Google Scholar
  8. 8.
    Halpern JY, Pearl J (2001) Causes and Explanations: A Structural-Model Approach – Part II: Explanations. Proceedings of the 17th International Joint Conference on AI, pp. 27–34Google Scholar
  9. 9.
    Salmon WC (1998) Causality and Explanation. Oxford University Press, OxfordCrossRefGoogle Scholar
  10. 10.
    Glass DH (2002) Coherence, explanation and Bayesian networks. In: Proceedings of the 13th Irish Conference on AI and Cognitive Science. Lecture notes in AI 2464:177–182Google Scholar
  11. 11.
    Jensen FV (1996) An Introduction to Bayesian Networks. UCL Press, LondonGoogle Scholar
  12. 12.
    Neapolitan RE (1990) Probabilistic Reasoning in Expert Systems. Wiley, New YorkGoogle Scholar
  13. 13.
    Cowell RG, Dawid AP, Lauritzen SL, Spiegelhalter DJ (1998) Probabilistic Networks and Expert Systems. Springer, Berlin Heidelberg New YorkGoogle Scholar
  14. 14.
    Lauritzen SL, Spiegelhalter DJ (1988) Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society: Series B 50(2): 157–224MATHMathSciNetGoogle Scholar
  15. 15.
    Xu H (1995) Computing marginals for arbitrary subsets from marginal representation in Markov trees. Artificial Intelligence 74:177–189MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Nilsson D (1998) An efficient algorithm for finding the M most probable configurations in Bayesian networks. Statistics and Computing 2:159–173CrossRefGoogle Scholar
  17. 17.
    Dawid AP (1992) Applications of a general propagation algorithm for probabilistic expert systems. Statistics and Computing 2:25–36CrossRefGoogle Scholar
  18. 18.
    de Campos LM, Gamez JA, Moral S (2002) On the problem of performing exact partial abductive inferences in Bayesian belief networks using junction trees. Studies in Fuzziness and Soft Computing, 90:289–302Google Scholar
  19. 19.
    Cooper G (2002) Computation complexity of probabilistic inference using Bayesian belief network. SIAM Journal of Computing 42:393–405Google Scholar
  20. 20.
    de Campos LM, Gamez JA, Moral S (1999) Partial abductive inference in Bayesian belief networks using a genetic algorithm. Pattern Recognition Letter 20:1211–1217CrossRefGoogle Scholar
  21. 21.
    Park JD, Darwiche A (2001) Approximating MAP using local search. In: Proceedings of the 17th Conference on Uncertainty in AI, pp. 403–410Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • David H. Glass
    • 1
  1. 1.School of Computing and MathematicsUniversity of UlsterNewtownabbeyUK

Personalised recommendations