Decision Tree, Entropy, Information Gain, Gini Index.
two new branches pointing downwards. The algorithm is termed is greedy because at each step of the process, the best split is made for that step. It does not project forwards and try and pick a split that might be more optimal for the overall tree. The algorithm therefore evaluates all variables on