| NDC Index | Personal Data | System Log | CV | Code | Research | Articles & Reviews |
This is an implementation of FP-Growth-Tiny which introduces a space optimization to FP-Growth algorithm for mining frequent itemsets in a transaction database.
The algorithm is described in the Research section.
The code contains libraries, CLI frontends and a few other tools suited for this task.
Note: Frequent itemset or frequency mining is the core of popular mining methods such as association rule mining and sequence mining.
This package contains various skeleton projects for C/C++. Their common feature is that they try to be generic, consistent, minimal and portable using only standard libraries and programs.
They are intended to be good starting points to write pure C/C++ programs under GNU/Linux systems. Thus, they assume a recent version of gnu tool chain.
Skel is distributed under GNU GPL, you may download the latest version here: