Mining Tree Patterns Using Frequent 2-Subtree Checking

In this paper, we systematically explore the problem of frequent subtree mining and present a novel pruning strategy, F2SC (frequent 2-subtree checking), which can be used in all Apriori-like subtree mining algorithms. With a little more memory overhead of keeping frequent 2-subtrees list, F2SC can prunes the invalid candidate which contains infrequent 2-subtree by checking the frequent 2-subtrees list and decreases the total cost of frequency counting effectively. At the same time, we optimize TREEMINER and present the improved algorithm TM
_p
, which uses F2SC to prune invalid candidate subtree patterns. A set of comprehensive performance experiments demonstrates the efficiency of proposed pruning strategy by compare TM
_p
with TREEMINER.