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
Belief functions and belief maintenance in artificial intelligence
β Scribed by Prakash P. Shenoy; Gautam Biswas
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 179 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0888-613X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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 (
Alternative approaches to the widely known pignistic transformation of belief functions are presented and analyzed. Pignistic, cautious, proportional, and disjunctive probabilistic transformations are examined from the point of view of their interpretation, of decision making and ~from the point of
Methods of combination are used to synthesize pieces of evidence of equal standing that represent different aspects of a specific system about which a diagnosis is to be made. Combination is distinct from consensus, when complete diagnoses rendered by different knowledge sources require synthesis, a