基于Spark的并行二进制蛾焰优化算法特征选择

Hongwe Chen, Heng Fu, Qianqian Cao, Lin Han, Lingyu Yan
{"title":"基于Spark的并行二进制蛾焰优化算法特征选择","authors":"Hongwe Chen, Heng Fu, Qianqian Cao, Lin Han, Lingyu Yan","doi":"10.1109/ITNEC.2019.8729350","DOIUrl":null,"url":null,"abstract":"In view of the good classification ability of Moth-Flame Optimization (MFO) in reducing feature redundancy, this paper applied MFO algorithm to feature selection. However, the MFO algorithm is easy to fall into local optimum and has a weak search ability, which severely limits the classification performance and dimensional reduction ability of the algorithm. Therefore, this paper combined MFO algorithm with distributed parallel computing Spark platform distributed, and proposed a feature selection method based on Spark Parallel Binary Moth-Flame Optimization (SPBMFO) algorithm. The experimental results show that compared with the classical particle swarm optimization algorithm(PSO), the genetic algorithm(GA) and the cuckoo search algorithm(CS), when using the binary MFO algorithm for feature selection, the selected features are improved by 12.5%, 15% and 2.5%, respectively. SPBMFO algorithm avoids the search process falling into local optimum and improve the classification performance of the algorithm, which minimizes the number of features while maximizing the classification performance.","PeriodicalId":202966,"journal":{"name":"2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Feature Selection of Parallel Binary Moth-flame Optimization Algorithm Based on Spark\",\"authors\":\"Hongwe Chen, Heng Fu, Qianqian Cao, Lin Han, Lingyu Yan\",\"doi\":\"10.1109/ITNEC.2019.8729350\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In view of the good classification ability of Moth-Flame Optimization (MFO) in reducing feature redundancy, this paper applied MFO algorithm to feature selection. However, the MFO algorithm is easy to fall into local optimum and has a weak search ability, which severely limits the classification performance and dimensional reduction ability of the algorithm. Therefore, this paper combined MFO algorithm with distributed parallel computing Spark platform distributed, and proposed a feature selection method based on Spark Parallel Binary Moth-Flame Optimization (SPBMFO) algorithm. The experimental results show that compared with the classical particle swarm optimization algorithm(PSO), the genetic algorithm(GA) and the cuckoo search algorithm(CS), when using the binary MFO algorithm for feature selection, the selected features are improved by 12.5%, 15% and 2.5%, respectively. SPBMFO algorithm avoids the search process falling into local optimum and improve the classification performance of the algorithm, which minimizes the number of features while maximizing the classification performance.\",\"PeriodicalId\":202966,\"journal\":{\"name\":\"2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITNEC.2019.8729350\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITNEC.2019.8729350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

鉴于蛾焰优化算法在减少特征冗余方面具有良好的分类能力,本文将其应用于特征选择。然而,该算法容易陷入局部最优,搜索能力较弱,严重限制了算法的分类性能和降维能力。因此,本文将MFO算法与分布式并行计算Spark平台分布式相结合,提出了一种基于Spark并行二进制蛾焰优化(SPBMFO)算法的特征选择方法。实验结果表明,与经典粒子群优化算法(PSO)、遗传算法(GA)和布谷鸟搜索算法(CS)相比,采用二值多目标优化算法进行特征选择时,所选特征分别提高了12.5%、15%和2.5%。SPBMFO算法避免了搜索过程陷入局部最优,提高了算法的分类性能,在最大限度地提高分类性能的同时使特征数量最小化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Feature Selection of Parallel Binary Moth-flame Optimization Algorithm Based on Spark
In view of the good classification ability of Moth-Flame Optimization (MFO) in reducing feature redundancy, this paper applied MFO algorithm to feature selection. However, the MFO algorithm is easy to fall into local optimum and has a weak search ability, which severely limits the classification performance and dimensional reduction ability of the algorithm. Therefore, this paper combined MFO algorithm with distributed parallel computing Spark platform distributed, and proposed a feature selection method based on Spark Parallel Binary Moth-Flame Optimization (SPBMFO) algorithm. The experimental results show that compared with the classical particle swarm optimization algorithm(PSO), the genetic algorithm(GA) and the cuckoo search algorithm(CS), when using the binary MFO algorithm for feature selection, the selected features are improved by 12.5%, 15% and 2.5%, respectively. SPBMFO algorithm avoids the search process falling into local optimum and improve the classification performance of the algorithm, which minimizes the number of features while maximizing the classification performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信