We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Guan Jiwen, D.A.Bell. General Algorithms for Barnett s Structure in Evidential Reasoning[J]. Journal of Computer Science and Technology, 1995, 10(6): 518-535.
Citation: Guan Jiwen, D.A.Bell. General Algorithms for Barnett s Structure in Evidential Reasoning[J]. Journal of Computer Science and Technology, 1995, 10(6): 518-535.

General Algorithms for Barnett s Structure in Evidential Reasoning

More Information
  • Published Date: November 09, 1995
  • A major problem encountered when applications of the Dempster-Shafer ev-idence handling methods are contemplated is the computational complekity of the basic operations. Barnett has proposed a linear-time computational tech-nique for use in evidential reasoning. However, it is restricted to the entire orthogonal sum of dichotomous evidential functions. This means that there has to be a piece of evidence for each contender for the choice being made. This paper presents more general algorithms for combining d…
  • [1]
    Shafer G. A Mathematical Theory of Evidence. Princeton University Press, Princeton, New Jersey, 1976.
    [2]
    Guan J W, Bell D A. Evidence theory and its applications. Studies in, Computer Science and Artificial Intelligence, 7-8, Vol.l-2, Elsevier, North-Holland, 1991-2.
    [3]
    Barnett.J.A. Computational methuds for a mathematical theory of evidence. In Proc. Seventh International Joint Conference on Artificial Intelligence (IJCAI) 1981, pp.868-875. ………….

Catalog

    Article views (22) PDF downloads (1314) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return