Consider the set of training examples in the diagram below:
10
I
0
2
4
6
8
10
Draw the decision boundaries for the 1-nearest neighbor algorithm, assuming that we are using standard Euclidean distance to compute nearest neighbors. A plus indicates a positive example, and a star indicates a negative example. How will the point (8,1) be classified by the 1-nearest neighbor classifier? How will the point (8,8) be classified?