Faithful Approximations of Belief Functions
A conceptual foundation for approximation of belief functions is proposed and investigated. It is based on the requirements of consistency and closeness. An optimal approximation is studied. Unfortunately, the computation of the optimal approximation turns out to be intractable. Hence, various heuristic methods are proposed and experimantally evaluated both in terms of their accuracy and in terms of the speed of computation. These methods are compared to the earlier proposed approximations of belief functions.
Keywords: approximations, belief functions, consistency
PS Link: ftp://ftp.medcomp.comp.nus.edu.sg/pub/davidh/uai99.ps
PDF Link: /papers/99/p271-harmanec.pdf
AUTHOR = "David Harmanec
TITLE = "Faithful Approximations of Belief Functions",
BOOKTITLE = "Proceedings of the Fifteenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-99)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "1999",
PAGES = "271--278"