Sequential minimal optimization: Difference between revisions

Content deleted Content added
No edit summary
infobox; remove "efficient" from lead, as SMO has worst-case cubic runtime, and has been largely abandoned by the large-scale ML community
Line 1:
{{Infobox Algorithm
'''Sequential minimal optimization''' ('''SMO''') is an algorithm for efficiently solving the optimization problem which arises during the training of [[support vector machine]]s. It was invented by [[John Platt (Principal Researcher)|John Platt]] in 1998 at [[Microsoft Research]].<ref>{{Citation
|image=
|class=[[Optimization algorithm]] for training support vector machines
|data=
|time=O(''n''³)
|space=
}}
'''Sequential minimal optimization''' ('''SMO''') is an algorithm for efficiently solving the optimization problem which arises during the training of [[support vector machine]]s. It was invented by [[John Platt (Principal Researcher)|John Platt]] in 1998 at [[Microsoft Research]].<ref>{{Citation
| last = Platt | first = John
| year = 1998