Cutset sampling for bayesian networks

Journal of Artificial Intelligence Research

Volumn 28, Issue , 2007, Pages 1-48

  Bidyuk, Bozhena ^a   Dechter, Rina ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; NUMERICAL METHODS; SET THEORY;

CONDITIONING ALGORITHM; INFERENCE ALGORITHMS;

BAYESIAN NETWORKS;

EID: 34249088006     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2149     Document Type: Article

References (70)

1. Abdelbar, A. M., & Hedetniemi, S. M. (1998). Approximating maps for belief networks is NP-hard and other theorems. Artificial Intelligence, 102, 21-38.
2. Andrieu, C., de Freit as, N., & Doucet, A. (2002). Rao-Blackwellised particle filtering via data augmentation. In Advances in Neural Information Processing Systems. MIT Press.
3. Arnborg, S. A. (1985). Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT, 25, 2-23.
4. Becker, A., Bar-Yehuda, R., & Geiger, D. (2000). Random algorithms for the loop cutset problem. Journal of Artificial Intelligence Research, 12, 219-234.
5. Bertele, U., & Brioschi, F. (1972). Nonserial Dynamic Programming. Academic Press.
6. Bidyuk, B., & Dechter, R. (2003). Empirical study of w-cutset sampling for Bayesian networks. In Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 37-46. Morgan Kaufmann.
7. Bidyuk, B., & Dechter, R. (2004). On finding minimal w-cutset problem. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 43-50. Morgan Kaufmann.
8. Bidyuk, B., & Dechter, R. (2006). Cutset Sampling with Likelihood Weighting. In Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence (UAI), pp. 39-46. Morgan Kaufmann.
9. Billingsley, P. (1968). Convergence of Probability Measures. John Wiley & Sons, New York.
10. Casella, G., &: Robert, C. P. (1996). Rao-Blackwellisation of sampling schemes. Biometrika, 83(1), 81-94.
11. Cheng, J., & Druzdzel, M. J. (2000). AIS-BN: An adaptive importance sampling algorithm for evidenctial reasoning in large baysian networks. Journal of Aritificial Intelligence Research, 13, 155-188.
12. Cooper, G. (1990). The computational complexity of probabilistic inferences. Artificial Intelligence, 42, 393-405.
13. Dagum, P., & Luby, M. (1993). Approximating probabilistic inference in Bayesian belief networks is NP-hard. Artificial Intelligence, 60(1), 141-153.
14. Dechter, R. (1999a). Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113, 41-85.
15. Dechter, R. (1999b). Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113(1-2), 41-85.
16. Dechter, R. (2003). Constraint Processing. Morgan Kaufmann.
17. Doucet, A., & Andrieu, C. (2001). Iterative algorithms for state estimation of jump Markov linear systems. IEEE Trans. on Signal Processing, 49(6), 1216-1227.
18. Doucet, A., Andrieu, C., & Godsill, S. (2000a). On sequential Monte Carlo sampling methods for Bayesian filtering. Statistics and Computing, 10(3), 197-208.
19. Doucet, A., de Freit as, N., Murphy, K., & Russell, S. (2000b). Rao-Blackwellised particle filtering for dynamic Bayesian networks. In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 176-183.
20. Doucet, A., deFreitas, N., & Gordon, N. (2001). Sequential Monte Carlo Methods in Practice. Springer-Verlag, New York, Inc.
21. Doucet, A., Gordon, N., & Krishnamurthy, V. (1999). Particle filters for state estimation of jump markov linear systems. Tech. rep., Cambridge University Engineering Department.
22. Escobar, M. D. (1994). Estimating normal means iwth a dirichlet process prior. Journal of the American Statistical Aasociation, 89, 268-277.
23. Prey, B. J., & MacKay, D. J. C. (1997). A revolution: Belief propagation in graphs with cycles. In Neural Information Processing Systems, Vol. 10.
24. Fung, R., & Chang, K.-C. (1989). Weighing and integrating evidence for stochastic simulation in Bayesian networks. In Proceedings of the 5th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 209-219. Morgan Kaufmann.
25. Geiger, D., & Fishelson, M. (2003). Optimizing exact genetic linkage computations. In Proceedings of the 7th Annual International Conf. on Computational Molecular Biology, pp. 114-121. Morgan Kaufmann.
26. Gelfand, A., & Smith, A. (1990). Sampling-based approaches to calculating marginal densities. Journal of the American Statistical Association, 85, 398-409.
27. Geman, S., & Geman, D. (1984). Stochastic relaxations, Gibbs distributions and the Bayesian restoration of images. IEEE Transaction on Pattern analysis and Machine Intelligence, 6, 721-742.
28. Geyer, C. J. (1992). Practical Markov Chain Monte Carlo. Statistical Science, 7, 473-483.
29. Gilks, W., Richardson, S., & Spiegelhalter, D. (1996). Markov chain Monte Carlo in practice. Chapman and Hall.
30. Gottlob, G., Leone, N., & Scarello, F. (1999). A comparison of structural CSP decomposition methods. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI), pp. 394-399. Morgan Kaufmann.
31. Jensen, C., Kong, A., & Kjærulff, U. (1995). Blocking Gibbs sampling in very large probabilistic expert systems. Int. J. of Human Computer Studies. Special Issue on Real-World Applications of Uncertain Reasoning, 42(6), 647-666.
32. Jensen, F. V., Lauritzen, S. L., & Olesen, K. G. (1990). Bayesian updating in causal probabilistic networks by local computation. Computational Statistics Quarterly, 4, 269-282.
33. Jones, G., &: Hobert, J. P. (2001). Honest exploration of intractable probability distributions via Markov Chain Monte Carlo. Statist. Sci., 16(4), 312-334.
34. Kask, K., Dechter, R., Larrosa, J., &: Dechter, A. (2005). Unifying cluster-tree decompositions for reasoning in graphical models. Artificial Intelligence, 166, 165-193.
35. Kjærulff, U. (1995). HUGS: Combining exact inference and Gibbs sampling in junction trees. In Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 368-375. Morgan Kaufmann.
36. Koller, D., Lerner, U., & Angelov, D. (1998). A general algorithm for approximate inference and its application to hybrid Bayes nets. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 324-333.
37. Kong, A., Liu, J. S., & Wong, W. (1994). Sequential imputations and Bayesian missing data problems. J. of the American Statistical Association, 85(425), 278-288.
38. Kschischang, F. R., & Frey, B. J. (1998). Iterative decoding of compound codes by probability propagation in graphical models. IEEE Journal on Selected Areas in Communications, 16, 219-230.
39. Larrosa, J., & Dechter, R. (2003). Boosting search with variable elimination in constraint optimization and constraint satisfaction problems. Constraints, 5(3), 303-326.
40. Lauritzen, S., & Spiegelhalter, D. (1988). 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.
41. Liu, J. (1991). Correlation Structure and Convergence Rate of the Gibbs Sampler, Ph.D. Thesis. University of Chicago.
42. Liu, J. (1994). The collapsed Gibbs sampler in Bayesian computations with applications to a gene regulation problem. Journal of the American Statistical Association, 55(427), 958-966.
43. Liu, J., Wong, W., & Kong, A. (1994). Covariance structure of the Gibbs sampler with applications to the comparison of estimators and augmentation schemes. Biometrika, 81(1), 27-40.
44. Liu, J. S. (1996). Nonparametric hierarchical bayes via sequential imputations. Annals of Statistics, 24(3), 911-930.
45. Liu, J. S. (2001). Monte Carlo Strategies in Scientific Computing. Springer-Verlag, New York, Inc.
46. MacEachern, S., Clyde, M., & Liu, J. (1998). Sequential importance sampling for nonparametric bayes models: The next generation. The Canadian Journal of Statistics, 27, 251-267.
47. MacEachern, S. N. (1994). Estimating normal means with a conjugate style dirichlet process prior. Communications in Statistics-Simulation and Computation, 23(3), 727-741.
48. MacKay, D. (1996). Introduction to Monte Carlo methods. In Proceedings of NATO Advanced Study Institute on Learning in Graphical Models. Sept 27-Oct 7, pp. 175-204.
49. Maier, D. (1983). The theory of relational databases. In Computer Science Press, Rockville, MD.
50. McEliece, R., MacKay, D., & Cheng, J.-F. (1997). Turbo decoding as an instance of Pearl's belief propagation algorithm. IEEE J. Selected Areas in Communication, 16, 140-152.
51. Miller, R., Masarie, F., & Myers, J. (1986). Quick medical reference (QMR) for diagnostic assistance. Medical Computing, 5(5), 34-38.
52. Miller, R., Pople, H., & Myers, J. (1982). Internist-1: An experimental computerbased diagnostic consultant for general internal medicine. New English Journal of Medicine, 307(8), 468-476.
53. Murphy, K. P., Weiss, Y., & Jordan, M. I. (1999). Loopy belief propagation for approximate inference: An empirical study. In Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 467-475. Morgan Kaufmann.
54. Parker, R., & Miller, R. (1987). Using causal knowledge to create simulated patient cases: the CPCS project as an extension of INTERNIST-1. In Proceedings of the 11th Symp. Comp. Appl. in Medical Care, pp. 473-480.
55. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann.
56. Peot, M. A., & Shachter, R. D. (1992). Fusion and propagation with multiple observations in belief networks. Artificial Intelligence, 48, 299-318.
57. Pradhan, M., Provan, G., Middleton, B., &: Henrion, M. (1994). Knowledge engineering for large belief networks. In Proceedings of 10th Conference on Uncertainty in Artificial Intelligence, Seattle, WA, pp. 484-490.
58. Rish, I., Kask, K., & Dechter, R. (1998). Empirical evaluation of approximation algorithms for probabilistic decoding. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 455-463. Morgan Kaufmann.
59. Roberts, G. O., & Sahu, S. K. (1997). Updating schemes; correlation structure; blocking and parameterization for the Gibbs sampler. Journal of the Royal Statistical Society, Series B, 59(2), 291-317.
60. Roberts, G. O., &: Tweedie, R. L. (1999). Bounds on regeneration times and convergence rates for Markov chains. Stochastic Processes and Their Applications, 80, 211-229.
61. Roberts, G. O., & Tweedie, R. L. (2001). Corregendum to bounds on regeneration times and convergence rates for Markov chains. Stochastic Processes and Their Applications, 91, 337-338.
62. Rosenthal, J. S. (1995). Convergence rates for Markov Chains. SIAM Review, 57(3), 387-405.
63. Rosti, A.-V., & Gales, M. (2004). Rao-Blaekwellised Gibbs sampling for switching linear dynamical systems. In IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2004), PP- 809-812.
64. Schervish, M., & Carlin, B. (1992). On the convergence of successive substitution sampling. Journal of Computational and Graphical Statistics, 1, 111-127.
65. Shachter, R. D., Andersen, S. K., & Solovitz, P. (1994). Global conditioning for probabilistic inference in belief networks. In Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 514-522.
66. Shachter, R. D., & Peot, M. A. (1989). Simulation approaches to general probabilistic inference on belief networks. In Proceedings of the 5th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 221-231.
67. Steiger, N. M., & Wilson, J. R. (2001). Convergence properties of the batch means method for simulation output analysis. INFORMS Journal on Computing, 13(4), 277-293.
68. Tierney, L. (1994). Markov chains for exploring posterior distributions. Annals of Statistics, A2(4), 1701-1728.
69. Yuan, C., & Druzdzel, M. (2003). An importance sampling algorithm based on evidence pre-propagation. In Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 624-631.
70. Zhang, N., & Poole, D. (1994). A simple algorithm for Bayesian network computations. In Proceedings of the 10th Canadian Conference on Artificial Intelligence, pp. 171-178.