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.
CITATION STYLE
Perner, P., Rosenfeld, A., Kosters, W., Pijls, W., & Popova, V. (2003). How many trees in RF, 2734(July 2012), 77-119–119. Retrieved from http://www.springerlink.com/content/mm0aegv576cf8wqe/
Mendeley helps you to discover research relevant for your work.