{'fraction_non_alphanumeric': 0.015711645101663587, 'fraction_numerical': 0.0, 'mean_word_length': 5.153409090909091, '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}}
Rough set based attribute reduction approach in data mining

In previous attribute reduction researches, the criteria of reduction are intended that the numbers of attributes are the least, the last rules are the simplest or amount of reduction is the most. But in database theory, the criteria are that the redundancy of attributes and dependency of attributes are as few as possible. According to these, authors propose the rough set based attribute reduction algorithm. The decision table is judged firstly whether or not it is consistent. To the complete consistent table, using the knowledge of rough set and information theory, authors get attribute reduction set by discernibility matrix, and compute relevance of attributes through conditional entropy. The best attribute reduction is the set which value is the minimum of average of attribute relevance. To the complete inconsistent table, authors make directly the decision rules with rough operator. The experiment shows it can get better effect. Reduction results of UCI databases are gotten through using the algorithm.