Improving importance sampling by adaptive split-rejection control in Bayesian networks

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Importance sampling-based algorithms are a popular alternative when Bayesian network models are too large or too complex for exact algorithms. However, importance sampling is sensitive to the quality of the importance function. A bad importance function often leads to much oscillation in the sample weights, and, hence, poor estimation of the posterior probability distribution. To address this problem, we propose the adaptive split-rejection control technique to adjust the samples with extremely large or extremely small weights, which contribute most to the variance of an importance sampling estimator. Our results show that when we adopt this technique in the EPIS-BN algorithm [14], adaptive split-rejection control helps to achieve significantly better results. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Yuan, C., & Druzdzel, M. J. (2007). Improving importance sampling by adaptive split-rejection control in Bayesian networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4509 LNAI, pp. 332–343). Springer Verlag. https://doi.org/10.1007/978-3-540-72665-4_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free