TY - JOUR
T1 - Research on the approximation algorithm of the evidential theory
AU - Miao, Zhuang
AU - Cheng, Yongmei
AU - Pan, Quan
AU - Hou, Jun
PY - 2011/4
Y1 - 2011/4
N2 - In the Dempster-Shafer theory, the computational complexity is one of the main points of criticism this theory has to face. To solve this problem, many approximation algorithms, which always reduce the focal elements, are proposed. In this paper, a simple optimal approximation is proposed by analyzing its reasonability in quality and quantity. The genetic algorithm is applied for approximation for the first time. Then two fast algorithms, one step approximation and multi-step approximation, are proposed. As a conclusion of simulation these algorithms are better than other algorithms in accuracy and computation burden.
AB - In the Dempster-Shafer theory, the computational complexity is one of the main points of criticism this theory has to face. To solve this problem, many approximation algorithms, which always reduce the focal elements, are proposed. In this paper, a simple optimal approximation is proposed by analyzing its reasonability in quality and quantity. The genetic algorithm is applied for approximation for the first time. Then two fast algorithms, one step approximation and multi-step approximation, are proposed. As a conclusion of simulation these algorithms are better than other algorithms in accuracy and computation burden.
KW - Approximation algorithm
KW - Data fusion
KW - Dempster-Shafer theory
KW - Evidential theory
KW - Genetic algorithm
UR - http://www.scopus.com/inward/record.url?scp=79955976571&partnerID=8YFLogxK
U2 - 10.3969/j.issn.1001-2400.2011.02.033
DO - 10.3969/j.issn.1001-2400.2011.02.033
M3 - 文章
AN - SCOPUS:79955976571
SN - 1001-2400
VL - 38
SP - 187
EP - 193
JO - Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University
JF - Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University
IS - 2
ER -