论文信息 - Hybrid Propagation in Junction Trees

Hybrid Propagation in Junction Trees

We introduce a methodology for performing approximate computations in complex probabilistic expert systems, when some components can be handled exactly and others require approximation or simulation. This is illustrated by means of a modified version of the familiar ‘chest-clinic’ problem.

[1] Charles J. Geyer,et al. Practical Markov Chain Monte Carlo , 1992 .

[2] S. Lauritzen. Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models , 1992 .

[3] Brian D. Ripley,et al. Stochastic Simulation , 2005 .

[4] Samuel Kotz,et al. Continuous univariate distributions : distributions in statistics , 1970 .

[5] David J. Spiegelhalter,et al. Bayesian analysis in expert systems , 1993 .

[6] Adrian F. M. Smith,et al. Bayesian computation via the gibbs sampler and related markov chain monte carlo methods (with discus , 1993 .

[7] Adrian F. M. Smith,et al. Sampling-Based Approaches to Calculating Marginal Densities , 1990 .

[8] A. P. Dawid,et al. Applications of a general propagation algorithm for probabilistic expert systems , 1992 .

[9] Prakash P. Shenoy,et al. Axioms for probability and belief-function proagation , 1990, UAI.

[10] Steffen L. Lauritzen,et al. Bayesian updating in causal probabilistic networks by local computations , 1990 .

[11] D. Rubin,et al. Inference from Iterative Simulation Using Multiple Sequences , 1992 .

[12] Kristian G. Olesen,et al. HUGIN - A Shell for Building Bayesian Belief Universes for Expert Systems , 1989, IJCAI.

[13] David J. Spiegelhalter,et al. Local computations with probabilities on graphical structures and their application to expert systems , 1990 .