0

How to find the Gini index, the entropy, and the classification error for each node of the tree in the figure below. enter image description here

Please help me to compute them.

Nezuko
  • 21
  • 2
  • We have to assume that A and B are intermediary steps, being the squares the end nodes, isn't it? I ask it because apparently that's note the code usually followed: https://en.wikipedia.org/wiki/Decision_tree check **Overview** section. – Memristor Jun 18 '23 at 00:49

1 Answers1

0

The higher the Gini index better it is, in this case, there are two ways to split the data, 1st way is by color, 2nd way is by shape. The Weighted Gini index will decide which attribute should be used for splitting. Gini index tries to put all the similar things into one bucket.

asonagra
  • 1
  • 1