Decision Tree, Cart, Machine Learning.
manner. Next, we find the average of the adjacent pairs of numeric values. Say, we obtained the averages as shown above. So, avg_1=(val_1+val_2)/2. Next, we fit the average values in the condition to check which provides the minimum Gini Impurity index or which provides the maximum information