{'fraction_non_alphanumeric': 0.015789473684210527, 'fraction_numerical': 0.0, 'mean_word_length': 5.010526315789473, '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}}
Direct Mining of Closed Tree Patterns With Subtree Constraint

Two critical bottle necks in mining frequent tree patterns from tree databases are the exponential number of mined patterns and the lack of user focus on the mining process. We propose, in this paper, an algorithm that solves the problems for unordered attribute trees by mining only the compact representation of tree patterns, i.e. closed tree patterns, and allows users to mine only trees of their interest by specifying subtree constraints. The experimental results show the efficiency of our algorithm.