D数的距离函数
Distance function of D numbers
摘要:
Dempster-Shafer理论因其表达不确定性信息的能力而被广泛应用于不确定性建模和知识推理中。两个基本概率分配(BPA)之间的距离表示基于Dempster-Shafer证据理论的识别算法的性能度量。然而,一些条件导致了Dempster-Shafer理论在实际应用中的局限性,如排他性假设和完备性约束。为了克服这些缺点,提出了一种新的理论称为D数理论。提出了一种D数的距离函数来度量两个D数之间的距离。D数的距离函数是两个BP算法之间距离的推广,继承了Dempster-Shafer理论的优点,增强了不确定性建模的能力。最后通过一个实例验证了该方法的有效性。
英文摘要:
Dempster-Shafer theory is widely applied in uncertainty modelling and knowledge reasoning due to its ability of expressing uncertain information. A distance between two basic probability assignments(BPAs) presents a measure of performance for identification algorithms based on the evidential theory of Dempster-Shafer. However, some conditions lead to limitations in practical application for Dempster-Shafer theory, such as exclusiveness hypothesis and completeness constraint. To overcome these shortcomings, a novel theory called D numbers theory is proposed. A distance function of D numbers is proposed to measure the distance between two D numbers. The distance function of D numbers is an generalization of distance between two BPAs, which inherits the advantage of Dempster-Shafer theory and strengthens the capability of uncertainty modeling. An illustrative case is provided to demonstrate the effectiveness of the proposed function.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。