Most probable explanations in Bayesian networks: Complexity and tractability

International Journal of Approximate Reasoning

Volumn 52, Issue 9, 2011, Pages 1452-1469

  Kwisthout, Johan ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Approximation; Bayesian networks; Computational complexity; Fixed parameter tractability; Most probable explanation

Indexed keywords

APPROXIMATION; COMPLEXITY RESULTS; COMPUTATIONAL PROBLEM; FIXED PARAMETER TRACTABILITY; MOST PROBABLE EXPLANATION; NEW RESULTS; PARAMETERIZED PROBLEMS; POSTERIOR PROBABILITY;

COMPUTATIONAL COMPLEXITY; DISTRIBUTED PARAMETER NETWORKS; INFERENCE ENGINES; INTELLIGENT NETWORKS;

BAYESIAN NETWORKS;

EID: 80955142766     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2011.08.003     Document Type: Conference Paper

References (59)

1. P.J.F. Lucas, N. de Bruijn, K. Schurink, and A. Hoepelman A probabilistic and decision-theoretic approach to the management of infectious disease at the ICU Artificial Intelligence in Medicine 3 2000 251 279 (Pubitemid 30445219)
2. L.C. van der Gaag, S. Renooij, C.L.M. Witteman, B.M.P. Aleman, and B.G. Taal Probabilities for a probabilistic network: a case study in oesophageal cancer Artificial Intelligence in Medicine 25 2002 123 148 (Pubitemid 34553372)
3. H. Wasyluk, A. Onisko, and M.J. Druzdzel Support of diagnosis of liver disorders based on a causal Bayesian network model Medical Science Monitor 7 2001 327 332
4. P.L. Geenen, A.R.W. Elbers, L.C. van der Gaag, W.L.A. van der Loeffen, Development of a probabilistic network for clinical detection of classical swine fever, in: Proceedings of the Eleventh Symposium of the International Society for Veterinary Epidemiology and Economics, 2006, pp. 667-669.
5. R.J. Kennett, K.B. Korb, and A.E. Nicholson Seabreeze prediction using Bayesian networks D.W.-L. Cheung, G.J. Williams, Q. Li, Proceedings of the Fifth Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining 2001 Springer Verlag Berlin 148 153 (Pubitemid 33255104)
6. A.S. Cofiño, R. Cano, C. Sordo, and J.M. Gutiérrez Bayesian networks for probabilistic weather prediction F. van Harmelen, Proceedings of the Fifteenth European Conference on Artificial Intelligence 2002 IOS Press Amsterdam 695 699
7. R. Demirer, R. Mau, and C. Shenoy Bayesian Networks: a decision tool to improve portfolio risk analysis Journal of Applied Finance 16 2006 106 119
8. J. Gemela Financial analysis using Bayesian networks Applied Stochastic Models in Business and Industry 17 2001 57 67 (Pubitemid 32254882)
9. M.E. Kragt, L.T.H. Newhama, A.J. Jakemana, A Bayesian network approach to integrating economic and biophysical modelling, in: R.S. Anderssen, R.D. Braddock, L.T.H. Newham (Eds.), Proceedings of the 18th World IMACS/ MODSIM Congress on Modelling and Simulation, 2009, pp. 2377-2383.
10. S. Nedevschi, J.S. Sandhu, J. Pal, R. Fonseca, K. Toyama, Bayesian networks: an exploratory tool for understanding ICT adoption, in: Proceedings of the International Conference on Information and Communication Technologies and Development, 2006, pp. 277-284.
11. P.J. Sticha, D.M. Buede, R.L. Rees, Bayesian model of the effect of personality in predicting decisionmaker behavior, in: L.C. Van der Gaag, R. Almond, (Eds.), Proceedings of the Fourth Bayesian Modelling Applications Workshop, 2006.
12. C.L. Baker, R. Saxe, and J.B. Tenenbaum Action understanding as inverse planning Cognition 113 2009 329 349
13. A. Yuille, and D. Kersten Vision as Bayesian inference: analysis by synthesis? Trends in Cognitive Sciences 10 2006 301 308 (Pubitemid 44094226)
14. N. Chater, J.B. Tennenbaum, and A. Yuille Probabilistic models of cognition: conceptual foundations Trends in Cognitive Sciences 10 2006 287 291 (Pubitemid 44094229)
15. P. Gärdenfors Knowledge in Flux: Modeling the Dynamics of Epistemic States 1988 MIT Press Cambridge, MA
16. J. Pearl Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference 1988 Morgan Kaufmann Palo Alto, CA
17. D. Poole, and G.M. Provan What is the most likely diagnosis? P. Bonissone, M. Henrion, L. Kanal, J. Lemmer, Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence 1990 Elsevier Science New York, NY 89 106
18. U. Chajewska, and J. Halpern Defining explanation in probabilistic systems D. Geiger, P. Shenoy, Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence 1997 Morgan Kaufmann San Francisco, CA 62 71
19. J. Kwisthout, T. Wareham, and I. van Rooij Letter to the Editor: Bayesian intractability is not an ailment approximation can cure Cognitive Science 35 5 2011 779 784
20. I. van Rooij, and T. Wareham Parameterized complexity in cognitive modeling: foundations, applications and opportunities The Computer Journal 51 2008 385 404 (Pubitemid 351649939)
21. M. Blokpoel, J. Kwisthout, T.P. van der Weide, and I. van Rooij How action understanding can be rational, Bayesian and tractable S. Ohlsson, R. Catrambone, Proceedings of the 32nd Annual Conference of the Cognitive Science Society 2010 Cognitive Science Society Austin, TX 1643 1648
22. C. Lacave, and F.J. Díez A review of explanation methods for Bayesian networks The Knowledge Engineering Review 17 2002 107 127
23. F.V. Jensen, and T.D. Nielsen Bayesian Networks and Decision Graphs second ed. 2007 Springer Verlag New York, NY
24. D. Koller, and N. Friedman Probabilistic Graphical Models: Principles and Techniques 2009 MIT press Cambridge, MA
25. N. Robertson, and P.D. Seymour Graph minors II: algorithmic aspects of tree-width Journal of Algorithms 7 1986 309 322
26. T. Kloks Treewidth LNCS 842 1994 Springer-Verlag Berlin
27. M.R. Garey, and D.S. Johnson Computers and Intractability A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Co San Francisco, CA
28. C.H. Papadimitriou Computational Complexity 1994 Addison-Wesley
29. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer Verlag Berlin
30. G.F. Cooper, NESTOR: a computer-based medical diagnostic aid that integrates causal and probabilistic knowledge, Technical Report HPP-84-48, Stanford University, 1984.
31. J.T. Gill Computational complexity of probabilistic turing machines SIAM Journal of Computing 6 1977
32. M.L. Littman, S.M. Majercik, and T. Pitassi Stochastic Boolean satisfiability Journal of Automated Reasoning 27 2001 251 296 (Pubitemid 32933529)
33. J. Kwisthout, The Computational Complexity of Probabilistic Networks, Ph.D. Thesis, Faculty of Science, Utrecht University, The Netherlands, 2009.
34. M.L. Littman, J. Goldsmith, and M. Mundhenk The computational complexity of probabilistic planning Journal of Artificial Intelligence Research 9 1998 1 36 (Pubitemid 128636199)
35. M.W. Krentel The complexity of optimization problems Journal of Computer and System Sciences 36 1988 490 509
36. S. Toda Simple characterizations of P(#P) and complete problems Journal of Computer and System Sciences 49 1994 1 17 (Pubitemid 124013303)
37. W.I. Gasarch, M.W. Krentel, and K.J. Rappoport OptP as the normal behavior of NP-complete problems Mathematical Systems Theory 28 6 1995 487 514
38. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer Verlag Berlin
39. B.K. Sy Reasoning MPE to multiply connected belief networks using message-passing P. Rosenbloom, P. Szolovits, Proceedings of the Tenth National Conference on Artificial Intelligence 1992 AAAI Press Arlington, Va 570 576
40. H.L. Bodlaender, F. van den Eijkhof, L.C. Van der Gaag, On the complexity of the MPA problem in probabilistic networks, in: F. van Harmelen (Ed.), Proceedings of the 15th European Conference on Artificial Intelligence, 2002, pp. 675-679.
41. M. Henrion, and M.J. Druzdzel Qualitative propagation and scenario-based approaches to explanation of probabilistic reasoning P. Bonissone, M. Henrion, L. Kanal, J. Lemmer, Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence 1990 Elsevier Science New York, NY 10 20
42. R.E. Neapolitan Probabilistic Reasoning in Expert Systems Theory and Algorithms 1990 Wiley/Interscience New York, NY
43. C.P. De Campos, F.G. Cozman, The inferential complexity of Bayesian and credal networks, in: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, 2005, pp. 1313-1318.
44. S.E. Shimony Finding MAPs for belief networks is NP-hard Artificial Intelligence 68 1994 399 410
45. J.D. Park, and A. Darwiche Complexity results and approximation settings for MAP explanations Journal of Artificial Intelligence Research 21 2004 101 133 (Pubitemid 41525899)
46. J. Kwisthout, H.L. Bodlaender, and L.C. Van der Gaag The complexity of finding kth most probable explanations in probabilistic networks I. Cerná, T. Gyimóthy, J. Hromkovic, K. Jefferey, R. Královic, M. Vukolic, S. Wolf, Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science, LNCS 6543 2011 Springer Berlin 356 367
47. L.C. Van der Gaag, H.L. Bodlaender, and A.J. Feelders Monotonicity in Bayesian networks M. Chickering, J. Halpern, Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence 2004 AUAI press Arlington 569 576
48. E. Santos On the generation of alternative explanations with implications for belief revision B. D'Ambrosio, P. Smets, P. Bonissone, Proceedings of the Seventh Conference on Uncertainty in Artificial Intelligence 1991 Morgan Kaufmann San Mateo, CA 339 347
49. E. Charniak, and S.E. Shimony Cost-based abduction and MAP explanation Artificial Intelligence 66 1994 345 374
50. H. Chan, A. Darwiche, On the robustness of most probable explanations, in: Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence, 2006, pp. 63-71.
51. S. Toda PP is as hard as the polynomial-time hierarchy SIAM Journal of Computing 20 1991 865 877 (Pubitemid 21710211)
52. J. Torán Complexity classes defined by counting quantifiers Journal of the ACM 38 1991 752 773
53. A.M. Abdelbar, and S.M. Hedetniemi Approximating MAPs for belief networks is NP-hard and other theorems Artificial Intelligence 102 1998 21 38 (Pubitemid 128378356)
54. P.R. De Waal, L.C. Van der Gaag, Inference and learning in multi-dimensional Bayesian network classifiers, in: K. Mellouli (Ed.), Proceedings of the Ninth European Conference on Symbolic and Quantitative Approaches to Reasoning under Uncertainty, 2007, pp. 501-511.
55. C. Bielza, G. Li, and P. Larrañga Multi-dimensional classification with Bayesian networks International Journal of Approximate Reasoning 52 2011 705 727
56. C.P. De Campos, New complexity results for MAP in Bayesian networks, in: T. Walsh (Ed.), Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, 2011, pp. 2100-2106.
57. S.A. Cook, The complexity of theorem proving procedures, in: Proceedings of the Third Annual ACM Symposium on Theory of Computing, 1971, pp. 151-158.
58. R.M. Karp Reducibility among combinatorial problems R.E. Miller, J.W. Thatcher, Complexity of Computer Computations 1972 Plenum New York, NY 85 103
59. K.W. Wagner The complexity of combinatorial problems with succinct input representation Acta Informatica 23 1986 325 356