quadprog function for non-separable data-set

2013 3 2
1 个回答
3 次查看（30 天）

0 个投票

I want to implement svm for two sets of non-separable cases using svm primal form(without using built-in functions). In the minimize quadratic function, I have 1/2 norm(w)^2 + C*summation over all feature vectors(epsilon). If I use quaprog function, I am not sure if I need to have the vector 'f' since I have only one quadratic term in w. But without using 'f' the minimizing expression is not complete.
Could someone please help on how to build the matrices of 'quadprog' function for non-separable svm primal case?
Thanks so much

请先登录，再回答此问题。

回答（1 个）

Matt J
Matt J 2013-3-2
编辑：Matt J 2013-3-2

0 个投票

Just set f=zeros(size(w)), if there is no linear term in your objective function.

5 个评论
显示 3更早的评论 隐藏 3更早的评论

rini
rini 2013-3-2
Thak you so much for the answer, but if I set 'f' to be zero doesn't the problem becomes similar to the linearly separable case? For non-separable cases do we totally neglect this factor?
Thanks.
Matt J
Matt J 2013-3-2
编辑：Matt J 2013-3-2
I have no background in SVM, but based on wiki:SVM Primal Form, you indeed have f=0 and you also have non-trivial linear constraints that you have not mentioned. The constraints render the problem nonseparable, as long as they're not simple bound constraints.
Matt J
Matt J 2013-3-2
编辑：Matt J 2013-3-2
If your constraints are simple bound constraints, the problem will be separable purely by virtue of the quadratic term being norm(w)^2/2 regardless of whether f=0 or not. The linear term is always separable.
Matt J
Matt J 2013-3-11
Accept-clicking my answer is all the thanks I need ;)

请先登录，再进行评论。

类别

在 帮助中心 和 File Exchange 中查找有关 Quadratic Programming and Cone Programming 的更多信息

标签

提问:

rini
rini
2013-3-2

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by