Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings         Authors   Author's Info   Article details         Search    
Can Evidence Be Combined in the Dempster-Shafer Theory?
John Yen
Abstract:
Dempster's rule of combination has been the most controversial part of the Dempster-Shafer (D-S) theory. In particular, Zadeh has reached a conjecture on the noncombinability of evidence from a relational model of the D-S theory. In this paper, we will describe another relational model where D-S masses are represented as conditional granular distributions. By comparing it with Zadeh's relational model, we will show how Zadeh's conjecture on combinability does not affect the applicability of Dempster's rule in our model.
Keywords: Dempster-Shafer, Zadeh's relational model
Pages: 63-69
PS Link:
PDF Link: /papers/87/p63-yen.pdf
BibTex:
@INPROCEEDINGS{Yen87,
AUTHOR = "John Yen ",
TITLE = "Can Evidence Be Combined in the Dempster-Shafer Theory?",
BOOKTITLE = "Uncertainty in Artificial Intelligence 3 Annual Conference on Uncertainty in Artificial Intelligence (UAI-87)",
PUBLISHER = "Elsevier Science",
ADDRESS = "Amsterdam, NL",
YEAR = "1987",
PAGES = "63--69"
}


hosted by DSL   •   site info   •   help