APRIORI

Complexity analysis of depth first and FP-growth implementations of APRIORI We examine the complexity of Depth First and FP-growth implementations of APRIORI, two of the fastest known data mining algorithms to find frequent itemsets in large databases. We describe the algorithms in a similar style, derive theoretical formulas, and provide experiments on both synthetic and real life data to illustrate the theory.