ML Anthology

Can Evidence Be Combined in the Dempster-Shafer Theory?

John Yen
UAI 1987 pp. 63-72
doi:10.1016/0888-613x(88)90171-5 /uai/1987/yen1987uai-evidence/

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.

PDF UAI Semantic Scholar

Cite

Text

Yen. "Can Evidence Be Combined in the Dempster-Shafer Theory?." Conference on Uncertainty in Artificial Intelligence, 1987. doi:10.1016/0888-613x(88)90171-5

Markdown

[Yen. "Can Evidence Be Combined in the Dempster-Shafer Theory?." Conference on Uncertainty in Artificial Intelligence, 1987.](https://mlanthology.org/uai/1987/yen1987uai-evidence/) doi:10.1016/0888-613x(88)90171-5

BibTeX

@inproceedings{yen1987uai-evidence,
  title     = {{Can Evidence Be Combined in the Dempster-Shafer Theory?}},
  author    = {Yen, John},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1987},
  pages     = {63-72},
  doi       = {10.1016/0888-613x(88)90171-5},
  url       = {https://mlanthology.org/uai/1987/yen1987uai-evidence/}
}