On the problem of performing exact partial abductive inference in Bayesian belief networks using junction trees

  • Authors:
  • Luis M. de Campos;José A. Gámez;Serafín Moral

  • Affiliations:
  • Dpto. de Ciencias de la Computación e I.A. Universidad de Granada. 18071 - Granada- SPAIN;Dpto. de Informática. Universidad de Castilla-La Mancha. 02071 - Albacete - SPAIN;Dpto. de Ciencias de la Computación e I.A. Universidad de Granada. 18071 - Granada- SPAIN

  • Venue:
  • Technologies for constructing intelligent systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Partial abductive inference in Bayesian belief networks has been usually expressed as an extension of total abductive inference (abduction over all the variables in the network). In this paper we study the transformation of the partial problem in a total one, analyzing and trying to improve the method previously appeared in the literature. We also outline an alternative approach, and compare both methods by means of experimentation. The experimental results reveal that the problem of partial abductive inference is difficult to solve by exact computation.