Research on the approximation algorithm of the evidential theory

Zhuang Miao, Yongmei Cheng, Quan Pan, Jun Hou

科研成果: 期刊稿件文章同行评审

2 引用 (Scopus)

摘要

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.

源语言英语
页(从-至)187-193
页数7
期刊Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University
38
2
DOI
出版状态已出版 - 4月 2011

指纹

探究 'Research on the approximation algorithm of the evidential theory' 的科研主题。它们共同构成独一无二的指纹。

引用此