Question: Consider a simple binary classification problem with 1 - dimensional inputs and re - sponses being + 1 , - 1 . Suppose that we

Consider a simple binary classification problem with 1-dimensional inputs and re-
sponses being +1,-1. Suppose that we are given 9 training data points shown in
the following figure:
Answer the following questions.
(a) We can use the 1-nearest neighbor classifier to predict the label of an arbitrary
test data input x_(test ). Mark on the axis of real numbers all such x_(test ) in the
interval 0,6 for which the prediction is y_(pred )=+1.
[4 marks]
(b) We can also use the 7-nearest neighbor classifier to predict the label of x_(test ).
Mark on the axis of real numbers all such x_(test ) in the interval 0,6 for which
the prediction is y_(pred )=+1.
[4 marks]
(c) For k=1,3,5,7,9, denote by f_(k)(x) the k-nearest neighbour classifier given
by the 9 training data points. For which value(s) of k is x=2 on the decision
boundary of f_(k)(x)?
[6 marks]
[Total: 14 marks]
Consider a simple binary classification problem

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!