6th International Young Scientist Congress (IYSC-2020) will be Postponed to 8th and 9th May 2021 Due to COVID-19. 10th International Science Congress (ISC-2020).  International E-publication: Publish Projects, Dissertation, Theses, Books, Souvenir, Conference Proceeding with ISBN.  International E-Bulletin: Information/News regarding: Academics and Research

An Analytical Study of Various Frequent Itemset Mining Algorithms

Author Affiliations

  • 1Mehsana, Gujarat, INDIA
  • 2LDRP Institute of Technology and Research, Gandhinagar, Gujarat, INDIA
  • 3LDRP Institute of Technology and Research, Gandhinagar, Gujarat, INDIA
  • 4LDRP Institute of Technology and Research, Gandhinagar, Gujarat, INDIA
  • 5LDRP Institute of Technology and Research, Gandhinagar, Gujarat, INDIA
  • 6Alfa College of Engineering and Technology, Khatraj, Kalol, Gujarat, INDIA
  • 7Parul Institute of Engg. and Technology, Limda, Gujarat, INDIA

Res. J. Computer & IT Sci., Volume 1, Issue (1), Pages 6-9, February,20 (2013)

Abstract

Frequent pattern mining has been a focused theme in data mining research for over a decade. The research and tremendous progress has been made, ranging from efficient and scalable algorithms for frequent itemset mining in transaction databases to numerous research frontiers. The time required for generating frequent itemsets plays an important role. In this paper, study includes depth analysis of algorithms and discusses some problems of generating frequent itemsets from the algorithm.We have explored the unifying feature among the internal working of various mining algorithms. The comparative study of algorithms includes aspects like different support values.

References

  1. Agrawal R., Imielienski T., and Swami A, Mining Association Rules between Sets of Items in Large Databases, Proc. Conf. on Management of Data, 207–216 (1993)
  2. Raorane A.A., Kulkarni R.V. and Jitkar B.D., Association Rule – Extracting Knowledge Using Market Basket Analysis, Res. J. Recent Sci., 1(2), 19-27 (2012)
  3. Shrivastava Neeraj and Lodhi Singh Swati, Overview of Non-redundant Association Rule Mining, Res. J. Recent Sci., 1(2), 108-112 (2012)
  4. Pramod S., and Vyas O.P., Survey on Frequent Item set Mining Algorithms, In Proc. International Journal of Computer Applications (0975-8887), 1(15), 86–91 (2010)
  5. Park. J.S, Chen M.S., Yu P.S., An effective hash-based algorithm for mining association rules, In Proc. ACMSIGMOD Int’l Conf. Management of Data (SIGMOD), 175–186 (1995)
  6. Savasere E. Omiecinski and Navathe S., An efficient algorithm for mining association rules in large databases, In Proc. Int’l Conf. Very Large Data Bases (VLDB), 432– 443 (1995)
  7. Brin. S., Motwani. R., Ullman. J.D. and Tsur. S., Dynamic itemset counting and implication rules for market basket analysis, In Proc. ACM-SIGMOD Int’l Conf. Management of Data (SIGMOD), 255–264 (1997)
  8. C Toivonen. H., Sampling large databases for association rules, In Proc. Int’l Conf. Very Large Data Bases (VLDB), 134–145 (1996)
  9. Borgelt C., Efficient Implementations of Apriori and Eclat, In Proc. 1st IEEE ICDM Workshop on Frequent Item Set Mining Implementations (2003)
  10. Han J., Pei H., and Yin. Y., Mining Frequent Patterns without Candidate Generation, In Proc. Conf. on the Management of Data (2000)
  11. Pei. J, Han. J, Lu. H, Nishio. S. Tang. S. and Yang. D., Hmine: Hyper-structure mining of frequent patterns in large databases, In Proc. Int’l Conf. Data Mining (2001)
  12. Blake C.L. and Merz. C.J., UCI Repository of Machine Learning Databases, Dept. of Information and Computer Science, University of California at Irvine, CA, USA (1998)