Which of the following statements are true about decision tree induction? Select one or more. Incorrect answers will be penalized.

Question

Answer

During tree induction nodes can have a negative entropy but the information gain is always positive.

Answer

During tree induction nodes will always have a non-negative entropy and the information gain is always non-negative.

Answer

During tree induction nodes will always have values between 0 and 1 for both the Gini index and information gain ratio (using entropy).

Answer

During tree induction a node with the same number of instances belonging to class A and B and no other classes, will have a Gini index that is half of the entropy.

Crowdly

Which of the following statements are true about decision tree induction? Select...

Хочете миттєвий доступ до всіх перевірених відповідей на stemlearn.sun.ac.za?