Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

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

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Authors:
Rana Krupali, Dweepna Garg
10.5120/ijca2017912958

Rana Krupali and Dweepna Garg. Survey on the Techniques of FP-Growth Tree for Efficient Frequent Item-set Mining. International Journal of Computer Applications 160(1):39-43, February 2017. BibTeX

@article{10.5120/ijca2017912958,
	author = {Rana Krupali and Dweepna Garg},
	title = {Survey on the Techniques of FP-Growth Tree for Efficient Frequent Item-set Mining},
	journal = {International Journal of Computer Applications},
	issue_date = {February 2017},
	volume = {160},
	number = {1},
	month = {Feb},
	year = {2017},
	issn = {0975-8887},
	pages = {39-43},
	numpages = {5},
	url = {http://www.ijcaonline.org/archives/volume160/number1/27041-2017912958},
	doi = {10.5120/ijca2017912958},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

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.

References

  1. Abd-Elmegid L A., El-Sharkawi M E., El-Fangary L M., Helmy Y K., Vertical Mining of Frequent Patterns from Uncertain Data, Computer and Information Science. 2010; 3(2); 171–179.
  2. Aggarwal C C., An Introduction to uncertain data algorithm and applications, Advances in Database Systems. 2009; 35; 1–8.
  3. Aggarwal C C., Philip S Yu., A Framework for Clustering Uncertain Data Streams, Data Engineering, IEEE 24th International Conference on ICDE’08. 2008; 150-159.
  4. Aggarwal C C., Yan L., Wang Jianyong, Wang Jing., Frequent pattern mining with uncertain data, In Proc. KDD. 2009; 29-37.
  5. Agarwal, R. C., Aggarwal, C. C., & Prasad, V. V. V. (2000, August). Depth first generation of long patterns. In Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 108-118). ACM.
  6. Agrawal R., Srikant R.titFast algorithms for mining association rules In Proc. VLDB 1994, pp.487–499.
  7. Borgelt, C. (2005, August). An Implementation of the FP-growth Algorithm. In Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations (pp. 1-5). ACM.
  8. C.C. Agarwal, “An Introduction to uncertain data algorithm and applications”, Advances in Database Systems, 2009, 35; pp 1–8.
  9. Chen H., Ku W S., Wang H., Sun M T., Leveraging Spatio-Temporal Redundancy for RFID Data Cleansing, In SIGMOD. 2010.
  10. Chui C K., Kao B., Hung E., Mining Frequent Itemsets from Uncertain Data, Springer-Verlag Berlin Heidelberg PAKDD’07. 2007; 4426; 47-58.
  11. Deshpande A., Guestrin C., Madden S R., Hellerstein J M., W. Hong., Model-Driven Data Acquisition in Sensor Networks, VLDB; 2004.
  12. Goethals, B. (2003). Survey on frequent pattern mining. Univ. of Helsinki.
  13. Gouda, K., &Zaki, M. J. (2005). Genmax: An efficient algorithm for mining maximal frequent itemsets. Data Mining and Knowledge Discovery, 11(3), 223-242.
  14. Grahne, G., & Zhu, J. (2003, November). Efficiently Using Prefix-trees in Mining Frequent Itemsets. In FIMI (Vol. 90).
  15. Han I., Kamber M., Data Mining concepts and Techniques, M. K. Publishers. 2000; 335–389.
  16. Han, J., Pei, J., & Yin, Y. (2000, May). Mining frequent patterns without candidate generation. In ACM SIGMOD Record (Vol. 29, No. 2, pp. 1-12). ACM.
  17. H. Huang, X.W, and R. Relue, “Association Analysis with One Scan of Databases”, Proceedings of the IEEE International Conference on Data Mining, 2002.
  18. Huang J., Antova L., Koch C., Olteanu D. MayBMS: A probabilistic database management system, in Proc. ACM SIGMOD’09. 2009; 1071–1074.
  19. International Journal of Intelligent Computing Research (IJICR), Volume 6, Issue 3, September 2015 Copyright © 2015, Infonomics Society 619.
  20. Jagrati Malviya, Anju Singh, “A comparative study of various database techniques for frequent pattern generation”, ACSIT Nov 2014.
  21. J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen , U. Dayal , and Hsu, M.-C. FreeSpan, “Frequent pattern-projected sequential pattern mining”, ACM SIGKDD, 2010.
  22. J. Han, J. Pei, and Y. Yin, “Mining Frequent Patterns without Candidate Generation”, SIGMOD 2000, pp 1-12.
  23. Jiawei Han, Jian Pei, Runying Mao,” Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach”, Data Mining and Knowledge Discovery, April 2001, Kluwer Academic Publishers, Manufactured in the Netherlands.
  24. Jiawei Han, M. Kamber, “Data Mining-Concepts and Techniques”, Sam Francisco 2009, Morgan Kanufmann Publishers.
  25. Khare N., Adlakha N., Pardasani K R., Karnaugh Map Model for Mining Association Rules in Large Databases, International Journal of Computer and Network Security. 2009; 1(2); 16–21.
  26. Leung C K S., Carmichael C L., Hao B., Efficient mining of frequent patterns from uncertain data, In Proc. IEEE ICDM Workshops’07. 2007; 489-494.
  27. Leung C K S., Hao B., Efficient algorithms for mining constrained frequent patterns from uncertain data, Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data. 2009; 9-18.
  28. Li Haoyuan, Yi Wang, Zhang Dong, Zhang Ming, Chang Edward, “PFP: Parallel FP Growth for query Recommendation”.
  29. Lijuan Zhou, Xiang Wang, “Research of the FP Growth algorithm based on Cloud Environment”, Journal of Software, March 2014, volume 9, N0. 3.
  30. Lin Y C., Hung C M., Huang Y M., Mining Ensemble Association Rules by Karnaugh Map, World Congress on Computer Science and Information Engineering. 2009; 320–324.
  31. Lin, D. I., &Kedem, Z. M. (1998). Pincer-search: A new algorithm for discovering the maximum frequent set. In Advances in Database Technology—EDBT'98 (pp. 103-119). Springer Berlin Heidelberg.
  32. Liu, G., Lu, H., Yu, J. X., Wang, W., & Xiao, X. (2003, November). AFOPT: An Efficient Implementation of Pattern Growth Approach. In FIMI.

Keywords

Data Mining, KDD, Association Rule, FP-Growth Tree, FP-Growth Tree Techniques.