CS156
Chris Pollett
Dec 6, 2017
Putting this all together we get the following algorithm:
The book has a graph showing that decision tree learning in the restaurant example is only slightly better than using a feed-forward network.
Imagine we have eight points on the unit circle at `-pi/4`, `(-pi)/2` `(-3pi)/4`, 0, `pi/4`, `pi/2`, `(3pi)/4`, `pi` radians. Points which are a integer multiple of `pi/2` are in some set X, other points are out of X. Using the three nearest neighbors, is the point on the unit circle at `(3pi)/8` radians in out of the set? Put the elements above into a `2-D` tree. (Tell me how you break ties and what metric you use for the distance function.)
Post your answers to these question to the Dec 6 In-Class Exercise Thread.