Updating Probabilities in Multiply-Connected Belief Networks
This paper focuses on probability updates in multiply-connected belief networks. Pearl has designed the method of conditioning, which enables us to apply his algorithm for belief updates in singly-connected networks to multiply-connected belief networks by selecting a loop-cutset for the network and instantiating these loop-cutset nodes. We discuss conditions that need to be satisfied by the selected nodes. We present a heuristic algorithm for finding a loop-cutset that satisfies these conditions.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Distributed Revision of Belief Commitment in Multi-Hypothesis Interpretations
This paper extends the applications of belief-networks to include the revision of belief commitments, i.e., the categorical acceptance of a subset of hypotheses which, together, constitute the most satisfactory explanati…
Medical DiagnosisUpdating with incomplete observations
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or set-valued). This is a fundamental problem, and of particular interest for Bay…
Simulation Approaches to General Probabilistic Inference on Belief Networks
A number of algorithms have been developed to solve probabilistic inference problems on belief networks. These algorithms can be divided into two main groups: exact techniques which exploit the conditional independence r…
An Empirical Analysis of Likelihood-Weighting Simulation on a Large, Multiply-Connected Belief Network
We analyzed the convergence properties of likelihood- weighting algorithms on a two-level, multiply connected, belief-network representation of the QMR knowledge base of internal medicine. Specifically, on two difficult …
DiagnosticOn Heuristics for Finding Loop Cutsets in Multiply-Connected Belief Networks
We introduce a new heuristic algorithm for the problem of finding minimum size loop cutsets in multiply connected belief networks. We compare this algorithm to that proposed in [Suemmondt and Cooper, 1988]. We provide lo…