Sequential minimal optimization: Difference between revisions

Revision as of 21:45, 8 November 2010

Revision as of 18:19, 14 November 2010

Line 12:

| title = Everything Old is New Again: a Fresh Look at Historical Approaches in Machine Learning

| journal = Ph.D. thesis

| pages = p.18

}}</ref>

Line 31:

== Algorithm ==

{{Expand section-stub|date=November 2010}}

SMO breaks up large QP problems into a series of smallest possible QP problems, which are then solved analytically.

Line 40:

* [http://www.csie.ntu.edu.tw/~cjlin/libsvm/ LIBSVM]

{{Optimization algorithms}}

{{DEFAULTSORT:Sequential Minimal Optimization}}

[[Category:Optimization algorithms]]

[[Category:Machine learning]]

{{statistics-stub}}

{{Optimization algorithms}}