AdvancedNumeric answer
Scoring a tree split · Part 3 of 3
A decision-tree node holds 10 training days: 6 up days and 4 down days. A candidate split sends 4 days, all up, to the left and the other 6, 2 up and 4 down, to the right.
Score the same split by information gain, using entropy in bits. What is the gain, to three decimal places?
Answer with a number. Fractions, powers and expressions like 23/6 or C(52,5) are read correctly in practice.
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Learn the method
More machine learning questions
- A node holds 40 positive and 60 negative examples. What is its Gini impurity?Foundation
- A node holds 40 positive and 60 negative examples.Foundation
- Why do gradient-boosted trees usually beat deep networks on daily…Applied
- A node has 50 positives and 50 negatives.Applied
- In gradient boosting, what happens if you halve the learning rate (shrinkage)…Applied
- Two features are nearly identical, and a random forest reports low importance for both.Advanced