Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9651756 | International Journal of Approximate Reasoning | 2005 | 17 Pages |
Abstract
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 configurations 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 configurations. The basic idea of dynamic importance sampling is to use the simulation of a configuration 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 final results can be very good even in the case that the initial sampling distribution is far away from the optimum.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
SerafÃn Moral, Antonio Salmerón,