arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1206.6823cs.AI
收藏

一种有效的基于三元组的证据推理算法

An Efficient Triplet-based Algorithm for Evidential Reasoning

Yaxin Bi, Jiwen W. Guan

摘要:

线性时间计算技术已经发展起来,结合证据,这是一个有争议的假设。它们提供了一种使计算密集型计算在某些情况下更有效的方法。不幸的是,他们限制了证据功能的正交和的二分法结构只适用于元素和他们的补充。在本文中,我们提出了一种新的证据结构的三元组和证据推理算法。这种结构的优点在于它将一组证据分为三个子集,区分了琐碎的证据元素和集中于某些特定元素的重要证据元素。它避免了二分结构在表示证据偏好和估计证据基本概率分配方面的不足。我们已经建立了一个形式主义的这种结构和合并的证据在三元组的形式,这已在理论上证明的一般公式。

英文摘要:

Linear-time computational techniques have been developed for combining evidence which is available on a number of contending hypotheses. They offer a means of making the computation-intensive calculations involved more efficient in certain circumstances. Unfortunately, they restrict the orthogonal sum of evidential functions to the dichotomous structure applies only to elements and their complements. In this paper, we present a novel evidence structure in terms of a triplet and a set of algorithms for evidential reasoning. The merit of this structure is that it divides a set of evidence into three subsets, distinguishing trivial evidential elements from important ones focusing some particular elements. It avoids the deficits of the dichotomous structure in representing the preference of evidence and estimating the basic probability assignment of evidence. We have established a formalism for this structure and the general formulae for combining pieces of evidence in the form of the triplet, which have been theoretically justified.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑