Results 171 to 180 of about 25,372 (226)
Some of the next articles are maybe not open access.
Fundamentals of the Dempster-Shafer theory
SPIE Proceedings, 2012In this paper, I discuss the basic notions of the Dempster Shafer theory. Using a simple engineering example, I highlight sources of confusion in the Dempster Shafer literature, and some questions that arise in the course of applying the Dempster Shafer algorithm. Finally, I discuss the measure theoretic foundation that reveals the intimate connections
openaire +1 more source
Applied Soft Computing, 2019
There is a strong link between intuitionistic fuzzy set (IFS) and the Dempster–Shafer Theory (DST). It is easy to use this link to provide evident and productive semantics for IFS in terms of DST.
Peide Liu, Hui Gao
semanticscholar +1 more source
There is a strong link between intuitionistic fuzzy set (IFS) and the Dempster–Shafer Theory (DST). It is easy to use this link to provide evident and productive semantics for IFS in terms of DST.
Peide Liu, Hui Gao
semanticscholar +1 more source
A flexible rule for evidential combination in Dempster-Shafer theory of evidence
Applied Soft Computing, 2019Dempster’s combination rule in Dempster–Shafer theory of evidence is widely used to combine multiple pieces of evidence. However, when the evidence is severely conflicting, the result could be counter-intuitive.
Wenjun Ma, Yuncheng Jiang, Xudong Luo
semanticscholar +1 more source
Dempster-Shafer and Possibility Theory
2016The last chapter presents an application of a particular class of normalized capacities (belief and plausibility measures) to the representation of uncertainty. This class has very specific properties and can be obtained through very different approaches (upper and lower probabilities, evidence theory and random sets, at least).
openaire +1 more source
Nonstandard analysis and Dempster-Shafer theory
International Journal of Intelligent Systems, 2000Summary: 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
An approach to assess the value of industrial heritage based on Dempster–Shafer theory
Journal of Cultural Heritage, 2018Industrial heritage associated with political, economic, cultural, social, scientific, technological, and architectural fields has been a crucial concern to nations and governments, since it reveals the way our ancestors lived, records technical progress
Fuying Liu, Qi Zhao, Yulan Yang
semanticscholar +1 more source
Algorithms for Dempster-Shafer Theory
2000The method of reasoning with uncertain information known as Dempster-Shafer theory arose from the reinterpretation and development of work of Arthur Dempster [Dempster, 1967; 1968] by Glenn Shafer in his book a mathematical theory of evidence [Shafer, 1976], and further publications e.g., [Shafer, 1981; 1990].
openaire +1 more source
Communications in Statistics - Theory and Methods, 2019
Cross entropy is an important index for determining the divergence between two sets or distributions. Most existing cross entropy are proposed in a fuzzy environment and undefined in some uncertain situations (e.g., Dempster–Shafer theory).
M. Khalaj +3 more
semanticscholar +1 more source
Cross entropy is an important index for determining the divergence between two sets or distributions. Most existing cross entropy are proposed in a fuzzy environment and undefined in some uncertain situations (e.g., Dempster–Shafer theory).
M. Khalaj +3 more
semanticscholar +1 more source
Fast algorithms for Dempster-Shafer theory
2005The 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 +1 more source