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
Algorithms for combining belief functions
✍ Scribed by Wagner Teixeira da Silva; Ruy Luiz Milidiú
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 942 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0888-613X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Uncertainty always exists in nature and real systems. It is known that probability has been used traditionally in modeling uncertainty. Since a belief function was proposed as an another type of measuring uncertainty, Dempster-Shafer theory (DST) has been widely studied and applied in diverse areas.
The Belief Function Model for automatic indexing and ranking of documents with respect to a given user query is proposed. The model is based on a controlled vocabulary, like a thesaurus, and on term frequencies in each document. Descriptors in this vocabulary are terms chosen from among their synon
In this paper, we present an adaptive gradient based method to restore images degraded by the effects of both noise and blur. The approach combines two penalty functions. The first derivative of the Canny operator is employed as a roughness penalty function to improve the high frequency information