Skip to main content

Incremental Maintenance of Frequent Itemsets in Evidential Databases

  • Conference paper

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

Abstract

In the last years, the problem of Frequent Itemset Mining (FIM) from imperfect databases has been sufficiently tackled to handle many kinds of data imperfection. However, frequent itemsets discovered from databases describe only the current state of the data. In other words, when data are updated, the frequent itemsets could no longer reflect the data, i.e., the data updates could invalidate some frequent itemsets and vice versa, some infrequent ones could become valid. In this paper, we try to resolve the problem of Incremental Maintenance of Frequent Itemsets (IMFI) in the context of evidential data. We introduce a new maintenance method whose experimentations show efficiency compared to classic methods.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. Bach Tobji, M.-A., Abrougui, A., Ben Yaghlane, B.: GUFI: A New Algorithm for General Updating of Frequent Itemsets. In: 11th IEEE International Conference on CSE Workshops, San Paulo, Brazil, pp. 45–52 (2008)

    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 IPMU, Malaga, Spain, pp. 1535–1542 (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  Google Scholar 

  5. Cheung, D.-W., Han, H., Ng, N.-T.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Update technique. In: Proceedings of The Twelfth International Conference on Data Engineering, pp. 106–114 (1996)

    Google Scholar 

  6. 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  Google Scholar 

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

    Google Scholar 

  8. 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 

  9. 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 

  10. Hong, T.-P., Huang, T.-J.: Maintenance of Generalized Association Rules for Record Deletion Based on the Pre-Large Concept. In: International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases, pp. 142–146 (2007)

    Google Scholar 

  11. Imielinski, T., Mannila, H.: A Database Perspective On Knowledge Discovery. Communications of the ACM 39(11), 58–64 (1996)

    Article  Google Scholar 

  12. 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 

  13. 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 

  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. Zhao, Q., Bhowmick, S.-S.: Association Rule Mining: A survey. Technical Report, CAIS, Nanyang Technological University, Singapore, 2003116 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bach Tobji, M.A., Ben Yaghlane, B., Mellouli, K. (2009). Incremental Maintenance of Frequent Itemsets in Evidential Databases. In: Sossai, C., Chemello, G. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2009. Lecture Notes in Computer Science(), vol 5590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02906-6_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02906-6_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02905-9

  • Online ISBN: 978-3-642-02906-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics