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

• 研究论文 • 上一篇    下一篇

证据推理的近似计算研究

苗壮;程咏梅;潘泉;侯俊   

  1. (西北工业大学 自动化学院,陕西 西安  710072)
  • 收稿日期:2010-10-29 出版日期:2011-04-20 发布日期:2011-05-26
  • 通讯作者: 苗壮
  • 作者简介:苗壮(1978-),男,博士,E-mail: button.miao@163.com.
  • 基金资助:

    国家自然科学基金重点资助项目(60634030);国家自然科学基金资助项目(60702066,60802075);教育部新世纪优秀人才资助项目(NCET-06-0878);航空科学基金资助项目(20090853013);陕西省自然科学基础研究计划资助项目(2010JQ8032);西北工业大学科技创新基金资助项目(2008KJ02025)

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

摘要:

在Dempster-Shafer证据推理中,计算复杂度是它应用面临的主要问题之一,主要方法是减少焦元的数目.通过对置信函数近似的定性和定量分析论证,提出了最优近似算法,并利用遗传算法进行近似计算,给出多步近似和一步近似两个快速算法.仿真表明,两者较其他算法有明显的改进.

关键词: Dempster-Shafer 理论, 证据推理, 近似算法, 遗传算法, 信息融合

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

中图分类号: 

  • TP274