Abstract
In this study, a general incremental updating technique is proposed for maintaining the frequent itemsets discovered in a database in the cases including insertion, deletion, and modification of transactions in the database. An efficient algorithm, called AFPIM (Adjusting FP-tree for Incremental Mining), is designed based on adjusting FP-tree structures. Our approach uses a FP-tree structure to store the compact information of transactions involving frequent and pre-frequent items in the original database. In most cases, without needing to rescan the original database, the new FP-tree structure of the updated database can be obtained by adjusting FP-tree of the original database according to the changed transactions. Experimental results show that AFPIM outperforms the existing algorithms in terms of the execution time.
This work was partially supported by the R.O.C. N.S.C. under Contract No. 92-2213-E-003- 012.
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., Srikant, R.: Fast Algorithm for Mining Association Rule in Large Databases. In: Proc. of The 20th International Conference on Very Large Data Bases (1994)
Ayan, N.F., Tansel, A.U., Arkun, E.: An Efficient Algorithm to Update Large Itemsets with Early Pruning. In: Proc. of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (1999)
Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Update Technique. In: Proc. of the 12th International Conference on Data Engineering (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 (1997)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data (2000)
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 (1997)
Wang, K., Tang, L., Han, J., Liu, J.: Top down FP-Growth for Association Rule Mining. In: To appear in the 6th Pacific Area Conference on Knowledge Discovery and Data Mining (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koh, JL., Shieh, SF. (2004). An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-Tree Structures. In: Lee, Y., Li, J., Whang, KY., Lee, D. (eds) Database Systems for Advanced Applications. DASFAA 2004. Lecture Notes in Computer Science, vol 2973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24571-1_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-24571-1_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21047-4
Online ISBN: 978-3-540-24571-1
eBook Packages: Springer Book Archive