An Improved Algorithm for Dempster-Shafer Theory of Evidence
The computational complexity of reasoning within theDempster-Shafer theory of evidence is one of the majorpoints of criticism this formalism has to face.Variousapproximation algorithms have been suggested that aim atovercoming this difficulty.This paper presents animproved practical algorithm through reducing the numberof focal elements in the belief function involved.In thisproposed algorithm,all focal elements of every piece ofevidence are classified into dereliction and remainder,andthe basic probability assignments of those derelictions arereassigned to the remainders when they are correlative orthe dereliction is nested to the remainder.Furthermore,theeffect of the dereliction is considered well to influence thecombination in this paper,and the computation andaccuracy is taken into account to develop this proposedalgorithm.Finally,an illustrative example shows that theimproved practical algorithm is effective and feasiblethrough comparing with other approximations.
Qing Ye Xiaoping Wu Dingjun Zhai
College of Electronic Engineering,Naval University of Engineering 717 Jiefang Road,Wuhan 430033,Hubei Province,China
国际会议
厦门
英文
13-18
2008-11-17（万方平台首次上网日期，不代表论文的发表时间）