DocumentCode :
3233557
Title :
The research of SMO algorithm self-adaption improvement on SVM
Author :
Wei, Wang ; HongYu, Duan
Author_Institution :
Dept. of Inf. Eng., Zhengzhou Coll. of Animal Husbandry Eng., Zhengzhou, China
fYear :
2011
fDate :
27-29 May 2011
Firstpage :
693
Lastpage :
696
Abstract :
The SVM (Support Vector Machine) is a kind of important statistical machine learning algorithm. The SMO (Sequential Minimal Optimization) is one of the algorithms on SVM. It is more effective method in practical application. And the SMO algorithm is the solution of support vector machine quadratic programming problem for a series of smaller problems decomposition, thus it realizes serial minimum optimization. The method is used in SMO algorithm of adaptive learning thoughts, and is solving convex quadratic programming optimization problems on the basis on improvement, which has been proposed in this paper. Therefore, based on the idea of adaptive learning algorithm is improved the SMO. The SVM algorithm can adapt to the practical application of more rapid and efficient needs.
Keywords :
convex programming; learning (artificial intelligence); quadratic programming; statistical analysis; support vector machines; SMO algorithm self-adaption improvement; SVM algorithm; adaptive learning; adaptive learning algorithm; convex quadratic programming optimization problem; quadratic programming problem; sequential minimal optimization; serial minimum optimization; statistical machine learning algorithm; support vector machine; Support vector machines; algorithm; machine learning; self-adaption; sequential minimal optimization; support vector machine;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on
Conference_Location :
Xi´an
Print_ISBN :
978-1-61284-485-5
Type :
conf
DOI :
10.1109/ICCSN.2011.6014362
Filename :
6014362
Link To Document :
بازگشت