View the step-by-step solution to:


Consider the following training set, where X = {0,1}^3 and Y = {0,1}:


i) (6 Points) Suppose we wish to use this training set in order to build a decision tree of depth 2 (i.e., for each input we are allowed to ask two questions of the form (xi = 0?) before deciding on the label). Construct the decision tree using the greedy algorithm discussed in class. Does it matter whether you use empirical error, entropy, or Gini impurity as your performance metric in this case?

ii) (4 Points) Find a decision tree of depth 2 that attains zero training error.

Recently Asked Questions

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question
Ask Expert Tutors You can ask You can ask ( soon) You can ask (will expire )
Answers in as fast as 15 minutes