Research on Decision Tree for Attribute Classified by the Value
Ju Liu · Journal of Chengdu University of Information Technology · 2013
In order to improve the accuracy and reduce the computation complexity in the construction of the decision tree,according to theoretical principle of granulation distinguish,the attribute is divided by the value into several subsets(grain)as the basic judgment unit,and the logical expression decision algorithm is put forward based on partition sets of leaves and branchses.The condition attribute grain length can be assigned as amount of the leaves,and the grain of the corresponding decision-making is the acceptable branch quantity,the resolution of attribute grain is determined by ratio strength of leaf and branch,then the division attribute is directly determined by the global resolution relationship,the decision tree is constructed from top to down.The example analysis results show that the algorithm is simple and accurate.