Skip to main content

Random Generation of Mass Functions: A Short Howto

  • Conference paper
Belief Functions: Theory and Applications

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 164))

Abstract

As Dempster-Shafer theory spreads in different applications fields involving complex systems, the need for algorithms randomly generating mass functions arises. As such random generation is often perceived as secondary, most proposed algorithms use procedures whose sample statistical properties are difficult to characterize. Thus, although they produce randomly generated mass functions, it is difficult to control the sample statistical laws. In this paper, we briefly review classical algorithms, explaining why their statistical properties are hard to characterize, and then provide simple procedures to perform efficient and controlled random generation.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shafer, G.: A mathematical Theory of Evidence. Princeton University Press, New Jersey (1976)

    MATH  Google Scholar 

  2. Smets, P., Kennes, R.: The transferable belief model. Artificial Intelligence 66, 191–234 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Klir, G.J.: Uncertainty and Information. John Wiley & Sons, Inc., Hoboken (2005)

    Book  Google Scholar 

  4. Jousselme, A.-L., Maupin, P.: Distances in evidence theory: Comprehensive survey and generalizations. International Journal of Approximate Reasoning (2011) (accepted manuscript) (in press)

    Google Scholar 

  5. Shafer, G., Shenoy, P.P.: Local computation on hypertrees. Working paper No. 201, School of Business, University of Kansas (1988)

    Google Scholar 

  6. Bauer, M.: Approximation algorithms and decision making in the dempster-shafer theory of evidence - an empirical study. Int. J. Approx. Reasoning 17(2-3), 217–237 (1997)

    Article  MATH  Google Scholar 

  7. Jousselme, A.-L., Maupin, P.: On some properties of distances in evidence theory. In: Proceedings of the Workshop on Theory of Belief Functions (2010)

    Google Scholar 

  8. Cuzzolin, F.: A geometric approach to the theory of evidence. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 38(4), 522–534 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Thomas Burger .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burger, T., Destercke, S. (2012). Random Generation of Mass Functions: A Short Howto. In: Denoeux, T., Masson, MH. (eds) Belief Functions: Theory and Applications. Advances in Intelligent and Soft Computing, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29461-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29461-7_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29460-0

  • Online ISBN: 978-3-642-29461-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics