Results 161 to 170 of about 25,372 (226)
Some of the next articles are maybe not open access.

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

Dempster-Shafer Theory for Stock Selection

2021 IEEE 45th Annual Computers, Software, and Applications Conference (COMPSAC), 2021
The Dempster-Shafer theory is used to develop a stock selection method. Monte Carlo algorithms are employed to approximate Dempster’s combination rule to overcome the high computational complexity of the method. Numerical results are obtained to compare the proposed method with another Dempster-Shafer based stock selection method and the S&P 500 ...
Nima Salehy, Giray Ökten
openaire   +1 more source

A clash in Dempster-Shafer theory

10th IEEE International Conference on Fuzzy Systems. (Cat. No.01CH37297), 2005
In this paper, we justify Dempster's rule of combination under Shafer's interpretation of belief functions. Then, we argue that there is a clash in Dempster-Shafer (D-S) theory. That is, the definition which Shafer gives for belief function Bel/sub /spl infin// is not consistent with his interpretation for the belief function.
null Wei Xiong   +2 more
openaire   +1 more source

Dempster-Shafer Theory with Smoothness

2013
This paper introduces the idea of a modified Dempster-Shafer theory. We adapt the belief characteristic of expert combination by introducing a penalty term which is specific to the investigated object. This approach is motivated by the observation that final decisions in the Dempster-Shafer theory might tend to fluctuations due to variations in sensor ...
Ronald Böck   +2 more
openaire   +1 more source

Dempster-Shafer theory for image restoration

Proceedings of the International Conference and Workshop on Emerging Trends in Technology, 2010
This work proposes a new filter based on progressive decision using Dempster-Shafer theory, to suppress the impulse noise to preserve details of image and to restore image corrupted by random valued impulse noise. The new filter mechanism is composed of an efficient D-S impulse detector and a noise filter. The D-S evidence theory provides a way to deal
R. K. Kulkarni, S. Meher, V. S. Lunge
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. Mollaei, J. Ghasemi
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

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 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

Dempster-Shafer Evidential Theory

2009
Dempster-Shafer evidential theory, a probability-based data fusion classification algorithm, is useful when the sensors (or more generally, the information sources) contributing information cannot associate a 100 percent probability of certainty to their output decisions.
openaire   +1 more source

Home - About - Disclaimer - Privacy