In Data mining field, frequent item set mining is one of the most intensively investigated problems in terms of computational complexity. The concept is widely used in market basket analysis, finance, and health care systems. Finding frequent patterns plays an essential role in mining associations, correlations and much other interesting relationship among data. The interest in the problem still persists despite of elaborate research conducted in the last two decades, due to its computational complexity and the fact that the results sets can be exponentially large. This combinatorial explosion of frequent item set methods become even more problematic when they are applied to Big Data. In this survey paper, an effort is made to present various popular algorithms and its analysis.

Frequent item set mining, Association rule mining, Big Data

[1] Rakesh Agrawal,Ramakrishnan Srikant,”Fast algorithms for mining association rules”, In the Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, Santiago, Chile, pp 487-499, September 1994.
[2] Zaki, M. J. , "Scalable algorithms for association mining". IEEE Transactions on Knowledge and Data Engineering,Vol.12,Issue.3,pp 372–390,2000.
[3] Han,"Mining Frequent Patterns Without Candidate Generation" in the Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. SIGMOD `00: pp 1–12,2000.
[4] Christian Borgelt,Xiaomeng Wang, ” SaM: A Split and Merge Algorithm for Fuzzy Frequent Item Set Mining”,
[5] J.Han,M.Kamber,”Data Mining Concepts and Techniques,Morgan Kaufmann Publisher,San Fransisco,CA,USA,2001.
[6] Zhang Changsheng, Li Zhongyue, Zheng Dongsong,“An Improved Algorithm for Apriori”,In IEEE,First International Workshop on Education Technology and Computer Science,2009.
[7] Gang Yang,Hong Zhao,Lei Wang,Yinng Liu “ Implementation of improved Apriori Algorithm” in the proceedings of the Eighth International Conference on Machine Learning and Cybernetics, Baoding, 12-15 July 2009.
[8] Jianlong Gu, Baojin Wang , Fengyu Zhang, Weiming Wang, and Ming Gao “An Improved Apriori Algorithm” in the International Conference on Applied Informatics and Communication ICAIC 2011:Applied Informatics and Communication pp 127-133
[9] Cheung, D-W., Han, J., Ng, V-T., Wang, C-Y, “Maintenance of Discovered Association Rules in Large Databases : An Incremental Update technique” in the 12th International Conference on Data Engineering, New Orleans, LA., 26 February-1 March 1996,pp. 106-114.
[10] Quanzhu Yao, Xingxing Gao ,Xueli Lei and Tong Zhang , “The Research and Improvement Based on FP-Growth Data Mining Algorithm” in the Advances in computer Research,Vol.58 Modeling, Simulation and Optimization Technologies and Applications (MSOTA 2016) .
[11] Kuikui Jia,Haibin Liu, “An Improved FP-Growth Algorithm Based on SOM Partition” in the proceedings of International Conference of Pioneering Computer Scientists, Engineers and Educators ICPCSEE 2017: Data Science-pp 166-178.
[12] Ding Zhenguo, Wei Qinqin, Ding Xianhua “An Improved FP-growth Algorithm Based on Compound Single Linked List” in the 2009 Second International Conference on Information and Computing Science,IEEE ,DOI 10.1109/ICIC.2009.96
[13] M. J. Zaki and K. Gouda, “Fast vertical mining using diffsets”,in the Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, New York, USA, (2003), pp. 326- 335.
[14] Caiyan Dai, Ling Chen, “An Algorithm for Mining Frequent Closed Itemsets with Density from Data Streams” ,International Journal of Computer Sciences and Engineering(IJCSE),Vol.4,Issue 2 ,pp.40-48,2016.
[15] X. Z. Yang, C. P. En and Z. Y. Fang, “Improvement of Eclat algorithm for association rules based on hash Boolean matrix”, Application Research of Computers, vol. 27, no. 4, (2010), pp. 1323-1325.
[16] F. P. En, L. Yu, Q. Q. Ying and L. L. Xing, “Strategies of efficiency improvement for Eclat algorithm”, Journal of Zhejiang University (Engineering Science), vol. 47, no. 2, (2013), pp. 223-230.
[17] Akilandeswari. S, A.V.Senthil Kumar, “A Novel Low Utility Based Infrequent Weighted Itemset Mining Approach Using Frequent Pattern”,International Journal of Computer Sciences and Engineering(IJCSE),Vol.3,Issue 7,pp.181-185,2015.
[18] R.B.M. Sayyad,P.S. Yalagi, “Infrequent Weighted Itemset Mining for Large Dataset” International Journal of Computer Sciences and Engineering(IJCSE),Vol.5,Issue 6,pp.149-153, 2017.