Sequential minimal optimization: Difference between revisions

Revision as of 05:03, 14 March 2011

Revision as of 05:54, 14 March 2011

Line 1:

''''''Bold text'''''''''Bold text'''''''''Bold text'''''''''Bold text'''''''''BoįįįĔéวษหอะฐฒฒสd text'''''''''Bold text'''''''''Bold text'''''''''Bold text'''''''''Bold text'''''''Italic text''''''Italic text''''''Italic text''''''Italic text''''''Italic text''á''''''''''''''''''''''''''''''''''''''''Sequential minimal optimization''' ('''SMO''') is an algorithm for solving the optimization problem which arises during the training of [[support vector machine]]s. It was invented by [[John Platt]] in 1998 at [[Microsoft Research]].<ref>{{Citation

| last = Platt | first = John

| year = 1998