𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Propagating belief functions in AND-trees

✍ Scribed by Rajendra P. Srivastava; Prakash P. Shenoy; Glenn R. Shafer

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
758 KB
Volume
10
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

✦ Synopsis

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 1995 John Wiley & Sons, Inc.

πŸ“œ SIMILAR VOLUMES

Belief functions on lattices
Belief functions on lattices
✍ Michel Grabisch πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 162 KB

We extend the notion of belief function to the case where the underlying structure is no more the Boolean lattice of subsets of some universal set, but any lattice, which we will endow with a minimal set of properties according to our needs. We show that all classical constructions and definitions (

Penniless propagation in join trees
Penniless propagation in join trees
✍ AndrΓ©s Cano; SerafΓ­n Moral; Antonio SalmerΓ³n πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 319 KB
Total dominating functions in trees: Min
Total dominating functions in trees: Minimality and convexity
✍ E. J. Cockayne; C. M. Mynhardt; Bo Yu πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 380 KB

## Abstract A total dominating function (TDF) of a graph __G__ = (__V, E__) is a function __f__: __V__ ← [0, 1] such that for each __v__ Ο΅ V, Ξ£~uΟ΅N(v)~ f(u) β‰₯ 1 (where __N__(__v__) denotes the set of neighbors of vertex __v__). Convex combinations of TDFs are also TDFs. However, convex combinations