Results 171 to 180 of about 13,159 (226)
Some of the next articles are maybe not open access.

Fast algorithms for Dempster-Shafer theory

2005
The runtime of the usual algorithms computing the transformation of a basic belief assignment into its associated belief function and conversely is an exponential function of the cardinality of (the domain of) the basic belief assignment. In this paper, new algorithms with a polynomial runtime are presented. These algorithms appear to be optimal in the
Kennes, Robert, Smets, Philippe
openaire   +2 more sources

Nonstandard analysis and Dempster-Shafer theory

International Journal of Intelligent Systems, 2000
Summary: The theorems, propositions, and examples were concerned about the Dempster-Shafer random variable. Future areas of investigation can include determining theorems analogous to the classical theorems of probability. Also, as more theory is developed, applications of the Dempster-Shafer random variable can be investigated.
openaire   +2 more sources

Zero-sum polymatrix games with link uncertainty: A Dempster-Shafer theory solution

Applied Mathematics and Computation, 2019
Polymatrix games belong to a class of multi-player games, in which players interact pairwisely and the underlying pairwise interactions are defined by a simple undirected graph where all the edges are completely deterministic.
Xinyang Deng, Wen Jiang, Zhen Wang
semanticscholar   +1 more source

Evidential logic and Dempster-Shafer theory

Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems, 1986
Most artificial intelligence applications require reasoning with uncertainty and incompleteness. Such information is not captured in terms of simple true and false values nor in terms of probabilistic estimates when relevant statistical data are lacking.
openaire   +1 more source

Default logic and Dempster-Shafer theory

2005
A new version of Reiter's Default Logic is developed which has a number of advantages: it is computationally much simpler and has some more intuitive properties, such as cumulativity. Furthermore, it is shown that this Default Logic is a limiting case of a Dempster-Shafer framework, thereby demonstrating a strong connection between two apparently very ...
openaire   +1 more source

Analyzing a Paradox in Dempster-Shafer Theory

2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery, 2008
Zadeh has criticized Dempster-Shafer (D-S) theory with a famous counter-example, where an almost impossible case based on two bodies of evidence produces a certain outcome by Dempster's rule of combination. This paper investigates this intuitive paradox by justifying Dempster's rule of combination under Shafer's interpretation for D-S theory.
openaire   +1 more source

The Dempster-Shafer Theory

2009
The initial work introducing Dempster-Shafer (D-S) theory is found in Dempster (1967) and Shafer (1976). Since its introduction the very name causes confusion, a more general term often used is belief functions (both used intermittently here). Nguyen (1978) points out, soon after its introduction, that the rudiments of D-S theory can be considered ...
openaire   +1 more source

A novel method for classification of BCI multi-class motor imagery task based on Dempster-Shafer theory

Information Sciences, 2019
Brain-computer interface (BCI) is a promising technology to help disabled people to interact with the world only through their brain signals. These systems are designed based on recognizing the patient’s intention by processing his brain signal ...
Sara Razi, M. R. K. Mollaei, J. Ghasemi
semanticscholar   +1 more source

A survey: Optimization and applications of evidence fusion algorithm based on Dempster-Shafer theory

Applied Soft Computing, 2022
Kaiyi Zhao   +5 more
semanticscholar   +1 more source

AN EXERCISE IN DEMPSTER-SHAFER THEORY

International Journal of General Systems, 1992
We discuss a concrete example of the use of the Dempster rule presented by Weichselberger and Pohlmann15 and show how their approach has to be modified to yield an intuitively adequate result. At the end we mention a possibility of a similar modification of their approach to MYCIN-like systems.
P. HAJEK, D. HARMANEC
openaire   +1 more source

Home - About - Disclaimer - Privacy