(C is class labels). No. x1 x2 x3 c(x1,x2) D1 0 0 1 + D2 0 0 2 + D3 0 0 3 + D4 0 0 4 + D5 0 1 1 - D6 0 1 2 - D7 0 1 3 - D8 1 0 4 - D9 1 1 1 + D10 1 1 2 +
(C is class labels). No. x1 x2 x3 c(x1,x2) D1 0 0 1 + D2 0 0 2 + D3 0 0 3 + D4 0 0 4 + D5 0 1 1 - D6 0 1 2 - D7 0 1 3 - D8 1 0 4 - D9 1 1 1 + D10 1 1 2 +
Related questions
Question
Show the steps of decision tree induction algorithm for the following data. The
concepts to be learnt are C(x1,x2) (C is class labels).
| No. | x1 | x2 | x3 |
c(x1,x2) |
| D1 | 0 | 0 | 1 | + |
| D2 | 0 | 0 | 2 | + |
| D3 | 0 | 0 | 3 | + |
| D4 | 0 | 0 | 4 | + |
| D5 | 0 | 1 | 1 | - |
| D6 | 0 | 1 | 2 | - |
| D7 | 0 | 1 | 3 | - |
| D8 | 1 | 0 | 4 | - |
| D9 | 1 | 1 | 1 | + |
| D10 | 1 | 1 | 2 | + |
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 8 steps with 2 images
