An Efficient Technique for Indexing Temporal Databases

Temporal databases added a new dimension to traditional transaction databases. This dimension is the life time of each item, i.e. exhibition period, starting from the partition when this item appears in the transaction database to the partition when this item no longer exists. Mining temporal association rules became very interesting topic in many applications nowadays. In this paper, an efficient technique is proposed for indexing temporal databases in order to facilitate support counting process during mining operation. Some experiments were conducted using well-known real datasets to show the performance of the proposed indexing technique with respect to index size and running time of the mining algorithm. The results show that the proposed indexing technique saves a lot of running time and works efficiently with different databases characteristics.

[1]  Zhai Lianga,et al.  TEMPORAL ASSOCIATION RULE MINING BASED ON T-APRIORI ALGORITHM AND ITS TYPICAL APPLICATION , 2005 .

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

[3]  Ming-Syan Chen,et al.  Mining general temporal association rules for items with different exhibition periods , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[4]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[5]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[6]  Sourav S. Bhowmick,et al.  Association Rule Mining: A Survey , 2003 .

[7]  Gösta Grahne,et al.  Fast algorithms for frequent itemset mining using FP-trees , 2005, IEEE Transactions on Knowledge and Data Engineering.

[8]  Ming-Syan Chen,et al.  On mining general temporal association rules in a publication database , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[9]  Ming-Syan Chen,et al.  Twain: Two-end association miner with precise frequent exhibition periods , 2007, TKDD.

[10]  Hui Ning,et al.  Temporal Association Rules in Mining Method , 2006, First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06).

[11]  Aida Mustapha,et al.  Effect of Temporal Relationships in Associative Rule Mining for Web Log Data , 2014, TheScientificWorldJournal.

[12]  Frans Coenen,et al.  A new method for mining Frequent Weighted Itemsets based on WIT-trees , 2013, Expert Syst. Appl..