Decision tree: compute a Gini split
Easy · Whiteboard
A node has 10 positive and 10 negative examples. A split sends 8 positive and 2 negative left, and 2 positive and 8 negative right. Compute the Gini impurity before and after, and the gain. How does a tree pick its split?
Create a free account to answer it and get scored on what a strong answer covers.