{'fraction_non_alphanumeric': 0.012696041822255415, 'fraction_numerical': 0.0007468259895444362, 'mean_word_length': 4.75107296137339, '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 framework for integrating a decision tree learning algorithm and cluster analysis

We proposed a modified decision tree learning algorithm to improve this algorithm in this paper. Our proposed approach classifies given data set by a traditional decision tree learning algorithm and cluster analysis and selects whichever is better according to information gain. In order to evaluate our approach, we did an experiment using program-generated data sets. We compared ID3 which is one of well-known decision tree learning algorithm to our approach about the recall ratio in this experiment. Experimental result shows the recall ratio of our approach is similar than the recall ratio of a traditional decision tree learning algorithm. Though we can not show the advantage of our approach according to the experiment, we show it is worth using cluster analysis to make a decision tree. In future, we have to evaluate our approach according to cross-validation method using big and complex data sets in order to say the advantage of our approach. We think our approach is not good for all data set, so we try to find the situation which our approach is better than other approaches according to the experimental results. In addition to, we have to show how to explain a decision tree by our approach to keep the readability of a decision tree.