{'fraction_non_alphanumeric': 0.019428571428571427, 'fraction_numerical': 0.0, 'mean_word_length': 5.169014084507042, '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}}
An Efficient Algorithm to Mine Unordered Trees

Mining unordered trees are very useful in domains like XML Date, Biological Information, Web Structure, etc. In this paper, we introduce an efficient algorithm UTMiner (Unordered Trees Miner). As the trees are unordered, in order to avoid mining the same subtrees, an efficient unordered trees standardization is first introduced to transform the unordered trees into the standard subtrees. Then UTMiner is used to get all standardized subtrees. UTMiner builds a multilayered data structure based on subtree vector and the hash table so it reduces isomorphism time in the mining process. It requires only one database scanning so it reduces the scanning times and improves the efficiency, particularly in a large database’s mining process. Many experiments have shown that the UTMiner is feasible and more efficient than other.