J4 ›› 2011, Vol. 38 ›› Issue (2): 187-193.doi: 10.3969/j.issn.1001-2400.2011.02.033

• Original Articles • Previous Articles     Next Articles

Research on the approximation algorithm of the evidential thoeory

MIAO Zhuang;CHENG Yongmei;PAN Quan;HOU Jun   

  1. (College of Automation, Northwestern Polytechnical Univ., Xi'an  710072, China)
  • Received:2010-10-29 Online:2011-04-20 Published:2011-05-26
  • Contact: MIAO Zhuang E-mail:button.miao@163.com

Abstract:

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.

Key words: Dempster-Shafer theory, evidential theory, approximation algorithm, genetic algorithm, data fusion

CLC Number: 

  • TP274