Dynamic Importance Sampling in Bayesian Networks Based on Probability Trees
In this paper we introduce a new dynamic importance sampling propagation algorithm for Bayesian networks. Importance sampling is based on using an auxiliary sampling distribution from which a set of con gurations of the variables in the network is drawn, and the performance of the algorithm depends...
| Main Authors: | , |
|---|---|
| 格式: | info:eu-repo/semantics/article |
| 语言: | English |
| 出版: |
2017
|
| 主题: | |
| 在线阅读: | http://hdl.handle.net/10835/4893 https://doi.org/10.1016/j.ijar.2004.05.005 |
| 总结: | In this paper we introduce a new dynamic importance sampling propagation algorithm for Bayesian networks. Importance sampling is based on using an auxiliary sampling distribution from which a set of con gurations of the variables in the network is drawn, and the performance of the algorithm depends on the variance of the weights associated with the simulated con gurations. The basic idea of dynamic importance sampling is to use the simulation of a con guration to modify the sampling
distribution in order to improve its quality and so reducing the variance of the future weights. The paper shows that this can be achieved with a low computational effort. The experiments carried out show that the nal results can be very good even in the case that the initial sampling distribution is far away from the optimum. |
|---|