{'fraction_non_alphanumeric': 0.012987012987012988, 'fraction_numerical': 0.0, 'mean_word_length': 5.8088235294117645, '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}}
Disk-resident high utility pattern mining: A trie structure implementation

High utility pattern mining is useful for identification of the most valuable itemsets in incremental databases. We propose algorithm for constructing IHUP_TWU tree structure using trie structure. We further propose mining algorithm for identifying most valuable itemsets by using trie structures. Experiments show that algorithms are efficient as compared to other existing algorithms.