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.
| Original language | English |
|---|---|
| Pages | 269-274 |
| Number of pages | 6 |
| Publication status | Published - 1994 |
| Externally published | Yes |
| Event | Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2) - Seattle, WA, USA Duration: 31 Jul 1994 → 4 Aug 1994 |
Conference
| Conference | Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2) |
|---|---|
| City | Seattle, WA, USA |
| Period | 31/07/94 → 4/08/94 |
Fingerprint
Dive into the research topics of 'Markov Chain Monte-Carlo algorithms for the calculation of Dempster-Shafer belief'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver