ISSN:
1573-1375
Keywords:
Bayesian network
;
belief revision
;
charge
;
conditional independence
;
divide-and-conquer
;
evidence
;
flow
;
junction tree
;
marginalization
;
maximization
;
most probable explanation
;
potential function
;
propagation
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract A probabilistic expert system provides a graphical representation of a joint probability distribution which enables local computations of probabilities. Dawid (1992) provided a ‘flow- propagation’ algorithm for finding the most probable configuration of the joint distribution in such a system. This paper analyses that algorithm in detail, and shows how it can be combined with a clever partitioning scheme to formulate an efficient method for finding the M most probable configurations. The algorithm is a divide and conquer technique, that iteratively identifies the M most probable configurations.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1008990218483
Permalink
