Abstract
This article gives an algorithm for the exact implementation of Dempster’s rule in the case of hierarchical evidence. This algorithm is computationally efficient, and it makes the approximation suggested by Gordon and Shortliffe unnecessary. The algorithm itself is simple, but its derivation depends on a detailed understanding of the interaction of hierarchical evidence.
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
Barnett, J.A., Computational methods for a mathematical theory of evidence, in: Proceedings IJCAI-81, Vancouver, BC (1981) 868–875.
Garvey, T.D., Lowrance, J.D. and Fischler, M.A., An inference technique for integrating knowledge from disparate sources, in: Proceedings IJCAI-81, Vancouver, BC (1981) 319–325.
Gordon, J. and Shortliffe, E.H., The Dempster–Shafer theory of evidence, in: B.G. Buchanan and E.H Shortliffe (Eds.), Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project (Addison-Wesley, Reading, MA, 1985) 272–292.
Gordon, J. and Shortliffe, E.H., A method for managing evidential reasoning in a hierarchical hypothesis space, Artificial Intelligence 26 (1985) 323–357.
Kong, A., Multivariate belief functions and graphical models, Doctoral Dissertation, Department of Statistics, Harvard University, Cambridge, MA, 1986.
Mellouli, K., Shafer, G. and Shenoy, P., Qualitative Markov networks, in: International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Paris (1986) 31–35.
Pearl, J., On evidential reasoning in a hierarchy of hypotheses, Artificial Intelligence 28 (1986) 9–15.
Pearl, J., Fusion, propagation, and structuring in belief networks, Artificial Intelligence 29 (1986) 241–288.
Shafer, G., A Mathematical Theory of Evidence (Princeton University Press, Princeton, NJ, 1976.
Shafer, G., Belief functions and possibility measures, in: J.C. Bizdek (Ed.), The Analysis of Fuzzy Information 2 (CRC Press, 1987).
Shafer, G., Probability judgment in artificial intelligence and expert systems, Stat. Sci. 2 (1987) 3–16.
Shafer, G., Hierarchical evidence, in: Proceedings Second Conference on Artificial Intelligence Applications, Miami, FL (1985) 16–21.
Shafer, G., Shenoy, P. and Mellouli, K., Propagating belief functions in qualitative Markov trees, Working Paper No. 190, School of Business, University of Kansas, Lawrence, KS, 1987.
Shenoy, P. and Shafer, G., Propagating belief functions with local computations, IEEE Expert 1(3) (1986) 43–52.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Shafer, G., Logan, R. (2008). Implementing Dempster’s Rule for Hierarchical Evidence. In: Yager, R.R., Liu, L. (eds) Classic Works of the Dempster-Shafer Theory of Belief Functions. Studies in Fuzziness and Soft Computing, vol 219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44792-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-44792-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25381-5
Online ISBN: 978-3-540-44792-4
eBook Packages: EngineeringEngineering (R0)