Skip to main content

A Relational Representation of Belief Functions

  • Conference paper
Belief Functions: Theory and Applications (BELIEF 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8764))

Included in the following conference series:

Abstract

Set operations are one of the most difficult tasks in implementing belief functions for knowledge based systems. The problem becomes intractable because the number of subsets increases exponentially as the frame size increases. In this paper, I propose representing a subset as an integer, and reduce set operations to bitwise operations. I show the superiority of such a representation and demonstrate how, despite its simplicity, the technique has a profound implication in reducing the complexity of belief function computations and makes it possible to organize and store belief functions using relational databases for large projects.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Denoeux, T.: Conjunctive and disjunctive combination of belief functions induced by non distinct bodies of evidence. Artificial Intelligence 172, 234–264 (2006)

    Article  MATH  Google Scholar 

  2. Haenni, R., Lehmann, N.: Implementing belief function computations. International Journal of Intelligent Systems 18 (2003)

    Google Scholar 

  3. Kennes, R.: Computational aspects of the möbius transform of a graph. IEEE Transactions on SMC 22, 201–223 (1992)

    MathSciNet  MATH  Google Scholar 

  4. Kong, A.: Multivariate belief functions and graphical models. Ph.D. thesis, Department of Statistics, Harvard University, Cambridge, MA (1986)

    Google Scholar 

  5. Maurer, W.D., Lewis, T.G.: Hash table methods. ACM Computing Surveys 7(1), 5–19 (1993)

    Article  MATH  Google Scholar 

  6. Smets, P.: Belief funcions: the disjunctive rule of combination and the generalized bayesian theorem. International Journal of Approximate Reasoning 9, 1–35 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  7. Smets, P.: The application of the matrix calculus to belief functions. Int. J. Approximate Reasoning 31, 1–30 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Thoma, H.M.: Factorization of belief functions. Ph.D. thesis, Dept. Statistics, Harvard Univ., Cambridge, MA (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Liu, L. (2014). A Relational Representation of Belief Functions. In: Cuzzolin, F. (eds) Belief Functions: Theory and Applications. BELIEF 2014. Lecture Notes in Computer Science(), vol 8764. Springer, Cham. https://doi.org/10.1007/978-3-319-11191-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11191-9_18

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11190-2

  • Online ISBN: 978-3-319-11191-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics