International Journal of Computer Applications
Frequent patterns are very important in knowledge discovery and data mining process such as mining of association rules, correlations etc. Prefix-tree based approach is one of the contemporary approaches for mining frequent patterns. FP-tree is a compact representation of transaction database that contains frequency information of all relevant Frequent Patterns (FPs) in a dataset. Since the introduction of FP-growth algorithm for FP-tree construction, three major algorithms have been proposed, namely AFPIM (Adjusting FP-tree for Incremental Mining), CATS tree (Compressed and Arranged Transaction Sequence tree), and CanTree (Canonical-order Tree), that have adopted FP-tree for incremental mining of frequent patterns.