A binary whale optimization algorithm with hyperbolic tangent fitness function for feature selection

A. Hussien, E. H. Houssein, A. Hassanien
{"title":"A binary whale optimization algorithm with hyperbolic tangent fitness function for feature selection","authors":"A. Hussien, E. H. Houssein, A. Hassanien","doi":"10.1109/INTELCIS.2017.8260031","DOIUrl":null,"url":null,"abstract":"To overcome the curse of dimensionality problem, a binary variant of the whale optimization algorithm (bWOA) with V-shaped is proposed. A hyperbolic tangent function is employed as a fitness function for mapping the continuous values to binary ones. Feature selection (FS) has attracted much attention in recent years and played a critical role in dealing with high-dimensional problems and can be modeled as an optimization problem. Eleven datasets from UCI repository from various applications are used. During the experiments, the effectiveness of feature selection is tested via a different type of data and size of features in the generic dataset. Furthermore, Wilcoxons rank-sum nonparametric statistical test was carried out at 5% significance level to judge whether the results of the proposed algorithms differ from those of the other compared algorithms in a statistically significant way. The quantitative and qualitative results revealed that the proposed binary algorithm in the FS domain is capable of minimizing the number of selected features as well as maximizing the classification accuracy within an appropriate time.","PeriodicalId":321315,"journal":{"name":"2017 Eighth International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"87","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Eighth International Conference on Intelligent Computing and Information Systems (ICICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTELCIS.2017.8260031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 87

Abstract

To overcome the curse of dimensionality problem, a binary variant of the whale optimization algorithm (bWOA) with V-shaped is proposed. A hyperbolic tangent function is employed as a fitness function for mapping the continuous values to binary ones. Feature selection (FS) has attracted much attention in recent years and played a critical role in dealing with high-dimensional problems and can be modeled as an optimization problem. Eleven datasets from UCI repository from various applications are used. During the experiments, the effectiveness of feature selection is tested via a different type of data and size of features in the generic dataset. Furthermore, Wilcoxons rank-sum nonparametric statistical test was carried out at 5% significance level to judge whether the results of the proposed algorithms differ from those of the other compared algorithms in a statistically significant way. The quantitative and qualitative results revealed that the proposed binary algorithm in the FS domain is capable of minimizing the number of selected features as well as maximizing the classification accuracy within an appropriate time.
基于双曲正切适应度函数的特征选择二元鲸优化算法
为了克服维数诅咒问题,提出了一种v形鲸优化算法(bWOA)的二元变体。采用双曲正切函数作为适应度函数,将连续值映射为二元值。特征选择(FS)是近年来备受关注的一个问题,它在处理高维问题中起着至关重要的作用,可以建模为一个优化问题。使用了来自不同应用程序的UCI存储库中的11个数据集。在实验中,通过通用数据集中不同类型的数据和不同大小的特征来测试特征选择的有效性。在5%显著性水平下进行Wilcoxons秩和非参数统计检验,判断所提出算法的结果与其他比较算法的结果是否存在统计学显著性差异。定量和定性结果表明,所提出的FS域二值算法能够在适当的时间内使选择的特征数量最小化,并使分类精度最大化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信