{'fraction_non_alphanumeric': 0.027095681625740897, 'fraction_numerical': 0.0, 'mean_word_length': 5.530386740331492, '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}}
Share-Inherit: A novel approach for mining frequent patterns

Mining frequent patterns has attracted considerable attention in the data mining field. Most of the current studies adopt the pattern growth approach of divide-and-conquer. However, as the mining process is completely split into parts, all relevant algorithms still encounter some performance bottlenecks. In this study, we propose a new data structure, Share-struct, which is derived but obviously different from FP-tree. Then we developed an efficient algorithm, Share-Inherit, for mining all frequent patterns. Based on the Share-struct, Share-Inherit provides a way to share most of the results from the previous mining process instead of separating them distinctively, thereby dramatically reducing the cost of traversing FP-tree and significantly improving the performance of algorithms based on pattern growth. Furthermore, various optimization techniques used in Share-Inherit sufficiently improve the algorithm. The experimental results show that Share-Inherit algorithm not only performs better than the existing algorithms using pattern growth, but also improves them by incorporating Share-Inherit strategy.