0
$\begingroup$

in support vector machines the idea is to find a decision boundary in which the margin is maximized. This can be written as $$ \text{minimize} \ \lVert w \rVert$$ $$\text{subject to} \ \ y_{i}(\boldsymbol{x}_i \cdot \boldsymbol{w}+b) \geq 1$$

What is the optimal decision boundary based on the above minimization problem. I know that this is a quadratic programming problem and various techniques can be used to solve it. But how would you formulate the optimal decision boundary using the above variables?

$\endgroup$
  • $\begingroup$ Please explain what you mean by "actual" solution. $\endgroup$ – whuber Jul 18 '14 at 17:19
  • $\begingroup$ @whuber: What is the optimal decision boundary based on the above minimization problem? $\endgroup$ – svmguy Jul 18 '14 at 17:28
  • $\begingroup$ Why don't you search our site for svm? This question has been explicitly answered--with working code and illustrations--in several threads. $\endgroup$ – whuber Jul 18 '14 at 17:30

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.