This question is from the book Pattern Classification by Duda, Hart, & Stork.

Consider a support vector machine and the following 2D features from two classes: 221 20 1 a) Plot these six training samples, and construct by inspection the weight vector for the optimal hyperplane with the maximum margin. b) Which data points are the support vectors? (c) Construct the SVM solution using the dual cost function obtained by the La- grange multipliers ?'s. Compare your result to that in part (a). (Hint: first assume that all of the ?'s are non-zero, and then if needed, assume that the ?'s are zero ome at a time. Consider a support vector machine and the following 2D features from two classes: 221 20 1 a) Plot these six training samples, and construct by inspection the weight vector for the optimal hyperplane with the maximum margin. b) Which data points are the support vectors? (c) Construct the SVM solution using the dual cost function obtained by the La- grange multipliers ?'s. Compare your result to that in part (a). (Hint: first assume that all of the ?'s are non-zero, and then if needed, assume that the ?'s are zero ome at a time