Penniless propagation in join trees
✍ Scribed by Andrés Cano; Serafín Moral; Antonio Salmerón
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 319 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0884-8173
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this article we introduce some modifications over the Penniless propagation algorithm. When a message through the join tree is approximated, the corresponding error is quantified in terms of an improved information measure, which leads to a new way of pruning several values in a probability tree
We describe a simple method for propagating belief functions in AND-trees. We exploit the properties of AND-trees to make our method simpler than the general method discussed by Shenoy and Shafer, and Dempster and Kong. We illustrate our method for aggregation of evidence in a financial audit. 0 199