Skip to main content
SpringerLink
Log in

Incremental Association Mining Based on Maximal Itemsets

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2005)

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

Abstract

Incremental association mining refers to the maintenance and utilization of the knowledge discovered in the previous mining operation for later association mining. In paper, we propose a notion called maximal itemset based on which large itemsets with dynamic minimum support can be identified easily. When new transactions are inserted into a database, the maximal itemsets of the new database can be generated from previous maximal itemsets and new transactions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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., Imielinksi, T., Swami, A.: Mining association rules between sets of items in large database. In: ACM SIGMOD conference, Washington DC, USA, pp. 207–216 (1993)

    Google Scholar 

  2. Agrawal, R., Imielinksi, T., Swami, A.: Database mining: a performance perspective. IEEE Transactions on Knowledge and Data Engineering 5(6), 914–925 (1993)

    Article  Google Scholar 

  3. Arawal, R., Srikant, R.: Fast algorithm for mining association rules. ACM International conference on Very Large Data Bases, 487–499 (1994)

    Google Scholar 

  4. Agrawal, R., Srikant, R.: Mining sequential patterns. IEEE International Conferences on Data Engineering, 3–14 (1995)

    Google Scholar 

  5. Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: ACM SIGMOD Conference, Tucson, Arizona, USA, pp. 255–264 (1997)

    Google Scholar 

  6. Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of discovered association rules in large databases: an incremental updating approach. In: IEEE International Conference on Data Engineering, pp. 106–114 (1996)

    Google Scholar 

  7. Cheung, D.W., Lee, S.D., Kao, B.: ‘A general incremental technique for maintaining discovered association rules. In: Proceedings of Database Systems for Advanced Applications, Melbourne, Australia, pp. 185–194 (1997)

    Google Scholar 

  8. Feldman, R., Aumann, Y., Amir, A., Mannila, H.: Efficient algorithms for discovering frequent sets in incremental databases. In: ACM SIGMOD Workshop on DMKD, pp. 59-66, USA (1997)

    Google Scholar 

  9. Hong, T.P., Wang, C.Y., Tao, Y.H.: A new incremental data mining algorithm using pre-large itemsets. International Journal on Intelligent Data Analysis (2001)

    Google Scholar 

  10. Lee, H.-S.: A fuzziness measure of rough sets. LNCS, vol. 2715, pp. 64–70. Springer, Heidelberg (2003)

    Google Scholar 

  11. Pawlak, Z.: Rough sets, Report No. 431, Polish Academy of Sciences, Institute of Computer Science (1981)

    Google Scholar 

  12. Sarda, N.L., Srinvas, N.V.: An adaptive algorithm for incremental mining of association rules. IEEE InternationalWorkshop on Database and Expert Systems, 240–245 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Shipping and Transportation Management, Department of Computer Science, National Taiwan Ocean University, Keelung, 202, Taiwan, Republic of China

    Hsuan-Shih Lee

Authors
  1. Hsuan-Shih Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Business, La Trobe University, 3086, Melbourne, Victoria, Australia

    Rajiv Khosla

  2. Centre for SMART systems Engineering Research Centre, University of Brighton, Moulsecoomb, BN2 4GJ, Brighton, UK

    Robert J. Howlett

  3. School of Electrical and Information Engineering, Knowledge Based Intelligent Engineering Systems Centre, University of South Australia, 5095, Mawson Lakes, SA, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, HS. (2005). Incremental Association Mining Based on Maximal Itemsets. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11552413_53

Download citation

  • DOI: https://doi.org/10.1007/11552413_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28894-7

  • Online ISBN: 978-3-540-31983-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation