Ulster University Logo

An Efficient Triplet-Based Algorithm for Evidential Reasoning

Bi, Yaxin (2008) An Efficient Triplet-Based Algorithm for Evidential Reasoning. International Journal of Intelligent Systems, 23 (4). pp. 483-516. [Journal article]

Full text not available from this repository.

DOI: 10.1002/int.20278


Linear-time computational techniques based on the structure of an evidence space have beendeveloped for combining multiple pieces of evidence using Dempster’s rule (orthogonal sum),which is available on a number of contending hypotheses. They offer a means of making thecomputation-intensive calculations involved more efficient in certain circumstances. Unfortunately,they restrict the orthogonal sum of evidential functions to the dichotomous structure thatapplies only to elements and their complements. In this paper, we present a novel evidence structurein terms of a triplet and a set of algorithms for evidential reasoning. The merit of this structureis that it divides a set of evidence into three subsets, distinguishing the trivial evidential elementsfrom the important ones—focusing particularly on some elements of an evidence space. It avoidsthe deficits of the dichotomous structure in representing the preference of evidence and estimatingthe basic probability assignment of evidence. We have established a formalism for this structureand the general formulae for combining pieces of evidence in the form of the triplet, which havebeen theoretically and empirically justified. C

Item Type:Journal article
Faculties and Schools:Faculty of Computing & Engineering
Faculty of Computing & Engineering > School of Computing and Mathematics
Research Institutes and Groups:Computer Science Research Institute
Computer Science Research Institute > Artificial Intelligence and Applications
ID Code:11690
Deposited By: Dr Yaxin Bi
Deposited On:05 Jan 2012 13:45
Last Modified:05 Jan 2012 13:45

Repository Staff Only: item control page