Abstract
To solve the incremental updating of association rule, this paper proposes an effective and simple updating algorithm based on list. This paper analyses this algorithm and compares with the Apriori algorithm and the FUP algorithm. This algorithm makes full use of the previous mining information and the efficiency of the insert and delete of the list. The algorithm scans the original and the updated database only once and achieves new association rules. This paper proved that the mining time and the result integrity of this algorithm are better than the traditional association rules by experiment.
This work is supported by Hunan provincial education department research projects fund. (Approval number: 09C1182).
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., et al.: Mining association rules between sets of items in large databases. In: Proc. ACM SIGMOD Int’l Conf. Management of Data, Washington, DC, May 1993, pp. 207–216 (1993)
Cheung, D.W., Han, J., Ng, V., Wong, C.Y.: Maintenance of discovered association rules in large databases. An incremental updating technique. In: Proc.1996 Int’l Conf. on Data Engineering, New Orleans, Louisiana (February 1996)
Cheung, D.W., et al.: A fast distributed algorithm for mining association rules. In: Proc. of 1996 Int’l Conf. on Parallel and Distributed Information Systems (PDIS 1996), Miami Beach, Florida, USA (December 1996)
Feldman, R., Aumann, Y., Amir, A., Mannila, H.: Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. In: Proc. 1997 SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, May 1997, pp. 59–66 (1997)
Zhu, Y., Song, Y., Chen, G.: The research of Incremental Updating Algorithm of Association Rules. Computer Engineering and Applications (2005)
Zhu, Y., Song, Y., Chen, G.: The research of Incremental Updating Algorithm of Association Rules. Computer Engineering and Applications (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, Y., Ouyang, C. (2011). The Design of a New Updating Algorithm for Association Rules Based on List. In: Jiang, L. (eds) Proceedings of the 2011 International Conference on Informatics, Cybernetics, and Computer Engineering (ICCE2011) November 19–20, 2011, Melbourne, Australia. Advances in Intelligent and Soft Computing, vol 112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25194-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-25194-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25193-1
Online ISBN: 978-3-642-25194-8
eBook Packages: EngineeringEngineering (R0)