{'fraction_non_alphanumeric': 0.020364415862808145, 'fraction_numerical': 0.0, 'mean_word_length': 5.3108108108108105, '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 novel attribute reduction algorithm using condensing tree

Attribute reduction is one of the key problems in rough set theory, and many algorithms based on discernibility matrix have been proposed and studied about it. Unfortunately, the existing algorithms have much higher space complexity. In order to reduce the computational complexity of discernibility matrix method, a novel condensing tree (C-Tree in short) is introduced for storing the same elements or the same attribute prefixes in discernibility matrix. However, the size of a C-Tree greatly may rely on the order of attributes in most cases. In this paper, we present a new attribute ordering strategy using indiscernibility attribute and improve the C-Tree for compressing discernibility elements. Further, we design a novel attribute reduction algorithm with the improved C-Tree. Experiments show that our algorithm outperforms other attribute reduction algorithms.