{'fraction_non_alphanumeric': 0.01575757575757576, 'fraction_numerical': 0.0, 'mean_word_length': 5.715447154471545, '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}}
Maximal Sequential Pattern Mining Based on Simultaneous Monotone and Anti-monotone Constraints

The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns, and a lot of patterns are not interesting to users. In this paper, a novel algorithm MSMA (maximal sequential pattern mining based on simultaneous monotone and anti-monotone constraints) incorporating both maximal and constraint-based sequential pattern mining in mining process is proposed. It allows the efficient mining of sequential patterns when both monotone and anti-monotone constraints are simultaneously pushed in mining process at different strategic stages. Our experiment shows that MSMA is an efficient algorithm for handling simultaneous monotone and anti-monotone constraints.