{'fraction_non_alphanumeric': 0.011347517730496455, 'fraction_numerical': 0.0, 'mean_word_length': 5.034188034188034, '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}}
An Algorithm to Improve the Effectiveness of Apriori

Apriori is one of the most important algorithms used in rule association mining. In this paper, we first discuss the limitations of the Apriori algorithm and then propose an enhancement for improving its efficiency. The improved algorithm is based on the combination of forward scan and reverse scan of a given database. If certain conditions are satisfied, the improved algorithm can greatly reduce the scanning times required for the discovery of candidate itemsets. Theoretical proof and analysis are given for the rationality of our algorithm. A simulation instance is given in order to show the advantages of this algorithm compared with Apriori.