Abstract
In this paper, we propose an algorithm for maintaining the frequent itemsets discovered in a database with minimal re-computation when new transactions are added to or old transactions are removed from the transaction database. An efficient algorithm called EFPIM (Extending FP-tree for Incremental Mining), is designed based on EFP-tree (extended FP-tree) structures. An important feature of our algorithm is that it requires no scan of the original database, and the new EFP-tree structure of the updated database can be obtained directly from the EFP-tree of the original database. We give two versions of EFPIM algorithm, called EFPIM1 (an easy vision to implement) and EFPIM2 (a fast algorithm), they both mining frequent itemsets of the updated database based on EFP-tree. Experimental results show that EFPIM outperforms the existing algorithms in terms of the execution time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proceedings of ACM SIGMOD, May 1993, pp. 207–216 (1993)
Agrawal, R., Srikant, R.: Fast algorithm for mining Association rules. In: VLDB 1994, pp. 487–499 (1994)
Park, J.S., et al.: An effective hash based algorithm for mining of association rules. In: Proceedings of ACM SIGMOD Conference on Management of Data, May 1995, pp. 175–186 (1995)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, pp. 1–12 (2000)
Han, J., Pei, J.: Mining frequent patterns by pattern-growth: methodology and implications. In: SIGKDD 2000, pp. 14–20 (2000)
Zaki, Gouda, K.: Fast vertical mining using diffsets. In: SIGKDD 2003, pp. 326–335 (2003)
Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Update Technique. In: Proceedings of International Conference on Data Engineering, pp. 106–114 (1996)
Cheung, D.W., Lee, S.D., Kao, B.: A General Incremental Technique for Maintaining Discovered Association Rules. In: Proc. of the 5th International Conference on Database Systems for Advanced Applications, pp. 185–194 (1997)
Thomas, S., Bodagala, S., Alsabti, K., Ranka, S.: An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases. In: Proc. of 3rd International conference on Knowledge Discovery and Data Mining, pp. 263–266 (1997)
Koh, J.-L., Shieh, S.-F.: An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-Tree Structures. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 417–424. Springer, Heidelberg (2004)
Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A maximal frequent itemset algorithm for transactional databases. In: ICDE 2001, pp. 443–452 (2001)
Zaki, M., Hsiao, C.: CHARM: An efficient algorithm for closed itemset mining. In: SDM 2002, pp. 12–28 (2002)
Wang, J.Y., Han, J., Pei, J.: CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets. In: SIGKDD 2003, pp. 236–245 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, X., Deng, ZH., Tang, S. (2006). A Fast Algorithm for Maintenance of Association Rules in Incremental Databases. In: Li, X., Zaïane, O.R., Li, Z. (eds) Advanced Data Mining and Applications. ADMA 2006. Lecture Notes in Computer Science(), vol 4093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11811305_5
Download citation
DOI: https://doi.org/10.1007/11811305_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37025-3
Online ISBN: 978-3-540-37026-0
eBook Packages: Computer ScienceComputer Science (R0)