检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]空军工程大学理学院 [2]空军94891部队
出 处:《计算机应用》2009年第8期2257-2259,2267,共4页journal of Computer Applications
基 金:国家自然科学基金资助项目(60663003)
摘 要:针对Dempster组合规则不能有效组合冲突证据,已有的基于证据间距离的改进组合方法计算复杂度较大的情况,提出了一种证据加权平均组合方法。首先以邓勇等人的组合方法为例计算了基于证据间距离的改进组合方法的计算复杂度,分析了造成计算复杂度较大的原因;然后通过引入证据的不确定性度量概念来描述证据的不确定性并以此为基础定义证据的权重;最后给出算法步骤。理论分析和数值算例表明,该方法能有效融合冲突证据,收敛速度快且降低了计算复杂度。Focusing on the problem that the Dempster's combination rule cannot effectively combine conflict evidences and the high computational complexity of the present solution method based on distance between evidences, a weighted average evidence combination approach was proposed. First, the computational complexity of combination rule proposed by Deng Yong, taken as an instance of combination rules based on distance between evidences, was calculated and analyzed. Then the concept of uncertainty measure of evidence was used to describe the uncertainty of evidence body and as a basis of determining the weight of evidence. The numerical example shows that the evidence combination approach based on uncertainty measure can efficiently combine evidences, whether they conflict with each other or not, with faster convergence speed as well as lower computational complexity compared with those based on the distance between the evidences.
分 类 号:TP181[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117