Advertisement

Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative

  • Johan Kwisthout
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7958)

Abstract

The problems of generating candidate hypotheses and inferring the best hypothesis out of this set are typically seen as two distinct aspects of the more general problem of non-demonstrative inference or abduction. In the context of Bayesian networks the latter problem (computing most probable explanations) is well understood, while the former problem is typically left as an exercise to the modeler. In other words, the candidate hypotheses are pre-selected and hard-coded. In reality, however, non-demonstrative inference is rather an interactive process, switching between hypothesis generation, inference to the best explanation, evidence gathering and deciding which information is relevant. In this paper we will discuss a possible computational formalization of finding an explanation which is both probable and as informative as possible, thereby combining (at least some aspects of) both the ‘hypotheses-generating’ and ‘inference’ steps of the abduction process. The computational complexity of this formal problem, denoted Most Inforbable Explanation, is then established and some problem parameters are investigated in order to get a deeper understanding of what makes this problem intractable in general, and under which circumstances the problem becomes tractable.

Keywords

Bayesian Network Chronic Bronchitis Turing Machine Probable Explanation Broncho Pneumonia 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barwise, J.: Information and impossibilities. The Notre Dame Journal of Formal Logic 38(4), 488–515 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Bodlaender, H.L., van den Eijkhof, F., van der Gaag, L.C.: On the complexity of the MPA problem in probabilistic networks. In: Proceedings of the 15th European Conference on Artificial Intelligence, pp. 675–679 (2002)Google Scholar
  3. 3.
    Charniak, E., Shimony, S.E.: Cost-based abduction and MAP explanation. Artificial Intelligence 66(2), 345–374 (1994)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Darwiche, A.: Modeling and Reasoning with Bayesian Networks. Cambridge University Press (2009)Google Scholar
  5. 5.
    De Campos, C.P.: New complexity results for MAP in Bayesian networks. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pp. 2100–2106 (2011)Google Scholar
  6. 6.
    de Campos, L., Gamez, J., Moral, S.: Partial abductive inference in Bayesian belief networks using a genetic algorithm. Pattern Recognition Letters 20(11-13), 1211–1217 (1999)CrossRefGoogle Scholar
  7. 7.
    de Campos, L., Gamez, J., Moral, S.: Partial abductive inference in Bayesian belief networks by simulated annealing. International Journal of Approximate Reasoning 27(3), 263–283 (2001)zbMATHCrossRefGoogle Scholar
  8. 8.
    de Campos, L., Gámez, J., Moral, S.: Simplifying explanations in Bayesian belief networks. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 9(4), 461–489 (2001)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Berlin (1999)CrossRefGoogle Scholar
  10. 10.
    Garey, M.R., Johnson, D.S.: Computers and Intractability. In: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco (1979)Google Scholar
  11. 11.
    Glass, D.H.: Inference to the best explanation: a comparison of approaches. In: Second Symposium on Computing and Philosophy (2009)Google Scholar
  12. 12.
    Jensen, F.V., Nielsen, T.D.: Bayesian Networks and Decision Graphs, 2nd edn. Springer, New York (2007)zbMATHCrossRefGoogle Scholar
  13. 13.
    Kwisthout, J.: The Computational Complexity of Probabilistic Networks. PhD thesis, Faculty of Science, Utrecht University, The Netherlands (2009)Google Scholar
  14. 14.
    Kwisthout, J.: Most probable explanations in Bayesian networks: Complexity and tractability. International Journal of Approximate Reasoning 52(9), 1452–1469 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Kwisthout, J.: Structure approximation of most probable explanations in Bayesian networks. In: Proceedings of the 24th Benelux Conference on Artificial Intelligence, BNAIC 2012 (2012)Google Scholar
  16. 16.
    Kwisthout, J.: The computational complexity of probabilistic inference. Technical Report ICIS–R11003, Radboud University Nijmegen (2011)Google Scholar
  17. 17.
    Lacave, C., Díez, F.J.: A review of explanation methods for Bayesian networks. The Knowledge Engineering Review 17(2), 107–127 (2002)CrossRefGoogle Scholar
  18. 18.
    Lipton, P.: Inference to the best explanation. Routledge (2004)Google Scholar
  19. 19.
    Nardone, D.A.: Collecting and analyzing data: Doing and thinking. In: Walker, H.K., Hall, W.D., Hurst, J.W. (eds.) Clinical Methods: The History, Physical, and Laboratory Examinations, ch. 2, 3rd edn., Butterworths, Boston (1990)Google Scholar
  20. 20.
    Park, J.D., Darwiche, A.: Approximating MAP using local search. In: Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pp. 403–410. Morgan Kaufmann Publishers, San Francisco (2001)Google Scholar
  21. 21.
    Park, J.D., Darwiche, A.: Solving MAP exactly using systematic search. In: Proceedings of the 19th Annual Conference on Uncertainty in Artificial Intelligence (UAI 2003), pp. 459–468. Morgan Kaufmann (2003)Google Scholar
  22. 22.
    Park, J.D., Darwiche, A.: Complexity results and approximation settings for MAP explanations. Journal of Artificial Intelligence Research 21, 101–133 (2004)MathSciNetzbMATHGoogle Scholar
  23. 23.
    Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, Palo Alto (1988)Google Scholar
  24. 24.
    Robertson, N., Seymour, P.D.: Graph minors II: Algorithmic aspects of tree-width. Journal of Algorithms 7, 309–322 (1986)MathSciNetzbMATHCrossRefGoogle Scholar
  25. 25.
    Yuan, C., Lu, T., Druzdzel, M.J.: Annealed MAP. In: Proceedings of the Twentieth Conference in Uncertainty in Artificial Intelligence, pp. 628–635. AUA (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Johan Kwisthout
    • 1
  1. 1.Donders Institute for Brain, Cognition and BehaviourRadboud University NijmegenNijmegenThe Netherlands

Personalised recommendations