Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative-Reference-Cited by-同舟云学术

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

Published:2013 Issue: Volume: Page:328-339
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Kwisthout Johan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-39091-3_28

Reference25 articles.

1. Barwise, J.: Information and impossibilities. The Notre Dame Journal of Formal Logic 38(4), 488–515 (1997)

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)

3. Charniak, E., Shimony, S.E.: Cost-based abduction and MAP explanation. Artificial Intelligence 66(2), 345–374 (1994)

4. Darwiche, A.: Modeling and Reasoning with Bayesian Networks. Cambridge University Press (2009)

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)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Motivating explanations in Bayesian networks using MAP-independence;International Journal of Approximate Reasoning;2023-02

2. Explainable AI Using MAP-Independence;Lecture Notes in Computer Science;2021

3. To be precise, the details don’t matter: On predictive processing, precision, and level of detail of predictions;Brain and Cognition;2017-03

4. Exact Algorithms for MRE Inference;Journal of Artificial Intelligence Research;2016-03-22

5. Constraint-Based Querying for Bayesian Network Exploration;Advances in Intelligent Data Analysis XIV;2015