FP-Bonsai: The Art of Growing and Pruning Small FP-Trees

Abstract. In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this paper, we integrate the recently proposed ExAnte data reduction technique within the FP-growth algorithm. Together, they result in a very efficient frequent itemset mining algorithm that effectively exploits monotone constraints.

• Type: Conference
• Year: 2004
• Where: PAKDD
• Authors: Francesco Bonchi, Bart Goethals
• Keywords: Data Mining, ExAnte Data Reduction, Frequent Itemset Mining, Mining Frequent Itemsets, PAKDD 2004