Abstract
The maintenance of association rules for dynamic database is an important problem because the updates may not only invalidate some existing rules but also make other rules relevant. This paper is the extension work of probability-based incremental association rule discovery algorithm which can only handle new data insert into a dynamic database. Unlike the previous work, the proposed algorithm can efficiently handle in case of insertion as well as deletion simultaneously. Basically, the proposed algorithm maintains the support counts of frequent itemsets and promising frequent itemsets, i.e., infrequent itemsets that promise to be frequent in the future, in an original database. Promising frequent itemsets, which are obtained by using the principle of Bernoulli trials, can help to reduce a number of times to rescan the original database. The support counts of new candidate itemsets are approximated by using the principle of maximum possible value. The experimental results show that the execution time of the proposed algorithm is faster than that of Apriori, FUP2, EDUA, and pre-large algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agrawal R, Srikant R (1994) Fast algorithm for mining association rules in large database. In: Proceedings of 20th international conference on very large data bases, pp 487−499
Amornchewin R, Kreesuradej W (2009) Mining dynamic database using probability-based incremental association rule discovery algorithm. J Univers Comput Sci 15(12):2409–2428
Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of ACM-SIGMOD international conference on management of data, pp 1–12
Cheung DW, Han J, Ng VT, Wong CY (1996) Maintenance of discovered association rules in large database: an incremental updating technique. In: Proceedings of 12th IEEE international conference on data engineering, pp 106–114
Cheung DW, Lee SD, Kao B (1997) A general incremental technique for maintaining discovered association rules. In: Proceedings of the 5th international conference on database systems for advanced applications, pp 185–194
Zhang S, Zhang J, Zhang C (2007) EDUA: an efficient algorithm for dynamic database mining. Inform Sci J 177:2756–2767
Chen M, Han J, Yu PS (1996) Data Mining: an overview from database perspective. IEEE Trans Knowl Data Eng 8:866–883
Lee C, Lin CR, Chen MS (2001) Sliding-window filtering: an efficient algorithm for incremental mining. In: Proceedings of international conference on information and knowledge management, CIKM01, pp 263–270
Thomas S, Bodagala S, Alsabti S, Ranka S (1997) An efficient algorithm for the incremental updation of association rules in large databases. In: Proceedings of the 3rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 263–266
Hong TP, Wang CY, Tao YH (2001) A new incremental data mining algorithm using pre-large itemsets. Intell Data Anal 5:111–129
Hong TP, Huang TJ (2007) Maintenance of generalized association rules for record deletion based on the pre-Large concept. In: Proceedings of the 6th WSEAS Int. Conf. on artificial intelligence, knowledge engineering and data bases
Taha M, Gharib T, Nassar H (2011) DARM: decremental association rules mining. J Intell Learn Syst Appl 3:181–189
Lin CW, Hong TP (2014) Maintenance of prelarge trees for data mining with modified records. Inform Sci 278:88–103
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Thusaranon, P., Kreesuradej, W. A probability-based incremental association rule discovery algorithm for record insertion and deletion. Artif Life Robotics 20, 115–123 (2015). https://doi.org/10.1007/s10015-015-0210-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-015-0210-4