An Optimized Algorithm for Association Rule Mining Using FP Tree

Abstract Data mining is used to deal with the huge size of the data stored in the database to extract the desired information and knowledge. It has various techniques for the extraction of data; association rule mining is the most effective data mining technique among them. It discovers hidden or desired pattern from large amount of data. Among the existing techniques the frequent pattern growth (FP growth) algorithm is the most efficient algorithm in finding out the desired association rules. It scans the database only twice for the processing. The issue with the FP growth algorithm is that it generates a huge number of conditional FP trees. In the proposed work, we have designed a new technique which mines out all the frequent item sets without the generation of the conditional FP trees. Unlike FP tree it scans the database only once which reduces the time efficiency of the algorithm. It also finds out the frequency of the frequent item sets to find out the desired association rules.

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

[2]  Rajeev Motwani,et al.  Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.

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

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

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

[6]  Yan Hu,et al.  An Improved Algorithm for Mining Maximal Frequent Patterns , 2009, 2009 International Joint Conference on Artificial Intelligence.

[7]  Bo Yang,et al.  An Efficient Close Frequent Pattern Mining Algorithm , 2009, 2009 Second International Conference on Intelligent Computation Technology and Automation.

[8]  Young-Koo Lee,et al.  Efficient single-pass frequent pattern mining using a prefix-tree , 2009, Inf. Sci..

[9]  Rajeev Motwani,et al.  Beyond Market Baskets: Generalizing Association Rules to Dependence Rules , 1998, Data Mining and Knowledge Discovery.

[10]  Ramakrishnan Srikant,et al.  Mining Association Rules with Item Constraints , 1997, KDD.

[11]  Research of an association rule mining algorithm based on FP tree , 2010, 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems.

[13]  Defu Zhang,et al.  A New Algorithm for Frequent Itemsets Mining Based on Apriori and FP-Tree , 2009, 2009 WRI Global Congress on Intelligent Systems.