For decision trees, we can either compute the information gain and entropy or gini index in deciding the correct attribute which can be the splitting attribute. Can anyone send an worked out example of Gini index
I understood that in case of gini index,we try to minimize and take that value for splitting and in ginigain ,the one that gives maximum value for splitting,am I right?But when do we use gini index and ginigain?