{'fraction_non_alphanumeric': 0.024844720496894408, 'fraction_numerical': 0.011180124223602485, 'mean_word_length': 5.346456692913386, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
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 [7] and present the improved algorithm TMp, which uses F2SC to prune invalid candidate subtree patterns. A set of comprehensive performance experiments demonstrates the efficiency of proposed pruning strategy by compare TMp with TREEMINER.