𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithmic approach to combining belief functions

✍ Scribed by Bruce E. Tonn


Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
913 KB
Volume
11
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

✦ Synopsis


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, and conditionalization, where pieces of evidence to be synthesized have dissymmetric relationships to each other. The Dempster-Shafer Rule is the quintessential combination method. However, it has been criticized for its inability to handle inconsistent pieces of evidence and for the way it focuses the weight of evidence. This article presents an alternative combination method that is capable of handling inconsistent evidence and relates evidence focusing to the amount of information resident in pieces of evidence. The method is capable of combining belief functions. Future research should address extending the method to the combination of a broad class of imprecise probability functions.


πŸ“œ SIMILAR VOLUMES


Algorithms for combining belief function
✍ Wagner Teixeira da Silva; Ruy Luiz MilidiΓΊ πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 942 KB
An algorithmic approach to simultaneous
✍ C. Dubi πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 120 KB

We present and prove the validity of an algorithm constructing a simultaneous triangularization of a set on N matrices in C nΓ—n . To do so, we first prove that if a set of matrices has a common block decomposition, then the set of matrices has a simultaneous triangularization if and only if the bloc

An algebraic approach to belief contract
✍ Lee Flax πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 208 KB

The approach of AlchourrΓ³n, GΓ€rdenfors and Makinson to belief contraction is treated algebraically. This is then used to give an algebraic treatment of nonmonotonic entailment in the context of a belief set. The algebra used is a preboolean algebra whose elements are sets of sentences and whose orde

Generalized belief function, plausibilit
✍ Miin-Shen Yang; Tsang-Chih Chen; Kuo-Lung Wu πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 103 KB

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.

An algorithmic approach to loop shaping
✍ Zhiqiang Gao πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 784 KB

An algorithmic approach to feedback control design is introduced. It simplifies the existing iterative design process, which is often tedious, by reducing the design problem to solving a set of linear algebraic equations. The algorithmic nature of sueh an approach makes it attractive to not only off

A conceptual framework and belief-functi
✍ Matthew Bovee; Rajendra P. Srivastava; Brenda Mak πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 200 KB

We develop an information quality model based on a user-centric view adapted from Financial Accounting Standards Board, 1 Wang et al., 2 and Wang and Strong. 3 The model consists of four essential attributes (or assertions): accessibility, interpretability, relevance, and integrity. Four subattribut