Decision trees

Abstract

1. Fill in the boxes in the internal nodes with letters so that exactly one training example and one testing example fall into each leaf. Left branch is‚“yes” and right branch is‚ “no”. 2. Classify each word by filling in the leaf boxes using the labels given in the table. 3. Classify the test set using the leaf values. 4. Use the test set classifications to extract letters from the test set words. Combine these letters into the answer. Decision