Concept guide · Classical algorithms
What is entropy or information gain in a decision tree?
A slower explanation for when the short interview answer is not enough. Start with the intuition, then connect it to the technical idea and the way an interviewer expects you to reason about it.
ML area
Classical algorithms → Core interview concept
Interview format
Core
Question
ML-048
Start with the idea
In simple terms
This question is asking you to explain What is entropy or information gain in a decision tree in a way that connects the idea to a real machine-learning decision. Start with the role this concept plays, then explain what changes when the data, target, or deployment situation changes.
Build the answer
How to reason about it
- 1Define the concept before naming algorithms or implementation details.
- 2Connect it to the data, target, decision, or failure mode in the question.
- 3State the assumption or evaluation check that would make the explanation trustworthy.
Go one level deeper
The technical explanation
Entropy measures uncertainty in a node's class distribution. A split has high information gain when the weighted uncertainty after splitting is much lower than before. Gini impurity serves a similar purpose with a different formula. In practice, the important points are that the split is evaluated on the training data and that the tree still needs constraints to generalise. The safest way to understand this topic is to connect the definition to assumptions, data available at prediction time, the decision it supports, and how you would evaluate whether the result is useful.
Say this in the interview
Entropy measures uncertainty in a node's class distribution. A split has high information gain when the weighted uncertainty after splitting is much lower than before. Gini impurity serves a similar purpose with a different formula. In practice, the important points are that the split is evaluated on the training data and that the tree still needs constraints to generalise.
Keep preparing