ML Anthology

Markov Chain Monte-Carlo Algorithms for the Calculation of Dempster-Shafer Belief

Serafín Moral, Nic Wilson
AAAI 1994 pp. 269-274
/aaai/1994/moral1994aaai-markov/

Abstract

A simple Monte-Carlo algorithm can be used to calculate Dempster-Shafer belief very efficiently unless the conflict between the evidences is very high. This paper introduces and explores Markov Chain Monte-Carlo algorithms for calculating Dempster-Shafer belief that can also work well when the conflict is high.

PDF AAAI Semantic Scholar

Cite

Text

Moral and Wilson. "Markov Chain Monte-Carlo Algorithms for the Calculation of Dempster-Shafer Belief." AAAI Conference on Artificial Intelligence, 1994.

Markdown

[Moral and Wilson. "Markov Chain Monte-Carlo Algorithms for the Calculation of Dempster-Shafer Belief." AAAI Conference on Artificial Intelligence, 1994.](https://mlanthology.org/aaai/1994/moral1994aaai-markov/)

BibTeX

@inproceedings{moral1994aaai-markov,
  title     = {{Markov Chain Monte-Carlo Algorithms for the Calculation of Dempster-Shafer Belief}},
  author    = {Moral, Serafín and Wilson, Nic},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1994},
  pages     = {269-274},
  url       = {https://mlanthology.org/aaai/1994/moral1994aaai-markov/}
}