Blocking Gibbs sampling in very large probabilistic expert systems
International Journal of Human-Computer Studies - Special issue: real-world applications of uncertain reasoning
Hybrid Propagation in Junction Trees
IPMU'94 Selected papers from the 5th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems, Advances in Intelligent Computing
HUGIN: a shell for building Bayesian belief universes for expert systems
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
A General Algorithm for Approximate Inference in Multiply Sectioned Bayesian Networks
IDA '01 Proceedings of the 4th International Conference on Advances in Intelligent Data Analysis
On Directed and Undirected Propagation Algorithms for Bayesian Networks
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Cutset sampling for Bayesian networks
Journal of Artificial Intelligence Research
Cycle-cutset sampling for Bayesian networks
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
A general algorithm for approximate inference and its application to hybrid bayes nets
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
An empirical study of w-cutset sampling for bayesian networks
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Importance sampling-based estimation over AND/OR search spaces for graphical models
Artificial Intelligence
Hi-index | 0.00 |
Dawid, Kjærulff & Lauritzen (1994) provided a preliminary description of a hybrid between Monte-Carlo sampling methods and exact local computations in junction trees. Utilizing the strengths of both methods, such hybrid inference methods has the potential of expanding the class of problems which can be solved under bounded resources as well as solving problems which otherwise resist exact solutions. The paper provides a detailed description of a particular instance of such a hybrid scheme; namely, combination of exact inference and Gibbs sampling in discrete Bayesian networks. We argue that this combination calls for an extension of the usual message passing scheme of ordinary junction trees.