By Topic

An improved algorithm for Dempster-Shafer theory of evidence

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Qing Ye ; Coll. of Electron. Eng., Naval Univ. of Eng., Wuhan, China ; Xiaoping Wu ; Dingjun Zhai

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 belief function involved. In this proposed algorithm, all focal elements of every piece of evidence are classified into dereliction and remainder, and the basic probability assignments of those derelictions are reassigned to the remainders when they are correlative or the dereliction is nested to the remainder. Furthermore, the effect of the dereliction is considered well to influence the combination in this paper, and the computation and accuracy is taken into account to develop this proposed algorithm. Finally, an illustrative example shows that the improved practical algorithm is effective and feasible through comparing with other approximations.

Published in:

Intelligent System and Knowledge Engineering, 2008. ISKE 2008. 3rd International Conference on  (Volume:1 )

Date of Conference:

17-19 Nov. 2008