{'fraction_non_alphanumeric': 0.014925373134328358, 'fraction_numerical': 0.0, 'mean_word_length': 5.098484848484849, '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 Algorithm for Relative Attribute Reduction in Decision Table

The relative reduction of attributes in decision table is an important topic in the research on rough set theory. It has been proven that computing all the reductions and the optimal (minimal) reduction of decision table is a NP-hard problem. Most of the algorithms are heuristic and the obtained reductions are sub-optimal. A kind of generalized information table is introduced, on the basis of which a criterion of attribute core and relative attribute reduction is provided. A method for calculating core is presented directly. And then, an algorithm for relative attribute reduction based on the generalized information table is designed, which is suitable for not only consistent decision table but also inconsistent decision table