Comparative Study of Top 10 Algorithms for Association Rule Mining
DOI:
https://doi.org/10.26438/ijcse/v5i8.190195Keywords:
Data mining, Association rules, Apriori, FP-Growth, Eclat, dEclatAbstract
We live in a world where each day tons and tons of data is generated from millions of sources. Companies and organizations thrive for this data in order to acquire valuable information that helps them understanding their customer needs and demands. This valuable insight collaborates in improving the services and products – thus enhancing the overall business and profits. Filtering out such significant information thus requires employing some data mining algorithms. Data mining is a wide area of study that is further developing day by day and is very useful in deriving important information and coherence from large and raw datasets. When we talk about one very well-known field of business, known as Market Basket Analysis – data mining has significantly affected this sector. As the name suggests, it is an analysis of shopper’s basket at a mart. We generally see various items arranged on the shelves in the malls and supermarkets; we also observe certain products recommended to us when we shop online. All of this is worked in the back-end with the help of data-mining algorithms that provide a proper analysis of customer buying patterns and hence it makes the relations and suggests them to the customers, which in turn results in an enhanced sales. Technically, association rule mining and frequent itemset mining is done for such analysis. These algorithms are also used in designing various games and in recommendation systems. In this paper we are thus understanding these algorithms and compare the efficiency of the most common ones on the basis of factors such as time, support and memory consumed.
References
. Agrawal R, Srikant R., “Fast algorithms for mining association rules”, InProc. 20th int. conf. very large data bases, VLDB, Vol. 1215, pp. 487-499, 1994.
. Han J, Pei J, Yin Y, Mao R., “Mining frequent patterns without candidate generation: A frequent-pattern tree approach”, Data mining and knowledge discovery, Vol.8, Issue.1, pp.53-87, 2004.
. Akilandeswari. S and A.V.Senthil Kumar, "A Novel Low Utility Based Infrequent Weighted Itemset Mining Approach Using Frequent Pattern", International Journal of Computer Sciences and Engineering, Vol.3, Issue.7, pp.181-185, 2015.
. Lei Wen, “An efficient algorithm for mining frequent closed itemset,” Fifth World Congress on Intelligent Control and Automation, Vol. 5, pp. 4296-4299, 2004.
. M. J. Zaki and K. Gouda, “Fast vertical mining using diffsets,” Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD ’03, PP.pp. 326-335, 2003.
. J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang. "H-Mine: Fast and space-preserving frequent pattern mining in large databases", IIE Transactions, Vol.39, Issue 6, pp.593-605, 2007.
. Takeaki Uno, Masashi Kiyomi and Hiroki Arimura, “LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets”,. Proc. IEEE ICDM Workshop on Frequent Itemset Mining Implementations Brighton, UK, November 1, 2004.
. Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., &Lakhal, L., “Mining frequent patterns with counting inference”, ACM SIGKDD Explorations Newsletter, Vol.2, Issue.2, 66-75, 2000.
. P. Sagar, M. Goyal, "A Review: Comparative Analysis of various Data Mining Techniques", International Journal of Computer Sciences and Engineering, Vol.4, Issue.12, pp.56-60, 2016.
. JHS Tomar, JS Kumar, "A Review on Big Data Mining Methods", International Journal of Scientific Research in Network Security and Communication, Vol.4, Issue.3, pp.7-14, 2016.
. R.J. Bayardo, “Efficiently Mining Long Patterns from Databases”, ACM SIGMOD Conf. Management of Data, June 1998.
. M.Manigandan and K. Aravind Kumar, "Secure Multiparty Protocol for Distributed Mining of Association Rules", International Journal of Scientific Research in Computer Science and Engineering, Vol.3, Issue.1, pp.6-10, 2015.
. R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules”, Proc. 20th Very Large Data Base Conf., Sept. 1994.
. D. Gunopulos, H. Mannila, and S. Saluja, “Discovering All the Most Specific Sentences by Randomized Algorithms”, Int'l Conf. Database Theory, pp. 215-29, Jan. 1997.
. S. Brin, R. Motwani, J. Ullman, and S. Tsur, “Dynamic Itemset Counting and Implication Rules for Market Basket Data”, Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD ’97, 1997.
. M. J. Zaki and C.-J. Hsiao., “CHARM: An efficient algorithm for closed association rule mining”, Technical Report 99-10, Computer Science Dept., Rensselaer Polytechnic Institute, October 1999.
. D. Cheung, J. Han, V. Ng, A. Fu, and Y. Fu, “A Fast Distributed Algorithm for Mining Association Rules”, Fourth Int'l Conf. Parallel and Distributed Information Systems, Dec. 1996.
. B.A. Davey, H.A. Priestley, “Introduction to Lattices and Order”, Cambridge Univ. Press, 1990.
. D. Eppstein, “Arboricity and Bipartite Subgraph Listing Algorithms”, Information Processing Letters, Vol.51, pp. 207-211, 1994.
. Philippe Fournier-Viger, “An Open-Source Data Mining Library”, www.philippe-fournier-viger.com
. M.R. Garey and D.S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness”, Revista Da Escola De Enfermagem Da USP, Vol.44, Issue.2, pp.340, 1979.
Downloads
Published
How to Cite
Issue
Section
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.
