CS 246 Final: CS246 Final Exam Solutions Winter 2011
31 Jan 2019
School
Department
Course
Professor
Document Summary
Be sure to give yourself time to answer all of the easy ones, and avoid getting bogged down in the more di cult ones before you have answered the easier ones: you have 180 minutes, good luck! We have some data about when people go hiking. The data take into e ect, wether hike is on a weekend or not, if the weather is rainy or sunny, and if the person will have company during the hike. Find the optimum decision tree for hiking habits, using the training data below. When you split the decision tree at each node, maximize the following quantity: where d, dl, dr are parent, left child and right child respectively and i(d) is: ) = mh( m m and h(x) = x log2(x) (1 x) log2(1 x), 0 x 1, is the entropy function and m = m++m is the total number of positive and negative training data at the node.
