1. Linearly Separable Example Build the SVM best linear classifier for the following (tiny) data set shown in Figure below. Show your solutions for w and b. You get additional points by solving the margin ?p=2/|w|. Add your SVM decision boundary on the figure below. 3 2 1 0 0 1 2 3
Added by Robert B.
Close
Step 1
First, we need to identify the support vectors. In this case, the support vectors are the points that are closest to the decision boundary. Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 58 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Here is the optimization problem for the soft-margin SVM: Minimize ||w||^2 + C * Σξ Subject to y((w^T * x) + b) ≥ 1 - ξ ξ ≥ 0 where w is the weight vector, x is the input vector, b is the bias term, y is the class label, and C is a constant. How many slack variables are there? The answer should be a function of n and d.
Sri K.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD