A Comparative analysis of Association rule excavating in Big Data Mining Algorithms

Authors

  • Ahilandeeswari G Department of Computer Science, NGM College, Pollachi, India
  • R Manicka Chezian Department of Computer Science, NGM College, Pollachi, India

Keywords:

Association rule, Apriori Algorithm Big data mining, Data mining

Abstract

In Data Mining Research, Association rule mining plays a significant role in data mining. This paper presents the review of Association rule mining. The analysis of research survey would give the instruction concerning somewhat has been done previously in the same area, what is the present tendency and what are the other related areas. Big data is the word for a set of data sets which are enormous and convoluted, it holds structured and unstructured both varieties of data. Data comes from everywhere, sensors used to amass climate information, posts to social media sites, digital pictures and videos etc. This data is known as big data. Useful data can elicit from this big data with the help of data mining. In this paper, the association rule of data mining and advanced big data mining algorithms are scrutinized.

References

R. Agarwal and R. Srikant,“Fast Algorithms for Mining Association Rules.”, International Conference on very large Databases, proc 20th, pp 487-499, June 1994.

Khurana K and Sharma S, ―A comparative analysis of association rule mining algorithms, International Journal of Scientific and Research Publications, Volume 3, Issue 5, pp 38-45, May 2013.

Borgelt, C. “Efficient Implementations of Apriori and Eclat”. Workshop of frequent item set mining implementations (FIMI 2003, Melbourne, FL, USA).

Hunyadi, D.”Performance comparison of Apriori and FP-Growth Algorithms in Generating Association Rules”.Proceedings of the European Computing Conference ISBN: 978-960-474-297-4.

Thieme, S.L. “Algorithmic Features of Eclat”. FIMI, Volume 126 of CEUR Workshop Proceedings, CEUR- WS.org, 2004.

Ms. Dhamdhere Jyoti L., Prof. Deshpande Kiran B. "An Effective Algorithm for Frequent Itemset Mining on Hadoop.", International Journal of Science, Engineering and Technology Research (IJSETR), Volume 3, Issue 8, August 2014.

Agrawal, R., Shafer, J.C., "Parallel mining of association rules.", IEEE Transactions on Knowledge and Data Engineering, Volume.8, no.6, pp 962-969, Dec 1996.

A. Swami, T. Imielienski, R. Agrawal," Mining Association Rules between Sets of Items in Large databases.", ACM Press, pp 207–216, July 1993

Brain.s Motwani R,Ullman.J.D and S. Tsur,"Dynamic itemsets counting and implication rules for market basket analysis.", ACM-SIGMOD ,pages 255-264, May 1997.

.

Ferenc Kovacs and Janos Illes “Frequent Itemset Mining on Hadoop.”,IEEE 9th International conference on Computational Cybernetics, Volume 2 Issue 4, June 2013.

Downloads

Published

2025-11-10

How to Cite

[1]
G. Ahilandeeswari and R. Manicka Chezian, “A Comparative analysis of Association rule excavating in Big Data Mining Algorithms”, Int. J. Comp. Sci. Eng., vol. 3, no. 6, pp. 82–88, Nov. 2025.

Issue

Vol. 3 No. 6 (2015): IJCSE June Edition

Section

Review Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.