New Decision Tree Algorithm

In order to solve the multiple-valued deviation of decision tree algorithm ID3,the character of attribute similarity biasing to few value attribute is used and a new decision tree algorithm is proposed whose choosing attribute standard is taking attribute similarity as the coefficient of information entropy. The experiment result shows that the new the algorithm avoids both the multiple-valued deviation of the decision tree algorithm which takes information entropy as its choosing attribute standard and the few value attribute deviation of the decision tree algorithm which takes attribute similarity as its choosing attribute standard.