{'fraction_non_alphanumeric': 0.02002503128911139, 'fraction_numerical': 0.0, 'mean_word_length': 5.25, '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 Method for Finding Implicating Rules Based on the Genetic Algorithm

In information system, some rules have implicating relations (called implicating rules), but some rules have not. An approach of finding implicating rules based on the genetic algorithm is proposed. Some properties of independence and correlation of descriptions are discussed. It can obtain directly the implicating rules (including the positive and negative rules) with the correlation of two descriptions according to strength of implication defined in this paper. At the same time, an algorithm for finding optimized rules based on genetic algorithm is presented. By it, the problem of efficiency of finding rules is solved. At last, the efficiency and practicability of the method are illustrated by the experiment results.