Let's begin with ID3 decision tree: The ID3 algorithm tries to get the most information gain when grow the decision trees. The information gain is defined as Gain(A)=I(s1,s2,-,sm)−E(A) where I is the information entropy of a given sample setting, I(s