{'fraction_non_alphanumeric': 0.012948207171314742, 'fraction_numerical': 0.0, 'mean_word_length': 5.203703703703703, '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}}
Fuzzy sequential pattern mining with sliding window constraint

Sequential pattern mining is to discover all subsequences that are frequent. The classical sequential pattern mining algorithms do not allow processing of numerical data and require preprocessing of these data into a binary representation, which necessarily leads to a loss of information. Fuzzy sets are used to overcome this problem. In present fuzzy sequential pattern mining algorithms, there isn't any matter of itemset time and sequences are only found based on sequence of happening. In this paper, a novel fuzzy sequential pattern algorithm is proposed with sliding window constraint which permits elements of a pattern to span a set of transactions within a user-specified window. Therefore, loss of useful sequences is prevented in the search process. The proposed algorithm searches for a goal sequence within the defined fuzzy sliding window and the membership degree of sliding window is returned if the goal sequence is found.