![]() ![]() ![]() length_gt_5=y, has_teeth=y, big_and_scary=y, flies=n -> monster length_gt_5=n, has_teeth=n, big_and_scary=y, flies=y -> monster length_gt_5=n, has_teeth=n, big_and_scary=n, flies=n -> not_monster length_gt_5=n, has_teeth=n, big_and_scary=y, flies=n -> not_monster. Has_teeth, big_and_scary, and flies, we classify into monsterĪnd not_monster. For example, given the features length_gt_5, Part I: Decision Tree Learning (60%)Ī classification problem is a problem where you classify instances intoĬlasses based on their features. For the writeup, publish it as a doc, rtf, or pdf document and include it with your submission as a separate file. ![]() For the code, it should all be in project4.py (see below) follow the standard submission convention you used in projects 1-4. Your submission should consist of your code and In the second part, you will provide a writeup In the first part, you will code up decision tree learningĪnd test it on various data sets. The hope is that, as you work on this project, you will come to understand the supervised learning process. You will code up decision tree learning and then apply it to several relatively simple problems. This project is intended to familiarize you with one of the standard approaches to classification problems, decision trees. It is different from previous assignments. Read all the way through this assignment before starting. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |