An improved particle swarm optimization for SVM training

Ying Li, Yan Tong, Bendu Bai, Yanning Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

Since training a SVM requires solving a constrained quadratic programming problem which becomes difficult for very large dataseis, an improved particle swarm optimization algorithm is proposed as an alternative to current numeric SVM training methods. In the improved algorithm, the particles studies not only from itself and the best one but also from the mean value of some other particles. In addition, adaptive mutation was introduced to reduce the rate of premature convergence. The experimental results show that the improved algorithm is feasible and effective for SVM training.

Original languageEnglish
Title of host publicationProceedings - Third International Conference on Natural Computation, ICNC 2007
Pages611-615
Number of pages5
DOIs
StatePublished - 2007
Event3rd International Conference on Natural Computation, ICNC 2007 - Haikou, Hainan, China
Duration: 24 Aug 200727 Aug 2007

Publication series

NameProceedings - Third International Conference on Natural Computation, ICNC 2007
Volume2

Conference

Conference3rd International Conference on Natural Computation, ICNC 2007
Country/TerritoryChina
CityHaikou, Hainan
Period24/08/0727/08/07

Fingerprint

Dive into the research topics of 'An improved particle swarm optimization for SVM training'. Together they form a unique fingerprint.

Cite this