Abstract
This paper addresses the approximation of belief functions by minimizing the Euclidean distance to a given belief function in the set of probability functions. The special case of Dempster-Shafer belief functions is considered in particular detail. It turns out that, in this case, an explicit solution by means of a projective transformation can be given. Furthermore, we also consider more general concepts of belief. We state that the approximation by means of minimizing the Euclidean distance, unlike other methods that are restricted to Dempster-Shafer belief, works as well. However, the projective transformation formula cannot necessarily be applied in these more general settings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Laux, Entscheidungstheorie, fourth edition, ( Springer, Heidelberg, 1997 ).
S. French and D. R. Insua, Statistical Decision Theory, first edition, ( Arnold, London, 2000 ).
J. B. Paris, The Uncertain Reasoner’s Companion, fourth edition, ( Cambridge University Press, Cambridge, 1994 ).
I. Pratt, Artificial Intelligence, first edition, ( MacMillan Press, Houndmills, 1994 ).
M. Bauer, “Approximation algorithms and decision making in the Dempster-Shafer theory of evidence — an empirical study”, Internat. J. Approx. Reason. 17 (1997) 217–237.
P. Smets, “Constructing the pignistic probability function in a context of uncertainty”, in Uncertainty in Artificial Intelligence V, eds. M. Herion, R. D. Shachter, L. N. Kanal, and J. Lemmer, ( North-Holland, Amsterdam, 1990 ), pp. 29–39.
B. Tessem, “Approximations for efficient computation in the theory of evidence”, Artificial Intelligence 61(1993) 315–329.
F. Voorbraak, “A computationally efficient approximation of Dempster-Shafer theory”, Int. J. Man-Mach. Stud. 30 (1989) 525–536.
T. Weiler, “Updating Towards Probability Belief”, Master’s thesis, University of Manchester, 1996.
G. Shafer, A Mathematical Theory of Evidence, ( Princeton University Press, Princeton, NJ, 1976 ).
R. F. Curtain and A. J. Pritchard, Functional Analysis in Modern Applied Mathematics, ( Academic Press, London, 1977 ).
B. de Finetti, Theory of Probability, first edition, volume I, ( John Wiley & Sons, New York, 1974 ).
P. Smets, “No Dutch book can be built against the TBM even though update is not obtained by Bayes rule of conditioning”, in Proc. Workshop on Probabilistic Expert Systems, eds. R. Scozzafava, SIS, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weiler, T., Bodenhofer, U. (2002). Approximation of Belief Functions by Minimizing Euclidean Distances. In: Grzegorzewski, P., Hryniewicz, O., Gil, M.Á. (eds) Soft Methods in Probability, Statistics and Data Analysis. Advances in Intelligent and Soft Computing, vol 16. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1773-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1773-7_16
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1526-9
Online ISBN: 978-3-7908-1773-7
eBook Packages: Springer Book Archive