{'fraction_non_alphanumeric': 0.027586206896551724, 'fraction_numerical': 0.0022988505747126436, 'mean_word_length': 5.697435897435898, '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}}
Frequent Pattern Mining Based on Approximate Edit Distance Matrix

Frequent pattern mining has been a hot topic in many research domains, such as bioinformatics and text retrieval. Many seemingly disorganized constituents connected with different gap constraints often repetitively appear in these real-word sequences, which are considered as latent frequent patterns (FPs). A latent FP both with flexible gap and approximate constraints (replacement, deletion and insertion operations) deepen difficulty to discover its true occurrences. We design a Mining Approximate frequent PAttern (MAPA) algorithm to handle the problem: (1) We first extend an Approximate Edit Distance Matrix (A-EDM) by tackling replacement, insertion and deletion under the gap constraint to discover various deformations of patterns. (2) Then we employ an effectively back-tracking Approximate Pattern Matching (APM) scheme to obtain each candidate latent FP's support. (3) Finally, an Apriori-like deterministic pruning tactic is proposed to avoid generating unnecessary candidates for mining validation. The MAPA algorithm is a unified framework for both exact mining and approximate mining. Experiments on DNA and protein sequences demonstrate that MAPA is efficient on solutions, time and memory consumption than other peers.