Cycle-cutset sampling for bayesian networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2671, Issue , 2003, Pages 297-312

  Bidyuk, Bozhena ^a   Dechter, Rina ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BENCHMARKING; COMPUTER SCIENCE; DISTRIBUTED PARAMETER CONTROL SYSTEMS; GRAPH THEORY; SET THEORY;

CUT-SET; ERGODICS; EXACT INFERENCE; GIBBS SAMPLING; S-GRAPH; SAMPLING SCHEMES; STANDARD SAMPLING METHODS; VARIANCE REDUCTIONS;

BAYESIAN NETWORKS; SAMPLING;

BAYESIAN NETWORKS; CUTSET SAMPLING; SUBSETS; VARIANCE REDUCTION;

EID: 7044270666     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44886-1_23     Document Type: Conference Paper

References (19)

1. A. Becker, R. Bar-Yehuda, and D. Geiger. Random algorithms for the loop cutset problem. In Uncertainty in AI (UAI’99), 1999.
2. G. Casella and C. P. Robert. Rao-blackwellisation of sampling schemes. Biometrika, 83(1):81–94, 1996.
3. R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113:41–85, 1999.
4. A. Doucet, N. de Freitas, K. Murphy, and S. Russell. Rao-blackwellised particle filtering for dynamic bayesian networks. In Uncertainty in AI, pages 176–183, 2000.
5. A.E. Gelfand and A.F.M. Smith. Sampling-based approaches to calculating marginal densities. Journal of the American Statistical Association, 85:398–409, 1990.
6. S. Geman and D. Geman. Stochastic relaxations, gibbs distributions and the bayesian restoration of images. IEEE Transaction on Pattern analysis and Machine Intelligence (PAMI-6), pages 721–42, 1984.
7. W. Gilks, S. Richardson, and D. Spiegelhalter. Markov chain Monte Carlo in practice. Chapman and Hall, 1996.
8. M.H. De Groot. Probability and Statistics, 2nd edition. Addison-Wesley, 1986.
9. K. Kask I. Rish and R. Dechter. Empirical evaluation of approximation algorithms for probabilistic decoding. In Uncertainty in AI (UAI’98), 1998.
10. C. Jensen, A. Kong, and U. Kjaerulff. Blocking gibbs sampling in very large probabilistic expert systems. International Journal of Human Computer Studies. Special Issue on Real-World Applications of Uncertain Reasoning., pages 647–666, 1995.
11. F. V. Jensen, S.L Lauritzen, and K.G. Olesen. Bayesian updating in causal probabilistic networks by local computation. Computational Statistics Quarterly, 4:269–282, 1990.
12. Y. Weiss K.P. Murphy and M. I. Jordan. Loopy belief propagation for approximate inference: An empirical study. In Uncertainty in AI (UAI’99), 1999.
13. Uffe Kjærulff. Hugs: Combining exact inference and gibbs sampling in junction trees. In Uncertainty in AI, pages 368–375. Morgan Kaufmann, 1995.
14. D. Koller, U. Lerner, and D. Angelov. A general algorithm for approximate inference and its application to hybrid bayes nets. In Uncertainty in AI, pages 324–333, 1998.
15. S. L. Lauritzen and D. J. Spiegelhalter. Local computation with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B, 50(2):157–224, 1988.
16. W.H. Wong Liu, J. and A. Kong. Covariance structure of the gibbs sampler with applications to the comparison of estimators and augmentation schemes. Biometrika, pages 27–40, 1994.
17. D. J.C MacKay. Introduction to monte carlo methods. In Proceedings of NATO Advanced Study Institute on Learning in Graphical Models. Sept 27-Oct 7, pages 175–204, 1996.
18. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.
19. M.A. Peot and R.D. Shachter. Fusion and proagation with multiple observations in belief networks. Artificial Intelligence, pages 299–318, 1992.