A NOVEL APPROACH FOR MINING INTER-TRANSACTION ITEMSETS

Aim: To address the problem of inter-transaction association rule mining, where the frequent occurrence of a large number of items results in a combinatorial explosion that limits the practical application of the existing mining algorithms. Methodology: We propose an efficient algorithm called IAR Miner (Inter-transaction Association Rule Miner), for mining inter-transaction itemsets. Our proposed algorithm consists of two phases. First, we scan the database once to ※nd the frequent items. For each frequent item found, the IAR Miner converts the original transaction database into a set of domain attributes, called a dataset. Then, it enumerates inter-transaction itemsets using an Itemset-Dataset tree, called an ID-tree. By using the ID-tree and datasets to mine inter-transaction itemsets, the IAR Miner can embed effective pruning strategies to avoid costly candidate generation and repeated support counting. Results: Our proposed algorithm can efficiently mine inter-transaction patterns. The performance study on the synthetic datasets shows that the IAR Miner algorithm is more efficient than the EH-Apriori, FITI, ClosedPROWL and ITP-Miner algorithms in most cases. Conclusion: The IAR Miner algorithm can efficiently mine the inter-transaction patterns. In the future work, we will address a number of research issues related to the IAR Miner algorithm.

[1]  Qing Li,et al.  From intra-transaction to generalized inter-transaction: Landscaping multidimensional contexts in association rule mining , 2005, Inf. Sci..

[2]  Anthony J. T. Lee,et al.  Mining spatial association rules in image databases , 2007, Inf. Sci..

[3]  Jiawei Han,et al.  Mining top-k frequent closed patterns without minimum support , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[4]  Hongjun Lu,et al.  A template model for multidimensional inter-transactional association rules , 2002, The VLDB Journal.

[5]  Jian Pei,et al.  CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.

[6]  Gerd Stumme,et al.  Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets , 2000, Computational Logic.

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

[8]  Anthony J. T. Lee,et al.  An efficient algorithm for mining frequent inter-transaction patterns , 2007, Inf. Sci..

[9]  Maguelonne Teisseire,et al.  Incremental mining of sequential patterns in large databases , 2003, Data Knowl. Eng..

[10]  Tzung-Shi Chen,et al.  Mining frequent tree-like patterns in large datasets , 2005, Data Knowl. Eng..

[11]  Tzung-Shi Chen,et al.  Mining Frequent Tree-Like Patterns in Large Datasets , 2005, DASFAA.

[12]  Nicolás Marín,et al.  TBAR: An efficient method for association rule mining in relational databases , 2001, Data Knowl. Eng..

[13]  Toon Calders,et al.  Mining All Non-derivable Frequent Itemsets , 2002, PKDD.

[14]  Anthony J. T. Lee,et al.  Mining association rules with multi-dimensional constraints , 2006, J. Syst. Softw..

[15]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[16]  Jiawei Han,et al.  Discovery of Multiple-Level Association Rules from Large Databases , 1995, VLDB.

[17]  Wen-Yang Lin,et al.  Efficient mining of generalized association rules with non-uniform minimum support , 2007, Data Knowl. Eng..

[18]  Kuen-Fang Jea,et al.  Discovering frequent itemsets by support approximation and itemset clustering , 2008, Data Knowl. Eng..

[19]  Svetha Venkatesh,et al.  An extended frequent pattern tree for intertransaction association rule mining , 2005 .

[20]  Hongjun Lu,et al.  Beyond intratransaction association analysis: mining multidimensional intertransaction association rules , 2000, TOIS.

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

[22]  Girish Keshav Palshikar,et al.  Association Rules Mining Using Heavy Itemsets , 2005, COMAD.

[23]  Anthony K. H. Tung,et al.  Efficient Mining of Intertransaction Association Rules , 2003, IEEE Trans. Knowl. Data Eng..

[24]  Howard J. Hamilton,et al.  Mining itemset utilities from transaction databases , 2006, Data Knowl. Eng..

[25]  Jian Yin,et al.  Efficient Mining of Cross-Transaction Web Usage Patterns in Large Database , 2005, ICCNMC.