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

From MaRDI portal
Publication:1809376

DOI10.1016/S0888-613X(97)00013-3zbMATH Open0939.68109arXiv1302.3557MaRDI QIDQ1809376FDOQ1809376


Authors: Mathias Bauer Edit this on Wikidata


Publication date: 20 December 1999

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Abstract: The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the main points of criticism this formalism has to face. To overcome this difficulty various approximation algorithms have been suggested that aim at reducing the number of focal elements in the belief functions involved. Besides introducing a new algorithm using this method, this paper describes an empirical study that examines the appropriateness of these approximation procedures in decision making situations. It presents the empirical findings and discusses the various tradeoffs that have to be taken into account when actually applying one of these methods.


Full work available at URL: https://arxiv.org/abs/1302.3557




Recommendations




Cites Work


Cited In (41)





This page was built for publication: Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809376)