Skip to main content

Efficient algorithms for belief functions based on the relationship between belief and probability

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 548))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Dempster, A.P. (1967) Upper and Lower Probabilities Induced by a Multi-valued Mapping. Ann. Math, Statist. 38, 325–339.

    Google Scholar 

  • Gordon, J. and Shortliffe, E.H. (1985) A Method of Managing Evidential Reasoning in a Hierarchical Hypothesis Space, Artificial Intelligence, 26, 323–357.

    Google Scholar 

  • Kampke (1988) About Assessing and Evaluating Uncertain Inferences Within the Theory of Evidence. Decision Support Systems 4, 433–439.

    Google Scholar 

  • Kreinovich, V. and Borrett, W. (1990) Monte-Carlo Methods Allow to Avoid Exponential Time in Dempster-Shafer Formalism. Tech.Report UTEP-CS-90-5, Computer Science Dept. University of Texas at El Paso.

    Google Scholar 

  • Kyburg, H.E., Jr. (1987) Bayesian and Non-Bayesian Evidential Updating. Artificial Intelligence 31, 271–293.

    Google Scholar 

  • Pearl, J. (1988) Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann.

    Google Scholar 

  • Shafer, G. and Logan, R. (1987) Implementing Dempster's Rule for Hierarchical Evidence. Artificial Intelligence, 33, 271–298.

    Google Scholar 

  • Shafer and Shenoy, P.P. (1988) Local Computation in Hypertrees, Working Paper No. 201, School of Business, University of Kansas.

    Google Scholar 

  • Kennes, R. and Smets, P. (1990) Computational Aspects of the Mobius Transform. Proc. 6 th Conference on Uncertainty in Artificial Intelligence, Cambridge, Mass.

    Google Scholar 

  • Wasserman, L.A. (1990) Prior Envelopes Based on Belief Functions. Annals of Statistics, 18, 1, 454–464.

    Google Scholar 

  • Wilson, P.N. (1989) Justification, Computational Efficiency and Generalisation of the Dempster-Shafer Theory. Research Report No. 15, Dept. of Computing and Math. Sciences, Oxford Polytechnic. Also to appear in Artificial Intelligence.

    Google Scholar 

  • Wilson, P.N. (1991a) A Monte-Carlo Algorithm for Dempster-Shafer Belief, Research Report, Dept. of Computer Science, Queen Mary and Westfield College. Also to appear in Proceedings of 7 th Conference on Uncertainty in Artificial Intelligence.

    Google Scholar 

  • Wilson, P.N. (1991b) Likelihood Updating of a Belief Function, Research Report, Dept. of Computer Science, Queen Mary and Westfield College, University of London.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Rudolf Kruse Pierre Siegel

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Clarke, M., Wilson, N. (1991). Efficient algorithms for belief functions based on the relationship between belief and probability. In: Kruse, R., Siegel, P. (eds) Symbolic and Quantitative Approaches to Uncertainty. ECSQARU 1991. Lecture Notes in Computer Science, vol 548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54659-6_64

Download citation

  • DOI: https://doi.org/10.1007/3-540-54659-6_64

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54659-7

  • Online ISBN: 978-3-540-46426-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics