Feature selection in high‐dimensional microarray cancer datasets using an improved equilibrium optimization approach

K. Balakrishnan, R. Dhanalakshmi
{"title":"Feature selection in high‐dimensional microarray cancer datasets using an improved equilibrium optimization approach","authors":"K. Balakrishnan, R. Dhanalakshmi","doi":"10.1002/cpe.7381","DOIUrl":null,"url":null,"abstract":"Optimal feature selection of a high‐dimensional micro‐array datasets has gained a significant importance in medical applications for early detection and prevention of disease. Traditional Optimal feature selection percolates through a population‐based meta‐heuristic optimization technique, a Machine Learning classifier and traditional wrapper method for transforming the original feature set into a better feature set. These techniques require a number of iterations for the convergence of random solutions to the global optimum with high‐dimensionality issues such as over‐fitting, memory constraints, computational costs, and low accuracy. In this article, an efficient equilibrium optimization technique is proposed for an optimized feature selection that increases the diversity of the population in the search space through Random Opposition based learning and classify the best features using a 10‐fold cross‐validation‐based wrapper method. The proposed method is tested with six standard micro‐array datasets and compared with the conventional algorithms such as Marine Predators Algorithm, Harris Hawks Optimization, Whale Optimization Algorithm, and conventional Equilibrium Optimization. From the statistical results using the standard metrics, it is interpreted that the proposed method converges to the global minimum in a few iterations through optimized feature selection, fitness value and higher classification accuracy. This proves its efficacy in exploring and finding a better solution as compared to the counterpart algorithms. In addition to complexity analysis, these results indicate a global optimum solution, an effective representation of least amount of data‐high dimensionality reduction and an avoidance of over‐fitting problems. The source code is available at https://github.com/balasv/ROBL‐EOA/blob/main/ROBL_EOA.ipynb","PeriodicalId":10584,"journal":{"name":"Concurrency and Computation: Practice and Experience","volume":"93 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation: Practice and Experience","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/cpe.7381","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Optimal feature selection of a high‐dimensional micro‐array datasets has gained a significant importance in medical applications for early detection and prevention of disease. Traditional Optimal feature selection percolates through a population‐based meta‐heuristic optimization technique, a Machine Learning classifier and traditional wrapper method for transforming the original feature set into a better feature set. These techniques require a number of iterations for the convergence of random solutions to the global optimum with high‐dimensionality issues such as over‐fitting, memory constraints, computational costs, and low accuracy. In this article, an efficient equilibrium optimization technique is proposed for an optimized feature selection that increases the diversity of the population in the search space through Random Opposition based learning and classify the best features using a 10‐fold cross‐validation‐based wrapper method. The proposed method is tested with six standard micro‐array datasets and compared with the conventional algorithms such as Marine Predators Algorithm, Harris Hawks Optimization, Whale Optimization Algorithm, and conventional Equilibrium Optimization. From the statistical results using the standard metrics, it is interpreted that the proposed method converges to the global minimum in a few iterations through optimized feature selection, fitness value and higher classification accuracy. This proves its efficacy in exploring and finding a better solution as compared to the counterpart algorithms. In addition to complexity analysis, these results indicate a global optimum solution, an effective representation of least amount of data‐high dimensionality reduction and an avoidance of over‐fitting problems. The source code is available at https://github.com/balasv/ROBL‐EOA/blob/main/ROBL_EOA.ipynb
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于改进平衡优化方法的高维微阵列癌症数据集特征选择
高维微阵列数据集的最优特征选择在医学应用中对于疾病的早期检测和预防具有重要意义。传统的最优特征选择是通过基于种群的元启发式优化技术、机器学习分类器和传统的包装方法将原始特征集转换为更好的特征集。这些技术需要大量的迭代来收敛随机解到全局最优的高维问题,如过拟合、内存约束、计算成本和低精度。本文提出了一种有效的均衡优化技术,用于优化特征选择,通过基于随机反对的学习增加搜索空间中种群的多样性,并使用基于10倍交叉验证的包装方法对最佳特征进行分类。该方法在6个标准微阵列数据集上进行了测试,并与传统算法(如海洋掠食者算法、哈里斯鹰优化算法、鲸鱼优化算法和传统均衡优化算法)进行了比较。从使用标准度量的统计结果可以看出,该方法通过优化特征选择、适应度值和更高的分类精度,在几次迭代内收敛到全局最小值。这证明了与同类算法相比,它在探索和寻找更好的解决方案方面的有效性。除了复杂性分析之外,这些结果还表明了一个全局最优解决方案,一个最少量数据的有效表示-高维降维和避免过拟合问题。源代码可从https://github.com/balasv/ROBL‐EOA/blob/main/ROBL_EOA.ipynb获得
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Time‐based DDoS attack detection through hybrid LSTM‐CNN model architectures: An investigation of many‐to‐one and many‐to‐many approaches Distributed low‐latency broadcast scheduling for multi‐channel duty‐cycled wireless IoT networks Open‐domain event schema induction via weighted attentive hypergraph neural network Fused GEMMs towards an efficient GPU implementation of the ADER‐DG method in SeisSol Simulation method for infrared radiation transmission characteristics of typical ship targets based on optical remote sensing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1