Abstract
Incrementally maintaining association rules based on two or more classes of frequent item sets may reduce the costs of scanning the original database remarkably. However, it was considered as a method of saving time with more storage spaces. It is suggested in this paper that all frequent item sets of several minimal supports can be stored in a table with a little additional storage, and a representation model is given. Based on this model, the paper systematically discusses the problem of incremental maintenance based on discovered association rules of several minimal supports. Theoretical analysis and experiments show that the approach makes full use of the previous results and reduces the complexity of incremental maintenance algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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 the 1993 ACM SIGMOD International Conference on Management of Data: SIGMOD 1993, pp. 207–216. ACM Press, New York (1993)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings of the ACM SIGMOD International Conference, pp. 487–499 (1994)
Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of discovered association rules in large databases: an incremental updating technique. In: Proceedings of the 12th International Conference on Data Engineering, New Orleans, Louisana, pp. 106–114 (1996)
Feng, Y.C., Feng, J.L.: Incremental updating algorithm for association rules (in chinese). Journal of Software 4, 301–306 (1998)
Lin, Z.M.: Incremental updating technique of association rules based on divide and conquer strategy (in chinese). Pattern recognition and artificial intelligence 1, 103–107 (2002)
Chen, L., Chen, G.C.: An improved incremental algorithm for maintaining discovered association rules (in chinese). Computer Engineering and Design 1, 60–63 (2002)
Ouyang, W.M., Zheng, C., Cai, Q.S.: A time windowing technique for the incremental mantenance of association rules (in chinese). Mini Micro System 1, 55–58 (2001)
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
Duan, Z., Cai, Z., Lv, Y. (2006). Incremental Maintenance of Association Rules Based on Multiple Previously Mined Results. 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_7
Download citation
DOI: https://doi.org/10.1007/11811305_7
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)