The week's pick
Reseach Article
Comparative Survey on Association Rule Mining Algorithms
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 84 - Number 10 |
| Year of Publication: 2013 |
| Authors: Manisha Girotra, Kanika Nagpal, Saloni Minocha, Neha Sharma |
10.5120/14612-2862
|
Manisha Girotra, Kanika Nagpal, Saloni Minocha, Neha Sharma . Comparative Survey on Association Rule Mining Algorithms. International Journal of Computer Applications. 84, 10 ( December 2013), 18-22. DOI=10.5120/14612-2862
Abstract
Association rule mining has become particularly popular among marketers. In fact, an example of association rule mining is known as market basket analysis. The task is to find which items are frequently purchased together. This knowledge can be used by professionals to plan layouts and to place items that are frequently bought together in close proximity to each other, thus helping to improve the sales. Association rule mining involves the relationships between items in a data set. Association rule mining classifies a given transaction as a subset of the set of all possible items. Association rule mining finds out item sets which have minimum support and are represented in a relatively high number of transactions. These transactions are simply known as frequent item sets. The algorithms that use association rules are divided into two stages, the first is to find the frequent sets and the second is to use these frequent sets to generate the association rules. In this paper the applications, merits and demerits of these algorithms have been studied. This paper discusses the respective characteristics and the shortcomings of the algorithms for mining association rules. It also provides a comparative study of different association rule mining techniques stating which algorithm is best suitable in which case.
References
- Seminar-Reports/008/67999308-datamining-intro. pdf
- Aggarwal, R. , and Srikant, R. "Fast Algorithms for Mining Association Rules". Proceedings of the 20th VLDB Conference Santiago, Chile, 1994.
- Webb, I. G. "Efficient Search for Association Rules". 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2000), Boston, MA, New York, NY.
- Hipp, J. , G¨untzer, U. , and Nakhaeizadeh, G. "Algorithms for Association Rule Mining – A General Survey and Comparison", SIGKDD Explorations ACM, JULY 2000.
- 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.
- Borgelt, C. "Efficient Implementations of Apriori and Eclat". Workshop of frequent item set mining implementations (FIMI 2003, Melbourne, FL, USA).
- Thieme, S. L. "Algorithmic Features of Eclat". FIMI, Volume 126 of CEUR Workshop Proceedings, CEUR-WS. org, 2004.
- Borgelt, C. "Finding frequent itemsets by Recursive Elimination algorithm". Workshop Open Source Data Mining Software (OSDM'05, Chicago, IL), 1-5 ACM Press, New York, NY, USA 2005.
- Divya, R. , and Kumar, V. S. "Survey on AIS, Apriori and FP-Tree algorithm". International Journal of Computer Science and Management Research. Volume 1 Issue 2 September-2012 ISSN 2278-733X.
- Khurana, K. , and Sharma, S. "A comparative analysis of association rule mining algorithms". International Journal of Scientific and Research Publications, Volume 3, Issue 5, May 2013.
- Ziauddin, Kammal, S. , Khan, Z. K. , and Khan, I. M. , "Research on association rule mining". ACMA Volume 2, no. 1, 2012, ISSN 2167-6356. World science Publisher, United States, 2012.
Index Terms
Keywords