Abductive inference in bayesian networks: finding a partition of the explanation space

  • Authors:
  • M. Julia Flores;José A. Gámez;Serafín Moral

  • Affiliations:
  • Departamento de Informática, Universidad de Castilla-La Mancha, Albacete, Spain;Departamento de Informática, Universidad de Castilla-La Mancha, Albacete, Spain;Departamento de Ciencias de la Computación e I.A., Universidad de Granada, Granada, Spain

  • Venue:
  • ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a new approach to the problem of ob- taining the most probable explanations given a set of observations in a Bayesian network. The method provides a set of possibilities ordered by their probabilities. The main novelties are that the level of detail of each one of the explanations is not uniform (with the idea of being as simple as possible in each case), the explanations are mutually exclusive, and the number of required explanations is not fixed (it depends on the particular case we are solving). Our goals are achieved by means of the construction of the so called explanation tree which can have asym- metric branching and that will determine the different possibilities. This paper describes the procedure for its computation based on information theoretic criteria and shows its behaviour in some simple examples.