Approximation algorithms and decision making in the Dempster-Shafer theory of evidence -An empirical study

International Journal of Approximate Reasoning

Volumn 17, Issue 2-3, 1997, Pages 217-237

  Bauer, Mathias ^a  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

Approximation algorithms; Decision making; Dempster Shafer theory

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; DECISION MAKING; DECISION THEORY;

DEMPSTER-SHAFER THEORY;

APPROXIMATION THEORY;

EID: 0031206656     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0888-613X(97)00013-3     Document Type: Article

References (16)

1. Barnett, J. A., Computational methods for a mathematical theory of evidence, Proceedings of the 7th International Joint Conference on Artificial Intelligence, Vancouver, Canada, 868-875, Aug. 1981.
2. Bauer, M., Justification of plan recognition results, in [14], 647-651.
3. Dempster, A. P., Upper and lower probabilities induced by a multivalued mapping, Ann. Math. Statist. 38, 325-339, 1967.
4. Dubois, D., and Prade, H., Consonant approximations of belief functions, Internat. J. Approx. Reason. 4, 419-449, 1990.
5. Gordon, J., and Shortliffe, E. H., A method of managing evidential reasoning in a hierarchical hypothesis space, Artificial Intelligence 26, 323-357, 1985.
6. Kreinovich, V., Bernat, A., Borrett, W., Mariscal, Y., and Villa, E., Monte-Carlo Methods make Dempster-Shafer formalism feasible. In R. Yager, M. Fedrizzi, and J. Kacprzyk, editors, Advances in the Dempster-Shafter Theory of Evidence, chapter 9, Wiley, 1994.
7. Lowrance, J. D., Garvey, T. D., and Strat, T. M., A framework for evidential-reasoning systems, Proceedings of the 5th National Conference of the American Association for Artificial Intelligence, Philadelphia, 896-903, Aug. 1986.
8. Orponen, P., Dempster's rule of combination is #P-complete, Artificial Intelligence 44, 245-253, 1990.
9. Shenoy, P., and Shafer, G., Axioms for probability and belief-function propagation, in Uncertainty in Artificial Intelligence 4 (R. D. Shachter, T. S. Levitt, L. N. Kanal, and J. F. Lemmer, Eds.), Elsevier, 169-198, 1990.
10. Shafer, G., A Mathematical Theory of Evidence, Princeton U.P., Princeton, N.J., 1976.
11. Smets, P., Belief functions versus probability functions, in Uncertainty and Intelligent Systems, Lecture Notes in Comput. Sci. 313 (B. Bouchon, L. Saitta, and R. Yager, Eds.), 17-24, 1988.
12. Tessem, B., Approximations for efficient computation in the theory of evidence, Artificial Intelligence 61, 315-329, 1993.
13. Voorbraak, F., A computationally efficient approximation of Dempster-Shafer theory, Internat. J. Man-Machine Stud. 30, 525-536, 1989.
14. Wahlster, W., (Ed.), Proceedings of the 12th European Conference on Artificial Intelligence, Budapest, Hungary, 1996.
15. Wilson, N., A Monte-Carlo algorithm for Dempster-Shafer belief, Proceedings of the Seventh Conference on Uncertainty in Artificial Intelligence (B. D'Ambrosio, P. Smets, and P. Bonissone, Eds.), Univ. of Los Angeles, 414-417, 1991.
16. Wilson, N., and Moral, S., Fast Markov chain algorithms for calculating Dempster-Shafer belief, in [14], 672-676.