Question: Solve SVM for a data set with 3 data instances in 2 dimensions: (1,1,+), (-1,1,-),(0,-1,-). Here the first 2 numbers are the 2-dimension coordinates.

Solve SVM for a data set with 3 data instances in 2 dimensions: (1,1,+), (-1,1,-),(0,-1,-). Here the first 2 numbers are the 2-dimension coordinates. ‘ +’ in 3rd place is positive class. And ‘-‘ in 3rd place is negative class . Your task is to compute alpha’s, w, b. Then, Solve SVM when data are non-separable, using k=2 when minimizing the violations of the mis-classification, i.e., on those slack variables.

Step by Step Solution

3.58 Rating (165 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To solve an SVM problem for a given dataset we usually need to determine the separating hyperplane that maximizes the margin between the two classes L... View full answer

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!

Related Book