In this paper, an efficient algorithm named apriori-growth based on apriori algorithm and the FP-tree structure is presented to mine frequent patterns. The advantage of the apriori-growth algorithm is ...

Conditional Pattern Base: Extracts conditional pattern bases for each frequent item and recursively applies the FP-growth algorithm to mine frequent patterns. Pattern Growth: The fptree_growth ...

insert: given a transaction, inserts a path in the fp tree and also links the node to header table constructTree: constructs the initial fp-tree from datafile buildCPB: builds the conditional pattern ...

The main difference to the original FP-Growth is that they skip the FP-tree construction by directly mining the conditional pattern bases, sub-databases, created from the FP-tree, using the projection ...