Results 161 to 170 of about 16,024 (202)
Some of the next articles are maybe not open access.

Discovering user preferences using Dempster–Shafer theory

Fuzzy Sets and Systems, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Troiano L   +2 more
openaire   +3 more sources

Symbolic Dempster-Shafer Theory

Journal of Computer Research and Development, 2005
采用一个全序的符号值集合来代替数值信任度集合[0,1],提出定性Dempster-Shfer理论来处理既有不确定性又有不精确性的推理问题.首先,定义了适合对不确定性进行定性表达和推理的定性mass函数、定性信任函数等概念,并且研究了这些概念之间的基本关系;其次,详细讨论了定性证据合成问题,提出了基于平均策略的证据合成规则.这种定性Dempster-Shfer理论与其他相关理论相比,既通过在定性领域重新定义Dempster-Shfer理论的基本概念,继承了Dempster-Shfer理论在不确定推理方面的主要特点,同时又具有适合对不精确性操作的既有严格定义又符合直观特性的定性算子,因此更适合基于Dempster-Shafer理论框架不精确表示和处理不确定性.
openaire   +1 more source

Coherent Dempster–Shafer equilibrium and ambiguous signals

Journal of Mathematical Economics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dominiak, Adam, Lee, Min Suk
openaire   +1 more source

PRECISE EYE LOCATION USING DEMPSTER–SHAFER THEORY

International Journal of Wavelets, Multiresolution and Information Processing, 2007
Eye location is an important step in automatic visual interpretation and face recognition. In this paper, we present a novel eye location algorithm based on Dempster–Shafer's evidential reasoning. Four eye detectors are trained by AdaBoost with different combinations of feature spaces and samples. They detect face region respectively and produce an eye
Gao, Yong, Wang, Yangsheng
openaire   +2 more sources

Shape from silhouette using Dempster–Shafer theory

Pattern Recognition, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Díaz-Más, L.   +3 more
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

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

Dempster, shafer, and aggregate uncertainty

2014 IEEE Conference on Norbert Wiener in the 21st Century (21CW), 2014
An improved algorithm for calculating Aggregate Uncertainty in Shafer's Evidence Theory is presented and its correctness is proven. A problem with this, and the original algorithm when applied to Dempsters's Theory of Lower and Upper probabilities is then presented.
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

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

Home - About - Disclaimer - Privacy