Survey on the Techniques of FP-Growth Tree for Efficient Frequent Item-set Mining

Analysis has been carried out in terms of FP-Growth Tree techniques to determine which technique can be used efficiently in order to achieve higher scalability and performance. Construction and development of classifier that works with more accuracy and performs efficiently for large database is one of the key tasks of data mining techniques. Secondly training dataset repeatedly produces massive amount of rules. It’s very tough to store, retrieve, prune, and sort a huge number of rules proficiently before applying to a classifier. In such situation FP is the best choice but problem with this approach is that it generates redundant FP Tree. A Frequent pattern tree (FP-tree) is type of prefix tree that allows the detection of recurrent (frequent) item set exclusive of the candidate item set generation. It is anticipated to recuperate the flaw of existing mining methods. FP – Trees pursues the divide and conquers tactic. General Terms FPtree structure, Apriori algorithm, Association Rule

[1]  Gösta Grahne,et al.  Efficiently Using Prefix-trees in Mining Frequent Itemsets , 2003, FIMI.

[2]  Mohammed J. Zaki,et al.  GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets , 2005, Data Mining and Knowledge Discovery.

[3]  Ankita Patel.  “Frequent Pattern – Projected Sequential Pattern Mining Improve its Efficiency and Scalability” , 2016 .

[4]  Edward Hung,et al.  Mining Frequent Itemsets from Uncertain Data , 2007, PAKDD.

[5]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[6]  Haixun Wang,et al.  Leveraging spatio-temporal redundancy for RFID data cleansing , 2010, SIGMOD Conference.

[7]  Xiang Wang,et al.  Research of the FP-Growth Algorithm Based on Cloud Environments , 2014, J. Softw..

[8]  Bart Goethals,et al.  Survey on Frequent Pattern Mining , 2003 .

[9]  Walid G. Aref.  Mining Association Rules in Large Databases , 2004 .

[10]  Zvi M. Kedem,et al.  Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set , 1998, EDBT.

[11]  Christian Borgelt,et al.  An implementation of the FP-growth algorithm , 2005 .

[12]  Carson Kai-Sang Leung,et al.  Efficient algorithms for mining constrained frequent patterns from uncertain data , 2009, U '09.

[13]  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).

[14]  Carson Kai-Sang Leung,et al.  Efficient Mining of Frequent Patterns from Uncertain Data , 2007, Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007).

[15]  Dan Olteanu,et al.  MayBMS: a probabilistic database management system , 2009, SIGMOD Conference.

[16]  Hongjun Lu,et al.  AFOPT: An Efficient Implementation of Pattern Growth Approach , 2003, FIMI.

[17]  Charu C. Aggarwal,et al.  Frequent pattern mining with uncertain data , 2009, KDD.

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

[19]  Carson Kai-Sang Leung,et al.  Efficient algorithms for the mining of constrained frequent patterns from uncertain data , 2010, SKDD.

[20]  Ramesh C Agarwal,et al.  Depth first generation of long patterns , 2000, KDD '00.

[21]  Philip S. Yu,et al.  A Framework for Clustering Uncertain Data Streams , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[22]  Yueh-Min Huang,et al.  Mining Ensemble Association Rules by Karnaugh Map , 2009, 2009 WRI World Congress on Computer Science and Information Engineering.

[23]  Umeshwar Dayal,et al.  FreeSpan: frequent pattern-projected sequential pattern mining , 2000, KDD '00.

[24]  Wei Hong,et al.  Model-Driven Data Acquisition in Sensor Networks , 2004, VLDB.

[25]  Edward Y. Chang,et al.  Pfp: parallel fp-growth for query recommendation , 2008, RecSys '08.

[26]  Charu C. Aggarwal.  An Introduction to Uncertain Data Algorithms and Applications , 2009 .

[27]  Xindong Wu,et al.  Association analysis with one scan of databases , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[28]  Carson Kai-Sang Leung,et al.  Efficient Mining of Frequent Patterns from Uncertain Data , 2007 .

[29]  Mohamed E. El-Sharkawi,et al.  Vertical Mining of Frequent Patterns from Uncertain Data , 2010, Comput. Inf. Sci..