Skip to main content

A New Formalism for Evidential Databases

  • Conference paper
  • First Online:
Foundations of Intelligent Systems (ISMIS 2015)

Abstract

This paper is about modeling and querying evidential databases. This kind of databases copes with imperfect data which are modeled via the evidence theory. Existing works on such data deal only with the compact form of the database. In this article, we propose a new formalism for modeling and querying evidential databases based on the possible worlds form. This work is a first step toward the definition of a strong representation system.

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 EPUB and 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

References

  1. Tobji, M.A.B., Yaghlane, B.B., Mellouli, K.: A new algorithm for mining frequent itemsets from evidential databases. In: Proceedings of the 12th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, MĆ”laga, Spain, pp. 1535ā€“1542 (2008)

    Google ScholarĀ 

  2. Bell, D.A., Guan, J.W., Lee, S.K.: Generalized union and project operations for pooling uncertain and imprecise information. Data Knowl. Eng. 18, 89ā€“117 (1996)

    ArticleĀ  MATHĀ  Google ScholarĀ 

  3. Hariz, S.B., Elouedi, Z.: New dynamic clustering approaches within belief function framework. Intell. Data Anal. 18(3), 409ā€“428 (2014)

    Google ScholarĀ 

  4. Bosc, P., Pivert, O.: About projection-selection-join queries addressed to possibilistic relational databases. IEEE Trans. Fuzzy Syst. 13(1), 124ā€“139 (2005)

    ArticleĀ  Google ScholarĀ 

  5. Cavallo, R., Pittarelli, M.: The theory of probabilistic databases. In: Proceedings of the Thirteenth VLDB Conference, Brighton, pp. 71ā€“81 (1987)

    Google ScholarĀ 

  6. Choenni, S., Blok, H.E., Leertouwer, E.: Handling uncertainty and ignorance in databases: a rule to combine dependent data. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 310ā€“324. Springer, Heidelberg (2006)

    ChapterĀ  Google ScholarĀ 

  7. Dempster, A.P.: Upper and lower probabilities induced by a multiple valued mapping. Ann. Math. Stat. 38(2), 325ā€“339 (1967)

    ArticleĀ  MathSciNetĀ  MATHĀ  Google ScholarĀ 

  8. Elmi, S., Benouaret, K., Hadjali, A., Tobji, M.A.B., Yaghlane, B.B.: Computing skyline from evidential data. In: Straccia, U., CalƬ, A. (eds.) SUM 2014. LNCS, vol. 8720, pp. 148ā€“161. Springer, Heidelberg (2014)

    Google ScholarĀ 

  9. Hewawasam, K.K.R.G.K., Premaratne, K., Shyu, M.-L.: Rule mining and classification in a situation assessment application: a belief theoretic approach for handling data imperfections. IEEE Trans. Syst. Man Cybern. 37(6), 1446ā€“1459 (2007)

    ArticleĀ  Google ScholarĀ 

  10. Lee, S.K.: An extended relational database model for uncertain and imprecise information. In: Proceedings of the 18th Conference on Very Large Data Bases, Canada, pp. 211ā€“220 (1992)

    Google ScholarĀ 

  11. Lee, S.K.: Imprecise and uncertain information in databases: an evidential approach. In: Proceedings of the 8th International Conference on Data Engineering, pp. 614ā€“621 (1992)

    Google ScholarĀ 

  12. Samet, A., LefĆØvre, E., Yahia, S.B.: Mining frequent itemsets in evidential database. In: Huynh, V.N., Denoeux, T., Tran, D.H., Le, A.C., Pham, B.S. (eds.) KSE 2013, Part II. AISC, vol. 245, pp. 377ā€“388. Springer, Heidelberg (2014)

    ChapterĀ  Google ScholarĀ 

  13. Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976)

    MATHĀ  Google ScholarĀ 

  14. Smets, P.: Belief functions: the disjunctive rule of combination and the generalized bayesian theorem. Int. J. Approximate Reasoning 9, 1ā€“35 (1993)

    ArticleĀ  MathSciNetĀ  MATHĀ  Google ScholarĀ 

  15. Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets Syst. 1, 3ā€“28 (1978)

    ArticleĀ  MathSciNetĀ  MATHĀ  Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fatma Ezzahra Bousnina .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Bousnina, F.E., Bach Tobji, M.A., Chebbah, M., LiƩtard, L., Ben Yaghlane, B. (2015). A New Formalism for Evidential Databases. In: Esposito, F., Pivert, O., Hacid, MS., RƔs, Z., Ferilli, S. (eds) Foundations of Intelligent Systems. ISMIS 2015. Lecture Notes in Computer Science(), vol 9384. Springer, Cham. https://doi.org/10.1007/978-3-319-25252-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25252-0_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25251-3

  • Online ISBN: 978-3-319-25252-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics