{'fraction_non_alphanumeric': 0.02030456852791878, 'fraction_numerical': 0.0, 'mean_word_length': 4.844444444444444, '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 frequent pattern based on fading factor in data streams

In order to improve the mining efficiency of frequent patterns in data streams, we present an algorithm DS-FPM for mining frequent patterns in data streams. First, a data structure DSFP-tree is constructed and the data stream is divided into a set of segments, then potential frequent itemsets on each segment are obtained by IGFA algorithm, while the generated itemsets and the remaining itemsets of DSFP-tree generated by the earlier segment and sampled by fading factor are stored in new DSFP-tree, finally, the frequent patterns in the data stream can be rapidly found by a breadth-first search strategy. The experimental result shows that the execution efficiency of DS-FPM is better than that of FPIL-STREAM algorithm.