Research on Parameters Optimization of SVM Based on Improved Fruit Fly Optimization Algorithm

Qiantu Zhang, Liqing Fang, Leilei Ma, Yulong Zhao
{"title":"Research on Parameters Optimization of SVM Based on Improved Fruit Fly Optimization Algorithm","authors":"Qiantu Zhang, Liqing Fang, Leilei Ma, Yulong Zhao","doi":"10.7763/IJCTE.2016.V8.1096","DOIUrl":null,"url":null,"abstract":"—The performance of the support vector machine (SVM) is determined to a great extent by the parameter selection. In order to improve the learning and generalization ability of SVM, in this paper, an improved fruit fly optimization algorithm (IFOA) was proposed to optimize kernel parameter and penalty factor of SVM. In IFOA, the fruit fly group is dynamically divided into advanced subgroup and drawback subgroup according to its own evolutionary level. A global search is made for the drawback subgroup under the guidance of the best individual and a finely local search is made for the advanced subgroup in which the fruit flies do Levy flight around the best individual. Two subgroups exchange information by updating the overall optimum and recombining the subgroups. Getting rid of local optimum and improve search ability are ensured by making those changes in basic FOA. The performance of the IFOA and classification accuracy of optimized SVM based on IFOA are respectively examined through several typical benchmark functions and classical data sets from UCI benchmark. The experiment results show that the performance of the new algorithm is obviously more successful than FOA and it is also an effective SVM parameter optimization method which has better performance than some other methods.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Theory and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7763/IJCTE.2016.V8.1096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

—The performance of the support vector machine (SVM) is determined to a great extent by the parameter selection. In order to improve the learning and generalization ability of SVM, in this paper, an improved fruit fly optimization algorithm (IFOA) was proposed to optimize kernel parameter and penalty factor of SVM. In IFOA, the fruit fly group is dynamically divided into advanced subgroup and drawback subgroup according to its own evolutionary level. A global search is made for the drawback subgroup under the guidance of the best individual and a finely local search is made for the advanced subgroup in which the fruit flies do Levy flight around the best individual. Two subgroups exchange information by updating the overall optimum and recombining the subgroups. Getting rid of local optimum and improve search ability are ensured by making those changes in basic FOA. The performance of the IFOA and classification accuracy of optimized SVM based on IFOA are respectively examined through several typical benchmark functions and classical data sets from UCI benchmark. The experiment results show that the performance of the new algorithm is obviously more successful than FOA and it is also an effective SVM parameter optimization method which has better performance than some other methods.
基于改进果蝇优化算法的SVM参数优化研究
支持向量机(SVM)的性能在很大程度上取决于参数的选择。为了提高支持向量机的学习和泛化能力,本文提出了一种改进的果蝇优化算法(IFOA)来优化支持向量机的核参数和惩罚因子。在IFOA中,果蝇群体根据自身的进化水平动态划分为高级亚群和落后亚群。在最优个体的指导下对缺陷子群进行全局搜索,对先进子群进行精细局部搜索,果蝇在先进子群中围绕最优个体进行Levy飞行。两个子组通过更新总体最优和重新组合子组来交换信息。通过对基本FOA进行修改,保证了摆脱局部最优,提高了搜索能力。通过几个典型的基准函数和UCI基准的经典数据集,分别检验了IFOA的性能和基于IFOA的优化支持向量机的分类精度。实验结果表明,新算法的性能明显优于FOA,是一种有效的支持向量机参数优化方法,性能优于其他方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信