Reformulating inference problems through selective conditioning

  • Authors:
  • Paul Dagum;Eric Horvitz

  • Affiliations:
  • Medical Informatics, Stanford University School of Medicine and Polo Alto Laboratory, Rockwell International Science Center, Palo Alto, California;Medical Informatics, Stanford University School of Medicine and Polo Alto Laboratory, Rockwell International Science Center, Palo Alto, California

  • Venue:
  • UAI'92 Proceedings of the Eighth international conference on Uncertainty in artificial intelligence
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe how we selectively reformulate portions of a belief network that pose difficulties for solution with a stochastic-simulation algorithm. With employ the selective conditioning approach to target specific nodes in a belief network for decomposition, based on the contribution the nodes make to the tractability of stochastic simulation. We review previous work on BNRAS algorithms-- randomized approximation algorithms for probabilistic inference. We show how selective conditioning can be employed to reformulate a single BNRAS problem into multiple tractable BNRAS simulation problems. We discuss how we can use another simulation algorithm--logic sampling--to solve a component of the inference problem that provides a means for knitting the solutions of individual subproblems into a final result. Finally, we analyze tradeoffs among the computational subtasks associated with the selective-conditioning approach to reformulation.