IMTAR: Incremental Mining of General Temporal Association Rules

Nowadays due to the rapid advances in the field of information systems, transactional databases are being updated regularly and/or periodically. The knowledge discovered from these databases has to be maintained, and an incremental updating technique needs to be developed for maintaining the discovered association rules from these databases. The concept of Temporal Association Rules has been introduced to solve the problem of handling time series by including time expressions into association rules. In this paper we introduce a novel algorithm for Incremental Mining of General Temporal Association Rules (IMTAR) using an extended TFP-tree. The main benefits introduced by our algorithm are that it offers significant advantages in terms of storage and running time and it can handle the problem of mining general temporal association rules in incremental databases by building TFP-trees incrementally. It can be utilized and applied to real life application domains. We demonstrate our algorithm and its advantages in this paper.

[1]  Cheng Zheng,et al.  An incremental updating technique for mining indirect association rules , 2008, 2008 International Conference on Machine Learning and Cybernetics.

[2]  Jiawei Han,et al.  Maintenance of discovered association rules in large databases: an incremental updating technique , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[3]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[4]  Frans Coenen,et al.  Data structure for association rule mining: T-trees and P-trees , 2004, IEEE Transactions on Knowledge and Data Engineering.

[5]  Xin Li,et al.  A Fast Algorithm for Maintenance of Association Rules in Incremental Databases , 2006, ADMA.

[6]  Ming-Syan Chen,et al.  Progressive Partition Miner: An Efficient Algorithm for Mining General Temporal Association Rules , 2003, IEEE Trans. Knowl. Data Eng..

[7]  AgrawalRakesh,et al.  Mining association rules between sets of items in large databases , 1993 .

[8]  Osmar R. Zaïane,et al.  Incremental mining of frequent patterns without candidate generation or support constraint , 2003, Seventh International Database Engineering and Applications Symposium, 2003. Proceedings..

[9]  Philip S. Yu,et al.  An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.

[10]  Reda Alhajj,et al.  Constructing Complete FP-Tree for Incremental Mining of Frequent Patterns in Dynamic Databases , 2006, IEA/AIE.

[11]  Wei Wang,et al.  Temporal Association Rules with Numerical Attributes , 2007 .

[12]  Jiong Yang,et al.  TAR: temporal association rules on evolving numerical attributes , 2001, Proceedings 17th International Conference on Data Engineering.

[13]  Ron Rymon,et al.  Search through Systematic Set Enumeration , 1992, KR.