Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
An Efficient Triplet-based Algorithm for Evidential Reasoning
Yaxin Bi, Jiwen 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.
Pages: 31-38
PS Link:
PDF Link: /papers/06/p31-bi.pdf
AUTHOR = "Yaxin Bi and Jiwen Guan",
TITLE = "An Efficient Triplet-based Algorithm for Evidential Reasoning",
BOOKTITLE = "Proceedings of the Twenty-Second Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-06)",
ADDRESS = "Arlington, Virginia",
YEAR = "2006",
PAGES = "31--38"

hosted by DSL   •   site info   •   help