{'fraction_non_alphanumeric': 0.018604651162790697, 'fraction_numerical': 0.0, 'mean_word_length': 5.52020202020202, '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}}
Analysis of Regular-Frequent Patterns in Large Transactional Databases

Regular-frequent patterns are an important type of regularities that exist in transactional, time-series and any other types of databases. A frequent pattern can be said regular-frequent if it appears at a regular interval given by the user specified threshold in the transactional database. The regularity calculation for every candidate pattern is a computationally expensive process, especially when there exist long patterns. Currently the FP-growth algorithm is one of the most popular and fastest approaches to mining periodic frequent item sets. Therefore, in this paper we introduce a novel concept of mining regularfrequent patterns (RFP) in transactional databases. We introduce two mining techniques based on transaction number and also based on products or itemsets on the vertical data format. The efficiency is achieved by eliminating aperiodic or irregular patterns during execution based on suboptimal solutions. Our tree based structure helps to captures the database contents in highly compact manner. Our experimental results are highly efficient and scalable as well as improve the overall response time. Keywords— Frequent patterns, regular patterns, transactional databases, vertical data format.