An Improved Pre-pruning Algorithm Based on ID3

As a popular algorithm of decision tree,ID3 is widely used because of its simple idea and facile realization.However,the structure of the tree produced by this algorithm is usually too large and complex,thus the performance of the algorithm is restricted.In order to enhance the efficiency of the tree-producing process and avoid overfitting,we take the classification effect of each classifying attribute into account,that is,if the classification effect reaches a certain level,the process of classification of that branch will be terminated,and propose an improved algorithm by using the maximum support and adopting pre-pruning strategy.The experiment results show that the improved algorithm can make decision tree simpler without reducing precise.