Question
Consider the following dataset: X1 X2 X3 Y T T T 1 F T F 0 T F T 0 F F T 1 If
Consider the following dataset:
| X1 | X2 | X3 | Y |
| T | T | T | 1 |
| F | T | F | 0 |
| T | F | T | 0 |
| F | F | T | 1 |
If we fully train the decision tree using the root feature (as the answer of the previous question) until each leaf has data points of the same output label (i.e., all leaf nodes will be completely homogenous), what will be the depth of that tree?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Database Systems An Application Oriented Approach Complete Version
Authors: Michael Kifer, Arthur Bernstein, Richard Lewis
2nd Edition
0321268458, 978-0321268457
