Fast algorithms for Dempster-Shafer theory
The runtime of the usual algorithms computing the transformation of a basic belief assignment into its associated belief function and conversely is an exponential function of the cardinality of (the domain of) the basic belief assignment. In this paper, new algorithms with a polynomial runtime are presented. These algorithms appear to be optimal in the class of the so-called M-algorithms.
KeywordsDempster-Shafer theory Möbius transformation graph computational efficiency
Unable to display preview. Download preview PDF.
- Aigner M. (1979), Combinatorial Theory, Springer-Verlag.Google Scholar
- Barr M., Wells C. (1990), Category Theory for Computing Science, Prentice Hall.Google Scholar
- Kennes R. (1990), Computational Aspects of the Möbius Transformation of a Graph, Technical Report, IRIDIA/90-13, Université Libre de Bruxelles, Brussels, Belgium.Google Scholar
- Shafer G. (1976), A Mathematical Theory of Evidence, Princeton University Press.Google Scholar
- Smets P. (1988), Belief Functions, In Non Standard Logics for Automated Reasoning, 253–286 (Smets P., Mamdani A., Dubois D. and Prade H. editors), Academic Press.Google Scholar
- Thoma H. M. (1989), Factorization of Belief Functions, unpublished Ph.D. thesis, Harvard University, Dept. of Statistics.Google Scholar