Sequential minimal optimization
Sequential minimal optimization (SMO) is an algorithm for solving the quadratic programming (QP) problem that arises during the training of support-vector machines (SVM). It was invented by John Platt in 1998 at Microsoft Research. SMO is widely used for training support vector machines and is implemented by the popular LIBSVM tool. The publication of the SMO algorithm in 1998 has generated a lot of excitement in the SVM community, as previously available methods for SVM training were much more complex and required expensive third-party QP solvers.
- Class
- enOptimization algorithm for training support vector machines
- Comment
- enSequential minimal optimization (SMO) is an algorithm for solving the quadratic programming (QP) problem that arises during the training of support-vector machines (SVM). It was invented by John Platt in 1998 at Microsoft Research. SMO is widely used for training support vector machines and is implemented by the popular LIBSVM tool. The publication of the SMO algorithm in 1998 has generated a lot of excitement in the SVM community, as previously available methods for SVM training were much more complex and required expensive third-party QP solvers.
- Has abstract
- enSequential minimal optimization (SMO) is an algorithm for solving the quadratic programming (QP) problem that arises during the training of support-vector machines (SVM). It was invented by John Platt in 1998 at Microsoft Research. SMO is widely used for training support vector machines and is implemented by the popular LIBSVM tool. The publication of the SMO algorithm in 1998 has generated a lot of excitement in the SVM community, as previously available methods for SVM training were much more complex and required expensive third-party QP solvers.
- Hypernym
- Algorithm
- Is primary topic of
- Sequential minimal optimization
- Label
- enSequential minimal optimization
- Link from a Wikipage to another Wikipage
- Bernhard Boser
- Binary classification
- Bregman method
- Category:Optimization algorithms and methods
- Category:Support vector machines
- Dual problem
- E. Osuna
- F. Girosi
- Isabelle Guyon
- John Platt (computer scientist)
- Karush–Kuhn–Tucker conditions
- Kernel function
- Kernel perceptron
- Lagrange multiplier
- LIBSVM
- Microsoft Research
- Optimization algorithm
- Quadratic programming
- R. Freund
- Support vector machine
- Support-vector machine
- Vladimir Vapnik
- SameAs
- 2WUSL
- m.04ybb8n
- Ottimizzazione minima sequenziale
- Q2679145
- Sequential minimal optimization
- Послідовна мінімальна оптимізація
- بهینهسازی متوالی کمینه
- 序列最小优化算法
- 逐次最小問題最適化法
- Subject
- Category:Optimization algorithms and methods
- Category:Support vector machines
- Time
- enO
- WasDerivedFrom
- Sequential minimal optimization?oldid=1068240249&ns=0
- WikiPageLength
- 7147
- Wikipage page ID
- 20154492
- Wikipage revision ID
- 1068240249
- WikiPageUsesTemplate
- Template:Infobox Algorithm
- Template:Main
- Template:Reflist