We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Comparing the Performance of Frequent Pattern Mining Algorithms

by Kanwal Garg, Deepak Kumar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 69 - Number 25
Year of Publication: 2013
Authors: Kanwal Garg, Deepak Kumar
10.5120/12129-8502

Kanwal Garg, Deepak Kumar . Comparing the Performance of Frequent Pattern Mining Algorithms. International Journal of Computer Applications. 69, 25 ( May 2013), 21-28. DOI=10.5120/12129-8502

@article{ 10.5120/12129-8502,
author = { Kanwal Garg, Deepak Kumar },
title = { Comparing the Performance of Frequent Pattern Mining Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { May 2013 },
volume = { 69 },
number = { 25 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 21-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume69/number25/12129-8502/ },
doi = { 10.5120/12129-8502 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:31:17.726791+05:30
%A Kanwal Garg
%A Deepak Kumar
%T Comparing the Performance of Frequent Pattern Mining Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 69
%N 25
%P 21-28
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Frequent pattern mining is the widely researched field in data mining because of it's importance in many real life applications. Many algorithms are used to mine frequent patterns which gives different performance on different datasets. Apriori, Eclat and FP Growth are the initial basic algorithm used for frequent pattern mining. The premise of this paper is to find major issues/challenges related to algorithms used for frequent pattern mining with respect to transactional database.

References
  1. Agarwal, R. C. , Agarwal, C. C. and Prasad, V. V. V. (2001) A tree projection algorithm for generation of frequent item sets. Journal of Parallel and Distributed Computing, 61(3), Pp. 350–371.
  2. Bhadoria et. al. Analysis of Frequent Itemset Mining on Variant Datasets published in int. J. comp. Tech. appl. , vol(2)5, ISSN:2229-6093, Pp. 1328-1333.
  3. http://en. wikipedia. org/wiki/Database_transaction [on 11th nov 2012].
  4. C. Borgelt. "Efficient Implementations of Apriori and Eclat". In Proc. 1st IEEE ICDM Workshop on Frequent Item Set Mining Implementations, CEUR Workshop Proceedings 90, Aachen, Germany 2003.
  5. Goswami D. N et. al. "An Algorithm for Frequent Pattern Mining Based On Apriori " (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 04, 2010, Pp. 942-947.
  6. Rahul Mishra et. al. "Comparative Analysis of Apriori Algorithm and Frequent Pattern Algorithm for Frequent Pattern Mining in Web Log Data. " (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (4) , 2012, Pp. 4662 – 4665.
  7. SathishKumar et al. "Efficient Tree Based Distributed Data Mining Algorithms for mining Frequent Patterns" International Journal of Computer Applications (0975 – 8887) Volume 10– No. 1, November 2010.
  8. Haoyuan Li,Yi Wang,Dong Zhang, Ming Zhang,Edward Chang 2008. "Pfp: parallel fp-growth for query recommendation Proceedings of the 2008 ACM conference on Recommender systems Pp. 107-114.
  9. G. Grahne and J. Zhu , May 2003. "High performance mining of maximal frequent itemsets", In SIAM'03 Workshop on High Performance Data Mining: Pervasive and Data Stream Mining.
  10. Han, J. , Pei, J. , and Yin, Y. 2000. Mining frequent patterns without candidate generation. In Proc. 2000 ACMSIGMOD Int. Conf. Management of Data.
  11. Deepak Garg et. al. "Comparative Analysis of Various Approaches Used in Frequent Pattern Mining" (IJACSA) International Journal of Advanced Computer Science and Applications, Special Issue on Artificial Intelligence.
Index Terms

Computer Science
Information Sciences

Keywords

Data Mining Frequent Pattern Mining

Powered by PhDFocusTM