Skip to main content

Enhancing SWF for Incremental Association Mining by Itemset Maintenance

  • Conference paper
  • First Online:
Advances in Knowledge Discovery and Data Mining (PAKDD 2003)

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

Included in the following conference series:

  • 1196 Accesses

Abstract

Incremental association mining refers to the maintenance and utilization of the knowledge discovered in the previous mining operations for later association mining. Sliding window filtering (SWF) is a technique proposed to filter false candidate 2-itemsets by segmenting a transaction database into partitions. In this paper, we extend SWF by incorporating previously discovered information and propose two algorithms to boost the performance for incremental mining. The first algorithm FI_SWF (SWF with Frequent Itemset) reuses the frequent itemsets of previous mining task to reduce the number of new candidate itemsets that have to be checked. The second algorithm CI_SWF (SWF with Candidate Itemset) reuses the candidate itemsets from the previous mining task. Experiments show that the new proposed algorithms are significantly faster than SWF.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. R. Agarwal, C. Aggarwal, and V. V. V Prasad. A tree projecction algorithm for generation of frequent itemsets. Journal of Parallel and Distributed Computing (Special Issue on High Performance Data Mining), 2000.

    Google Scholar 

  2. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of ACMSIGMOD, pages 207–216, May 1993.

    Google Scholar 

  3. M.-S. Chen C.-H. Lee, C.-R. Lin. Sliding-window filtering: An efficient algorithm for incremental mining. In Intl. Conf. on Information and Knowledge Management (CIKM01), pages 263–270, November 2001.

    Google Scholar 

  4. D. Cheung, J. Han, V. Ng, and C.Y. Wong. Maintenance of discovered association rules in large databases: An incremental updating technique. In Data Engineering, pages 106–114, February 1996.

    Google Scholar 

  5. D. Cheung, S.D. Lee, and B. Kao. A general incremental technique for updaing discovered association rules. In Intercational Conference On Database Systems For Advanced Applications, April 1997.

    Google Scholar 

  6. J. Han and J. Pei. Mining frequent patterns by pattern-growth: Methodology and implications. In ACM SIGKDD Explorations (Special Issue on Scaleble Data Mining Algorithms), December 2000.

    Google Scholar 

  7. J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M.-C. Hsu. Freespan: Frequent parrten-projected sequential pattern mining. In Knowledge Discovery and DAta Mining, pages 355–359, August 2000.

    Google Scholar 

  8. J.-L. Lin and M.H. Dumham. Mining association rules: Anti-skew algorithms. In Proc. of 1998 Int’l Conf. on Data Engineering, pages 486–493, 1998.

    Google Scholar 

  9. J.-S Park, M.-S Chen, and P.S Yu. Using a hash-based method with transaction trimming for minng association rules. In IEEE Transactions on Knowledge and Data Engineering, volume 9, pages 813–825, October 1997.

    Google Scholar 

  10. J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent itemsets with convertible constraints. In Proc. of 2001 Int. Conf. on Data Engineering, 2001.

    Google Scholar 

  11. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of the 21th International Conference on Very Large Data Bases, pages 432–444, September 1995.

    Google Scholar 

  12. A. Veloso, B. Possas, W. Meira Jr., and M. B. de Carvalho. Knowledge management in association rule mining. In Integrating Data Mining and Knowledge Management, 2001.

    Google Scholar 

  13. Z. Zhou and C.I. Ezeife. A low-scan incremental association rule maintenance method. In Proc. of the 14th Conadian Conference on Artificial Intelligence, June 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, CH., Yang, SH. (2003). Enhancing SWF for Incremental Association Mining by Itemset Maintenance. In: Whang, KY., Jeon, J., Shim, K., Srivastava, J. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2003. Lecture Notes in Computer Science(), vol 2637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36175-8_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-36175-8_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-04760-5

  • Online ISBN: 978-3-540-36175-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics