Class Activity 17: More decision tree implementation
DueApr 28, 2020 by
2pm
Points1
Submittinga file upload
Available
after Apr 27, 2020 at 2pm
Complete the evaluation() and findBestThreshold() methods. The evaluation() method should use information gain as explained and the findBestThreshold() should use the algorithm described in the GI17 videos. If you finish within 65 minutes, test your code using the SMS spam data set. You should be able to use the kNN evaluation code to evaluate the performance of your decision tree.
There is solution code for Class Activity 16 and GI17 on the class Dropbox in the gi17-solutions folder.
Work on completing this for 65 minutes. Submit the files you modified after that time.
158809680004/28/202002:00pm
Rubric
true
22268
Can't change a rubric once you've started using it.
This criterion is linked to a Learning OutcomeIt is clear that you attempted the to implement the two methods for 65 minutes (that is, you should have made reasonable progress)9766_1405