Complexity results for enumerating MPE and partial MAP

Proceedings of the 4th European Workshop on Probabilistic Graphical Models, PGM 2008

Volumn , Issue , 2008, Pages 161-168

  Kwisthout, Johan ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

A-PRIORI PROBABILITIES; ARBITRARY VALUES; COMPLEXITY RESULTS; MOST LIKELY; MOST PROBABLE EXPLANATION; PARTIAL MAPS; VALUE ASSIGNMENT;

GRAPHIC METHODS;

SOFTWARE ENGINEERING;

EID: 84874755375     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. A. M. Abdelbar and S. M. Hedetniemi. 1998. Approximating maps for belief networks is NP-hard and other theorems. Artificial Intelligence, 102:21-38.
2. I. Beinlich, G. Suermondt, R. Chavez, and G. Cooper. 1989. The ALARM monitoring system: A case study with two probabilistic inference techniques for belief networks. In Proceedings of the Second European Conference on AI and Medicine, pages 247-256.
3. H. L. Bodlaender, F. van den Eijkhof, and L. C. van der Gaag. 2002. On the complexity of the MPA problem in probabilistic networks. In Proceedings of the Fifteenth European Conference on Artificial Intelligence, pages 675-679.
4. H. Chan and A. Darwiche. 2006. On the robustness of most probable explanations. In Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence, pages 63-71.
5. E. Charniak and S. E. Shimony. 1994. Cost-based abduction and map explanation. Artificial Intelligence, 66(2):345-374.
6. S. A. Cook. 1971. The complexity of theorem proving procedures. In Annual ACM Symposium on Theory of Computing, pages 151-158.
7. M. R. Garey and D. S. Johnson. 1979. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco.
8. F. V. Jensen. 2007. Bayesian Networks and Decision Graphs. Berlin: Springer Verlag, second edition.
9. M. W. Krentel. 1988. The complexity of optimization problems. Journal of Computer and System Sciences, 36:490-509.
10. M. L. Littman, J. Goldsmith, and M. Mundhenk. 1998. The computational complexity of probabilistic planning. Journal of Artificial Intelligence Research, 9:1-36.
11. C. H. Papadimitriou. 1994. Computational Complexity. Addison-Wesley.
12. J. D. Park and A. Darwiche. 2004. Complexity results and approximation settings for MAP explanations. Journal of Artificial Intelligence Research, 21:101-133.
13. J. Pearl. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, Palo Alto.
14. D. Roth. 1996. On the hardness of approximate reasoning. Artificial Intelligence, 82(1-2):273-302.
15. E. Santos Jr. 1991. On the generation of alternative explanations with implications for belief revision. In Proceedings of the Seventh Conference on Uncertainty in Artificial Intelligence, pages 339-347.
16. S. E. Shimony. 1994. Finding MAPs for belief networks is NP-hard. Artificial Intelligence, 68(2):399-410.
17. J. Simon. 1977. On the difference between one and many. In Proceedings of the Fourth Colloquium on Automata, Languages, and Programming, volume 52 of LNCS, pages 480-491. Springer-Verlag.
18. S. Srinivas and P. Nayak. 1996. Efficient enumeration of instantiations in Bayesian networks. In Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, pages 500-508.
19. B.K. Sy. 1992. Reasoning MPE to multiply connected belief networks using message-passing. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 570-576.
20. S. Toda. 1991. PP is as hard as the polynomial-time hierarchy. SIAM Journal of Computing, 20(5):865-877.
21. S. Toda. 1994. Simple characterizations of P(#P) and complete problems. Journal of Computer and System Sciences, 49:1-17.
22. J. Toŕan. 1991. Complexity classes defined by counting quantifiers. Journal of the ACM, 38(3):752-773.
23. L. C. van der Gaag, S. Renooij, C. L. M. Witteman, B. M. P. Aleman, and B. G. Taal. 2002. Probabilities for a probabilistic network: a case study in oesophageal cancer. Artificial Intelligence in Medicine, 25:123-148.