Skip to main content

Frequent Itemset Mining from Databases Including One Evidential Attribute

  • Conference paper
Scalable Uncertainty Management (SUM 2008)

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

Included in the following conference series:

Abstract

Frequent Itemset Mining (FIM) problem has been extensively tackled in the context of perfect data. However, real applications showed that data are often imperfect (incomplete and/or uncertain) which leads to the need of FIM algorithms that process imperfect databases. In this paper we propose a new algorithm for mining frequent itemsets from databases including exactly one evidential attribute. An evidential attribute is an attribute that could have uncertain values modelled via the evidence theory, i.e., a basic belief assignment. We introduce in this paper a variant of the structure Belief Itemset Tree (BIT) for mining frequent itemsets from evidential data and we lead some experiments that showed efficiency of our mining algorithm compared to the existing ones.

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. Agrawal, R., Imielinski, T., Swami., A.: Mining Association Rules Between Sets of Items in Large Databases. In: Proceedings ACM SIGMOD International Conference on Management of Data, pp. 207–216 (1993)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487–499 (1994)

    Google Scholar 

  3. Bach Tobji, M.-A., Ben Yaghlane, 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, Malaga, Spain (2008)

    Google Scholar 

  4. Chen, G., Wei, Q.: Fuzzy association rules and the extended mining algorithms. Information Sciences-Informatics and Computer Science 147(1-4), 201–228 (2002)

    MATH  MathSciNet  Google Scholar 

  5. Chui, C.-K., Kao, B., Hung, E.: Mining Frequent Itemsets from Uncertain Data. In: The 11th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 47–58 (2007)

    Google Scholar 

  6. Dempster, A.P.: Upper and Lower Probabilities Induced by a Multivalue Mapping. Annals of Mathematical Statistics 38(2), 325–339 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dubois, D., Hullermeier, E., Prade, H.: A systematic approach to the assessment of fuzzy association rules. Data Mining and Knowledge Discovery 13(2), 167–192 (2006)

    Article  MathSciNet  Google Scholar 

  8. Djouadi, Y., Redaoui, S., Amroun, K.: Mining Association Rules under Imprecision and Vagueness: towards a Possibilistic Approach. In: Intl. Fuzzy Systems Conference, (23-26), pp. 1–6 (2007)

    Google Scholar 

  9. Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proceedings of the 2000 ACM-SIGMOD International Conference on Management of Data, pp. 1–12 (2000)

    Google Scholar 

  10. Hewawasam, K.K.R.G.K., Premaratne, K., Subasingha, S.P., Shyu, M.-L.: Rule Mining and Classification in Imperfect Databases. In: Proceedings of the Seventh International Conference on Information Fusion, pp. 661–668 (2005)

    Google Scholar 

  11. Konias, S., Chouvarda, I., Vlahavas, I., Maglaveras, N.: A Novel Approach for Incremental Uncertainty Rule Generation from Databases with Missing Values Handling: Application to Dynamic Medical Databases. Medical Informatics and The Internet in Medicine 30(3), 211–225 (2005)

    Article  Google Scholar 

  12. Leung, C.K.-S., Carmichael, C.L., Hao, B.: Efficient Mining of Frequent Patterns from Uncertain Data. In: Proceedings of the Seventh IEEE International Conference on Data Mining, pp. 489–494 (2007)

    Google Scholar 

  13. Lucchese, C., Orlando, S., Perego, R., Palmerini, P., Perego, R., Silvestri, F.: kDCI: A Multi-Strategy Algorithm for Mining Frequent Sets. In: Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations (2003)

    Google Scholar 

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

    MATH  Google Scholar 

  15. Smets, P.: The Application of the Transferable Belief Model to Diagnostic Problems. Int. J. Intelligent Systems 13, 127–158 (1998)

    Article  MATH  Google Scholar 

  16. Vaughn, R.B., Farrell, J., Henning, R., Knepper, M., Fox, K.: Sensor Fusion and Automatic Vulnerability Analysis. In: Proceedings of the 4th international symposium on Information and communication technologies, pp. 230–235 (2005)

    Google Scholar 

  17. Wang, X., Borgelt, C., Kruse, R.: Mining Fuzzy Frequent Item Sets. In: Proceedings of the 11th International Fuzzy Systems Association World Congress, pp. 528–533 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bach Tobji, M.A., Ben Yaghlane, B., Mellouli, K. (2008). Frequent Itemset Mining from Databases Including One Evidential Attribute. In: Greco, S., Lukasiewicz, T. (eds) Scalable Uncertainty Management. SUM 2008. Lecture Notes in Computer Science(), vol 5291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87993-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87993-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87992-3

  • Online ISBN: 978-3-540-87993-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics