利用二叉树实现最优证据选择方法  

Optimal Evidence Selection Method Using Binary Tree

作　　者：李文艺[1] 岳明道[1] 吕现钊[1] 韩君[1] 

机构地区：[1]宿州学院机械与电子信息工程学院,安徽宿州234000

出　　处：《安阳工学院学报》2014年第2期50-53,共4页Journal of Anyang Institute of Technology

基　　金：安徽省教育厅自然科学基金项目(KJ2013B284);宿州学院硕士科研启动基金项目(2009yss08;2009yss07)

摘　　要：给出了一种从冲突证据中选择一组最优证据的方法,该方法解决了冲突证据合成结果可能出错的问题。给出了证据量与证据离散度的概念,并证明了相关定理。首先利用证据离散度选择出确定程度较大的证据,然后构造出二叉树,并给出了利用二叉树实现最优证据选择的具体步骤。该方法可以减少计算量,可以解决证据冲突问题。In order to solve the problem of the conflict evidences combination get a wrong result, a new method that could select a group of optimal evidences from conflict evidences is presented.The definition of the evi-dence volume and evidence discrete degree were presented, and some theorems were proved.Firstly,the positive evidences were selected based on the evidence discrete degree, then the binary tree was constructed ,and the opti-mal evidence selection procedure was presented using binary tree.This method could reduce the calculation bur-den.The experiment results show that it could solve the evidence conflict problem.

关 键 词：证据理论 最优证据 冲突证据 二叉树 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]