{'fraction_non_alphanumeric': 0.017453798767967144, 'fraction_numerical': 0.0, 'mean_word_length': 5.724137931034483, '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}}
Efficient Reduction on Decision Implication

With the growth of the data table, the number of the generated concepts increases dramatically, and it makes the decision-making more complex. Different from the existing related works that mainly focused on acquisition of decision rules based on decision formal context, this paper focuses on reduction on decision implication, by means of computing the covers of an object set. In this paper, we compute decision formal context, which forms the basis of this paper, nonredundant limitary decision implication with more simplified form is deduced compared to decision rules meanwhile. In addition, we put forward judging theorems of handling redundant limitary decision implications and generating decision formal context with demonstrations for simplification of decision-making; subsequently, which suggests an algorithm and discusses the time complexity. Experimental results demonstrate that the proposed method is feasible.