A Modified Particle Swarm Optimization Algorithm for Support Vector Machine Training

Hejin Yuan, Yanning Zhang, Dengfu Zhang, Gen Yang
{"title":"A Modified Particle Swarm Optimization Algorithm for Support Vector Machine Training","authors":"Hejin Yuan, Yanning Zhang, Dengfu Zhang, Gen Yang","doi":"10.1109/WCICA.2006.1713151","DOIUrl":null,"url":null,"abstract":"A new modified particle swarm optimization algorithm for linear equation constrained optimization problem was put forward. And the method using this algorithm to train support vector machine was given. In the new algorithm, the particle studies not only from itself and the best one but also from other particles in the population with certain probability. This strengthened learning behavior can make the particle to search the whole solution space better. In addition, the mutation for the particle is considered in the new algorithm. The mutation operation is executed when the particle swarm becomes stagnated, which is decided by calculating the population diversity with the formula presented in this paper. For the specific constraints of support vector machine, a new method to initialize the particles in the feasible solution space was provided. The experiments on synthetic and sonar dataset classification show that our algorithm is feasible and robust for support vector machine training","PeriodicalId":375135,"journal":{"name":"2006 6th World Congress on Intelligent Control and Automation","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 6th World Congress on Intelligent Control and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCICA.2006.1713151","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

A new modified particle swarm optimization algorithm for linear equation constrained optimization problem was put forward. And the method using this algorithm to train support vector machine was given. In the new algorithm, the particle studies not only from itself and the best one but also from other particles in the population with certain probability. This strengthened learning behavior can make the particle to search the whole solution space better. In addition, the mutation for the particle is considered in the new algorithm. The mutation operation is executed when the particle swarm becomes stagnated, which is decided by calculating the population diversity with the formula presented in this paper. For the specific constraints of support vector machine, a new method to initialize the particles in the feasible solution space was provided. The experiments on synthetic and sonar dataset classification show that our algorithm is feasible and robust for support vector machine training
一种改进的支持向量机训练粒子群算法
针对线性方程约束优化问题,提出了一种改进的粒子群优化算法。并给出了用该算法训练支持向量机的方法。在新算法中,粒子不仅从自身和最优的粒子中学习,而且以一定的概率从种群中的其他粒子中学习。这种强化的学习行为可以使粒子更好地搜索整个解空间。此外,新算法还考虑了粒子的突变。在粒子群处于停滞状态时执行突变操作,这是通过计算粒子群的种群多样性来确定的。针对支持向量机的特定约束条件,提出了在可行解空间中初始化粒子的新方法。合成和声纳数据集分类实验表明,该算法对支持向量机训练具有可行性和鲁棒性
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信