|32 bit||64 bit||(32/64 bit only for executable)|
|fpgrowth||(346 kb)||fpgrowth||(376 kb)||GNU/Linux executable|
|fpgrowth.exe||(224 kb)||fpgrowth.exe||(254 kb)||Windows console executable|
|fpgrowth.zip||(212 kb)||fpgrowth.tar.gz||(194 kb)||C sources, version 5.8, 2014.05.13|
|census.zip||(390 kb)||census data set (UCI ML repository)|
|census||(1 kb)||shell script used for the conversion|
FP-growth is a program to find frequent item sets (also closed and maximal as well as generators) with the FP-growth algorithm (Frequent Pattern growth [Han et al. 2000]), which represents the transaction database as a prefix tree which is enhanced with links 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. The implementation also supports filtering for closed and maximal item sets with conditional item set repositories as suggested in [Grahne and Zhu 2003], although the approach used in the program differs in as far as it used top-down prefix trees rather than FP-trees. It does not cover the clever implementation of FP-trees with two integer arrays as suggested in [Rasz 2004].
Note that the current version of this program can only find frequent item sets, not association rules.
This implementation may also be used through the Python interface provided by the PyFIM library.
Full description of the Fp-growth program (included in the source package).
If you have trouble executing the program on Microsoft Windows, check whether you have the Microsoft Visual C++ Redistributable Packages for Visual Studio 2013 installed, as the C program was compiled with Microsoft Visual Studio 2013.
Papers that describes this algorithm/implementation:
Some other references:
More information about frequent item set mining, implementations of other algorithms as well as test data sets can be found at the Frequent Itemset Mining Implementations Repository.