Improved C4.5 decision trees algorithm based on variable precision rough set
一种基于变精度粗糙集的C45决策树改进算法*

Aiming at the problems of complexisity and relatively low classification accuracy of decision trees constructed by C4.5 algorithm, this paper proposed a new decision trees classification algorithm (VPRSC4.5) based on the variable precision rough set (VPRS), which took the approximate quality of classification as the heuristic function in order to alleviate the effect of noise data on choosing splitting attributes. It also gave out the solution to the problem how to choose the best attributes as the node when two or more attributes had the same value of approximate quality of classification. Experiments prove that the size and classification accuracy of the decision trees generated by the improved algorithm is superior to the C4.5 algorithm.