It is the cache of ${baseHref}. It is a snapshot of the page. The current page could have changed in the meantime.
Tip: To quickly find your search term on this page, press Ctrl+F or ⌘-F (Mac) and use the find bar.

EVALUATING THE PERFORMANCE OF ASSOCIATION RULE MINING ALGORITHMS | Vanitha | Journal of Global Research in Computer Science

EVALUATING THE PERFORMANCE OF ASSOCIATION RULE MINING ALGORITHMS

K. Vanitha

Abstract


Association rule mining is one of the most popular data mining methods. However, mining association rules often results in a very large number of found rules, leaving the analyst with the task to go through all the rules and discover interesting ones. In this paper, we present the performance comparison of Apriori and FP-growth algorithms. The performance is analyzed based on the execution time for different number of instances and confidence in Super market data set. These algorithms are presented together with some experimental data. Our performance study shows that the FP-growth method is efficient and scalable and is about an order of magnitude faster than the Apriori algorithm.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


© 2011 Journal of Global Research in Computer Science (JGRCS)
Copyright Agreement & Authorship Responsibility