International Conference on Computing, Communication and Sensor Network |
Foundation of Computer Science USA |
CCSN2012 - Number 4 |
March 2013 |
Authors: Ish Nath Jha, Samarjeet Borah |
ae6b95ad-171e-44e2-8d6f-0c51185f5def |
Ish Nath Jha, Samarjeet Borah . An Analysis on Association Rule Mining Techniques. International Conference on Computing, Communication and Sensor Network. CCSN2012, 4 (March 2013), 40-45.
Association rule mining is a subfield of Data mining. It is a popular and widely used method to extract interesting and useful patterns from large sets of data. The first Rule Mining Algorithm was formulated by R. Agrawal in 1993. After the Apriori Algorithm formulated by R. Agrawal, many other algorithms have been proposed. Each of these algorithms has its own advantages and disadvantages over the others. The major issues of concern are the cost efficiency in terms of memory utilization, interestingness of the rules generated, influence of the minimum support level specified on the rules generated, the ability to discover relationships not only quantitatively but also qualitatively and the processing efficiency of the algorithm. This paper provides a comparative analysis on the classical Apriori algorithm along with some other association rule mining algorithms.