Comparative Study of Frequent Itemset Mining Algorithms Apriori and FP Growth

Abstract

Frequent itemset mining leads to the discovery of associations among items in large transactional database. In this paper, two algorithms[7] of generating frequent itemsets are discussed: Apriori and FP-growth algorithm. In apriori algorithm candidates are generated and testing is done which is easy to implement but candidate generation and support counting is very expensive in this because database is checked many times. In the fp-growth, there is no candidate generation and requires only 2 passes over the database but in this the generation of fp-tree become very expansive to built and support is counted only when entire dataset is added to fptree. The comparison of these algorithms will tell which algorithm is better to perform.