Question: Consider the dataset given below where the decision attribute is the one labeled decision . Build a kd-tree where k = 3 . No partial
Consider the dataset given below where the decision attribute is the one labeled decision. Build a kd-tree where k = 3. No partial credit will be given unless you show your work! (9 pts.)
| x | y | z | decision |
| 1 | 7 | 9 | blue |
| 2 | 5 | 8 | red |
| 3 | 6 | 7 | green |
| 4 | 4 | 0 | green |
| 5 | 3 | 4 | blue |
| 6 | 1 | 6 | blue |
| 7 | 2 | 2 | red |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
