A Comparative Study of FP-growth Variations

Finding frequent itemsets in databases is crucial in data mining for purpose of extracting association rules. Many algorithms were developed to find those frequent itemsets. This paper presents a summarization and a comparative study of the available FP-growth algorithm variations produced for mining frequent itemsets showing their capabilities and efficiency in terms of time and memory consumption.