In: Statistics and Probability
In a decision tree, how does the algorithm pick the attributes for splitting?
Would you explain it logically and specifically?
Answer :
in choice tree :
the calculation id3 is as per the following,
the id3 calculation is run recursively on the non leaf branches, until all information is grouped.
A choice tree is constructed best down from a root hub and includes dividing the information into subsets that contain occurrences with comparative qualities (homogeneous). ID3 calculation utilizes entropy to ascertain the homogeneity of an example. On the off chance that the example is totally homogeneous the entropy is zero and on the off chance that the example is similarly separated, at that point it has entropy of one.