Results 141 to 150 of about 1,315 (181)
Some of the next articles are maybe not open access.

Pooling expert opinions using Dempster-Shafer theory of evidence

1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, 2002
We propose a method based on Dempster-Shafer theory of evidence, to pool expert judgements about the hypotheses of the studied field and to get an assessment and even a ranking of the different scenarios. We start by presenting scenarios, then we describe an aggregation method of expertise based on probabilities and its limitations. Finally, we propose
K. Mellouli, Z. Elouedi
openaire   +1 more source

Combining nonspecificity measures in Dempster–Shafer theory of evidence

International Journal of General Systems, 2011
In Dempster–Shafer theory (DST) of evidence coexist two types of uncertainty: conflict and nonspecificity. The maximum of entropy is a total uncertainty measure that verifies an important set of properties in this theory. We prove that this function has a fault of sensibility to changes in evidence in situations where only the part of nonspecificity is
openaire   +1 more source

An Improved Algorithm for Dempster-Shafer Theory of Evidence

2009 International Conference on Electronic Commerce and Business Intelligence, 2009
The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the major points of criticism this formalism has to face. Various approximation algorithms have been suggested that aim at overcoming this difficulty. This paper presents an improved practical algorithm through reducing the number of focal elements in the ...
Yan Chenghua, Chen Qixiang
openaire   +1 more source

An improved algorithm for Dempster-Shafer theory of evidence

2008 3rd International Conference on Intelligent System and Knowledge Engineering, 2008
The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the major points of criticism this formalism has to face. Various approximation algorithms have been suggested that aim at overcoming this difficulty. This paper presents an improved practical algorithm through reducing the number of focal elements in the ...
null Qing Ye   +2 more
openaire   +1 more source

Dempster-Shafer evidence theory-application approach

AIP Conference Proceedings, 2023
T. Haripriya   +3 more
openaire   +1 more source

Intelligent control system using Dempster-Shafer theory of evidence

SPIE Proceedings, 2004
This paper presents an intelligent control system for robust and adaptive control of non-linear, time-variant systems operating under uncertain conditions. The approach is based on Dempster-Shafer theory of evidence and Dempster’s rule for combining beliefs.
openaire   +1 more source

Information Retrieval and Dempster-Shafer’s Theory of Evidence

1998
This paper describes the use of the Dempster-Shafer theory of evidence to construct an information retrieval model that aims to capture four essential features of information: structure, significance, uncertainty and partiality. We show that Dempster-Shafer’s initial framework allows the representation of the structure and the significance of ...
openaire   +1 more source

Connections between rough set theory and Dempster-Shafer theory of evidence

International Journal of General Systems, 2002
In rough set theory there exists a pair of approximation operators, the upper and lower approximations, whereas in Dempster-Shafer theory of evidence there exists a dual pair of uncertainty measures, the plausibility and belief functions. It seems that there is some kind of natural connection between the two theories.
Wei-Zhi Wu, Yee Leung, Wen-Xiu Zhang
openaire   +1 more source

Multigranulation information fusion: A Dempster-Shafer evidence theory-based clustering ensemble method

Information Sciences, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Feijiang   +3 more
openaire   +1 more source

Rate-Unknown Image Steganalysis Based on Dempster-Shafer Evidence Theory

2012 Fourth International Conference on Multimedia Information Networking and Security, 2012
The existing detection algorithms are difficult to obtain high detection accuracy when applied to the condition, in which the embedding rate of the stego-images is unknown. Therefore, it is very difficult to adopt the existing image steganalysis techniques in the design of a practical covert communication detection system.
Baoji Wan   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy