GATE DA 2024 Q62: Information gain of the Pitch attribute in a decision tree
- Machine Learning
- 2 marks
- NAT
- No negative marking
Question
Details of ten international cricket games between two teams "Green" and "Blue" are given in Table C. This table consists of matches played on different pitches, across formats along with their winners. The attribute Pitch can take one of two values: spin-friendly (represented as ) or pace-friendly (represented as ). The attribute Format can take one of two values: one-day match (represented as ) or test match (represented as ).
A cricket organization would like to use the information given in Table C to develop a decision-tree model to predict outcomes of future games between these two teams.
To develop such a model, the computed InformationGain(C, Pitch) with respect to the Target is ______ (rounded off to two decimal places).
| Match Number | Pitch | Format | Winner (Target) |
|---|---|---|---|
| 1 | Green | ||
| 2 | Blue | ||
| 3 | Blue | ||
| 4 | Blue | ||
| 5 | Green | ||
| 6 | Blue | ||
| 7 | Green | ||
| 8 | Blue | ||
| 9 | Blue | ||
| 10 | Green |
Try it: numerical answer: type the value
Show answer and explanation
Answer: 0.12 to 0.13 (official GATE 2024 final answer key)
Concept used: Information gain = entropy of the target − weighted entropy after splitting on the attribute.
First step: Overall 4 Green / 6 Blue gives ; Pitch has 3 Green / 2 Blue (), has 1 Green / 4 Blue ().
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2024 DA question paper and final answer key, organised by IISc Bangalore. Question paper · Answer key