HYBRID: An efficient unifying process to mine frequent itemsets

Current advancement in technology inexorably leads to data flood. More data is generated from banking, telecom, scientific experiments, etc. Data mining is the process of extracting useful information from this flooded data, which helps in making profitable future decisions in these fields. Frequent itemset mining is one of the focus research areas and an important step to fin association rules. Time and space requirements for generating frequent itemsets are of utter importance. Algorithms to mine frequent itemsets effectively help in finding association rules and also help in many other data mining tasks. In this paper, an efficient hybrid algorithm was designed using a unifying process of the algorithms Improved Apriori and FP-Growth. Results indicate that the proposed hybrid algorithm, albeit more complex, consumes fewer memory resources and faster execution time.

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

[2]  Christian Borgelt,et al.  EFFICIENT IMPLEMENTATIONS OF APRIORI AND ECLAT , 2003 .

[3]  Hannu Toivonen,et al.  Sampling Large Databases for Association Rules , 1996, VLDB.

[4]  Jiawei Han,et al.  Frequent pattern mining: current status and future directions , 2007, Data Mining and Knowledge Discovery.

[5]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

[6]  N. Ramaraj,et al.  Algorithm for Efficient Data Mining , 2007, International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007).

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

[8]  Christian Borgelt,et al.  Frequent item set mining , 2012, WIREs Data Mining Knowl. Discov..

[9]  Yong-qing Wei,et al.  An improved Apriori algorithm for association rules of mining , 2009, 2009 IEEE International Symposium on IT in Medicine & Education.

[10]  Yue-Shi Lee,et al.  The Studies of Mining Frequent Patterns Based on Frequent Pattern Tree , 2009, PAKDD.

[11]  Raj P. Gopalan,et al.  CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure , 2004, FIMI.

[12]  D. Dominic,et al.  A Comparative Study of FP-growth Variations , 2009 .

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

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