FPgrowth

FPgrowth is a program to find frequent item sets (also closed and maximal) with the fpgrowth algorithm (frequent pattern growth, Han et al 2000), which represents the transaction database as a prefix tree which is enhanced with pointers that organize the nodes into lists referring to the same item. The search is carried out by projecting the prefix tree, working recursively on the result, and pruning the original tree. Since version 1.2 this implementation also contains the alpha-pruning of the FP-Bonsai techniques.