Importance sampling in Bayesian networks
β
Antonio SalmerΓ³n; AndrΓ©s Cano; SerafΔ±Μn Moral
π
Article
π
2000
π
Elsevier Science
π
English
β 248 KB
In this paper a new Monte-Carlo algorithm for the propagation of probabilities in Bayesian networks is proposed. This algorithm has two stages: in the ΓΏrst one an approximate propagation is carried out by means of a deletion sequence of the variables. In the second stage a sample is obtained using a