Fig. 5

Behavior of F2G (detailed in [17]). The FP-tree is created from the inputted database with transactions annotated in leafs; a conditional pattern is created for each node in the FP-tree; conditional FP-trees are projected from each conditional pattern (transactions moved up along the tree to enable the discovery of full-patterns); conditional FP-trees are recursively mined and patterns grown if frequent; whenever a conditional FP-tree contains a single path, all frequent patterns are enumerated