{'fraction_non_alphanumeric': 0.011363636363636364, 'fraction_numerical': 0.0030991735537190084, 'mean_word_length': 5.375, '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}}
A New Method for Eliminating Redundant Association Rules

As one of the fundamental data mining methods, the association rule mining has widely been used in many fields. However, the existence of massive redundant rules has made the analysis very difficult, and has been a main barrier to efficient utilization of discovered association rules. This paper studies the characteristic of commonsense knowledge which is use to eliminate redundant association rules, and analyzes the impact of commonsense knowledge and the special rules whose confidence is 100% on the generation of redundant rules. Some theorems and corollaries of redundant rules are proposed and a new method for eliminating redundant rules based on these theories is proposed. This new method can prune some redundant rules by using commonsense knowledge and the special rules without calculating confidence, so it improved the efficiency of mining and the utilization of discovered association rules.