problem in thepicture

Problem 1. Consider a binary classification problem in one-dimensional space where the sample contains four data points S = {(1, -1), (-1, -1), (2, 1), (-2,1)} as shown in Fig. 1. -3 -2 3 Figure 1: Red points represent instances from class + 1 and blue points represent instances from class -1. a) Define Hr = [t, co). Consider a class of linear separators H = {H,:t ( R), i.e., for VH, EH, H. (x) = 1 if x 2 t otherwise -1. Is there any linear separator H, E H that achieves 0 classification error on this sample? If yes, show one of the linear separators that achieves 0 classification error on this example. If not, briefly explain why there cannot be such linear separator. (10 points) b) Now consider a feature map o : R - R- where o (x) = (x, x2). Apply the feature map to all the instances in sample S to generate a transformed sample S = {($(x), y): (x, y) ES}. Let H = fax, + ax2 +c >0: a" + 62 # 0} be a collection of half-spaces in R2 . More specifically, Habe((x1 x2)) = 1 ifax, + ax2 + c 2 0 otherwise -1. Is there any half-space H C H that achieves 0 classification error on the transformed sample S? If yes, give the equation of the maxmargin linear separator and compute the corresponding margin. (10 points) c) What is the kernel corresponding to the feature map (. ) in the last question, i.e., give the kernel function K(x, z): R x R - R. (10 points)