论文信息 - A Virtual Join Algorithm for Fast Association Rule Mining

A Virtual Join Algorithm for Fast Association Rule Mining

A new algorithm for improving ECLAT performance has been presented in this paper. The algorithm is based on the concept of a “virtual join”. The virtual join algorithm avoids relatively expensive real joins, leading to enhanced performance. Experimental results demonstrate the effectiveness of the proposed algorithm.

Minho Kim | R. S. Ramakrishna | Gye Hyung Kim

[1] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[2] 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.

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

[4] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD 2000.

[5] Srinivasan Parthasarathy,et al. New Algorithms for Fast Discovery of Association Rules , 1997, KDD.

[6] Mohammed J. Zaki,et al. CHARM: An Efficient Algorithm for Closed Itemset Mining , 2002, SDM.