Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative
Berlin : Springer
InLecture Notes in Computer Science, (2013)Gaag, L.C. van der (ed.), Symbolic and Quantiative Approaches to Resoning with Uncertainty. 12th European Conference, ECSQARU 2013, Utrecht, The Netherlands, July 8-10, 2013, Proceedings, pp. 328-339
Article in monograph or in proceedings
Display more detailsDisplay less details
Gaag, L.C. van der
SW OZ DCC CO
Lecture Notes in Computer Science
Gaag, L.C. van der (ed.), Symbolic and Quantiative Approaches to Resoning with Uncertainty. 12th European Conference, ECSQARU 2013, Utrecht, The Netherlands, July 8-10, 2013, Proceedings
SubjectAction, intention, and motor control; DI-BCB_DCC_Theme 2: Perception, Action and Control
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.
Upload full text
Use your RU credentials (u/z-number and password) to log in with SURFconext to upload a file for processing by the repository team.