The LUCS-KDD Implementation of the FP-growth algorithm

The LUCS-KDD Implementation of the FP-growth algorithm: "A popular "preprocessing" tree structure is the FP-tree proposed by Han et al. (2000). The FP-tree stores a single item (attribute) at each node, and includes additional links to facilitate processing. These links start from a header table and link together all nodes in the FP-tree which store the same "label", i.e. item.

To illustrate the method, considering the simple data set:"

'via Blog this'