| 查看: 825 | 回复: 1 | ||
tuburfransth金虫 (正式写手)
|
[求助]
关于支持向量机的SMO算法伪代码中有一些问题请教大家 已有1人参与
|
|
CODE: target = desired output vector point = training point matrix procedure takeStep(i1,i2) if (i1 == i2) return 0 alph1 = Lagrange multiplier for i1 y1 = target[i1] E1 = SVM output on point[i1] – y1 (check in error cache) s = y1*y2 Compute L, H via equations (13) and (14) if (L == H) return 0 k11 = kernel(point[i1],point[i1]) k12 = kernel(point[i1],point[i2]) k22 = kernel(point[i2],point[i2]) eta = k11+k22-2*k12 if (eta > 0) { a2 = alph2 + y2*(E1-E2)/eta if (a2 < L) a2 = L else if (a2 > H) a2 = H } else { Lobj = objective function at a2=L Hobj = objective function at a2=H if (Lobj < Hobj-eps) a2 = L else if (Lobj > Hobj+eps) a2 = H else a2 = alph2 } if (|a2-alph2| < eps*(a2+alph2+eps)) return 0 a1 = alph1+s*(alph2-a2) Update threshold to reflect change in Lagrange multipliers Update weight vector to reflect change in a1 & a2, if SVM is linear Update error cache using new Lagrange multipliers Store a1 in the alpha array Store a2 in the alpha array return 1 endprocedure procedure examineExample(i2) y2 = target[i2] alph2 = Lagrange multiplier for i2 E2 = SVM output on point[i2] – y2 (check in error cache) r2 = E2*y2 if ((r2 < -tol && alph2 < C) || (r2 > tol && alph2 > 0)) { if (number of non-zero & non-C alpha > 1) { i1 = result of second choice heuristic (section 2.2) if takeStep(i1,i2) return 1 } loop over all non-zero and non-C alpha, starting at a random point { i1 = identity of current alpha if takeStep(i1,i2) return 1 } loop over all possible i1, starting at a random point { i1 = loop variable if (takeStep(i1,i2) return 1 } } return 0 endprocedure main routine: numChanged = 0; examineAll = 1; while (numChanged > 0 | examineAll) { numChanged = 0; if (examineAll) loop I over all training examples numChanged += examineExample(I) else loop I over examples where alpha is not 0 & not C numChanged += examineExample(I) if (examineAll == 1) examineAll = 0 else if (numChanged == 0) examineAll = 1 } 代码见上方，我想请教代码中的return 0和return 1执行后有什么结果？还有E1 = SVM output on point[i1] – y1 (check in error cache)这行代码怎么理解？ |
回复此楼» 猜你喜欢
应该是93bebmhtak前后十一个字符比较关键
已经有25人回复
-
小木虫上这么多卖论文的，真有人买论文么？感觉没必要啊
已经有8人回复
-
分享一下我之前已中青C的计划书的filecode
已经有4人回复
-
职称评审，求友友推荐见刊最快的期刊
已经有3人回复
-
为什么网上很多人说本周 12号出结果
已经有6人回复
-
听说今天filecode变了
已经有49人回复
-
帮忙看看fileCode
已经有12人回复
-
FileCode能看出啥？
已经有17人回复
-
奇怪，两个人的filecode固定段从头到尾一模一样
已经有6人回复
-
filecode
已经有9人回复
2楼2015-09-02 13:07:10
