Question 17
Which of the following statements about entropy and information gain in decision-tree learning are correct?
If a feature splits a node into perfectly pure children, its information gain at that node equals the entropy of that node.
Information gain can be negative if a split increases impurity.
After a parent node is split into child nodes, no individual child node can have entropy greater than the parent node's entropy.