Skip to search formSkip to main contentSkip to account menu

Sequential minimal optimization

Known as: SMO 
Sequential minimal optimization (SMO) is an algorithm for solving the quadratic programming (QP) problem that arises during the training of support… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Author identification is a substantial factor in the global economic loss due to computer-related crimes. According to the Center… 
2014
2014
Spider Monkey optimization (SMO) algorithm is newest addition in class of swarm intelligence. SMO is a population based… 
2014
2014
Our objective is to develop formulations and algorithms for efficiently computing the feature selection path - i.e. the variation… 
2011
2011
Computing not the local, but the global optimum of a cluster assignment is one of the important aspects in clustering. Convex… 
2009
2009
Evolutionary Learning Classifier Systems (LCSs) combine reinforcement learning or supervised learning with effective genetics… 
2007
2007
Despite of good theoretic foundations and high classification accuracy of support vector machines (SVM), normal SVM is not… 
Highly Cited
2005
Highly Cited
2005
This essay examines research on social movement organizations (SMOs) within each of the three major schools of social movement… 
2004
2004
Platt's sequential minimal optimization has been widely adopted in modern implementations of support vector machines. This work… 
2003
2003
At present sequential minimal optimization (SMO) algorithm is a quite efficient method for training large-scale support vector… 
Highly Cited
1979
Highly Cited
1979
A condition for single longitudinal mode operation (SMO, for short) of index-guided injection lasers is given theoretically and…