{'fraction_non_alphanumeric': 0.013457556935817806, 'fraction_numerical': 0.0010351966873706005, 'mean_word_length': 4.825301204819277, '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 Method for Decision Tree Based Discernibility Matrix and Degree of Consistent Dependence

Rough set theory is a popular mathematical knowledge to resolve problems which are vagueness and uncertainly. And it has been used of solving the redundancy of attribute and data. Decision tree has been widely used in data mining techniques, because it is efficient, fast and easy to be understood in terms of data classification. There are many approaches have been used to generate a decision tree. In this paper, a novel and effective algorithm is introduced for decision tree. This algorithm is based on the core of discernibility matrix on rough set theory and the degree of consistent dependence. This algorithm is to improve the decision tree on node selection. This approach reduces the time complexity of the decision tree production and space complexity compared with ID3.In the end of the article, there is an example of the algorithm can exhibit superiority.