Dear colleagues,
The following reference may be of your interest:
Antonio Salmer=F3n, Andr=E9s Cano, Seraf=EDn Moral (2000)
"Penniless Propagation in Join Trees"
International Journal of Intelligent Systems, Volume 15, Issue 11, 2000.
Pages: 1027-1059
ABSTRACT:
This paper presents non-random algorithms for approximate
computation in Bayesian networks. They are based on the
use of probability trees to represent probability potentials,
using the Kullback-Leibler cross entropy as a measure of the
error of the approximation. Different alternatives are presented
and tested in several experiments with difficult propagation
problems.
The results show how it is possible to find good approximations in
short time compared with Hugin algorithm.
This archive was generated by hypermail 2b29 : Fri Oct 27 2000 - 09:09:38 PDT