{'fraction_non_alphanumeric': 0.022072936660268713, 'fraction_numerical': 0.0, 'mean_word_length': 5.478260869565218, '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}}
Profit based modified I-Prefixspan algorithm

Data mining techniques are used to find novel, potentially useful patterns to derive best knowledge from input dataset. For identifying the usefulness of patterns, many constraints have been proposed like time-interval between itemsets, utility parameters (price, profit, quantity etc.), weight of an itemset etc. Time-interval provides interval between consecutive items and utility parameter (profit) is useful to mine patterns which are more profitable in real world. Most time interval sequential pattern mining approaches are frequency based and Utility mining approaches doesn't include time interval between items. If we can hybridize these approaches, we can mine more useful patterns by means of combining advantages of time constraint and profit of an itemset by removing frequency from time interval sequential pattern mining approach and adding profit instead of it. In this paper we have proposed a modified prefixspan algorithm to find profit based Time-Interval sequential pattern.