Enhanced Gradient-Based Optimizer Algorithm With Multi-Strategy for Feature Selection

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Tianbao Liu, Yang Li, Xiwen Qin
{"title":"Enhanced Gradient-Based Optimizer Algorithm With Multi-Strategy for Feature Selection","authors":"Tianbao Liu,&nbsp;Yang Li,&nbsp;Xiwen Qin","doi":"10.1002/cpe.70034","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Feature selection is an effective tool for processing data. It is employed to eliminate redundant or irrelevant features and select optimal feature subsets to improve the performance of learning models. The gradient-based optimizer (GBO) received extensive attention in solving different optimization problems, which have the gradient search rule (GSR) and the local escaping operation (LEO). However, when addressing complex optimization and feature selection problems, GBO exhibits deficiencies in balancing global exploration and exploitation, and tends to converge to local optima. This article presents a modified version of GBO, named FWZGBO, for solving feature selection problems. Firstly, inspired by the iterative method and its theory, we propose an enhanced strategy for significantly accelerating the search capability in GSR. This strategy utilizes an optimal fourth-order iterative method to perform the corresponding function of the second-order Newton's method. Secondly, we suggest an enhanced refraction learning approach with Gaussian distribution to help the algorithm escape from local optima and enhance population diversity. Thirdly, this work devises a new adaptive weight based on the cosine strategy in both GSR and LEO to attain a harmonious balance between exploration and exploitation. To validate the performance of the FWZGBO algorithm, 28 benchmark functions and 20 well-known datasets are tested and compared with 14 optimization algorithms. The experimental results show that FWZGBO is significantly superior in solving global optimization and feature selection problems. Meanwhile, the effectiveness of the FWZGBO algorithm is validated using the Friedman test with the corresponding post-hoc test.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 6-8","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70034","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Feature selection is an effective tool for processing data. It is employed to eliminate redundant or irrelevant features and select optimal feature subsets to improve the performance of learning models. The gradient-based optimizer (GBO) received extensive attention in solving different optimization problems, which have the gradient search rule (GSR) and the local escaping operation (LEO). However, when addressing complex optimization and feature selection problems, GBO exhibits deficiencies in balancing global exploration and exploitation, and tends to converge to local optima. This article presents a modified version of GBO, named FWZGBO, for solving feature selection problems. Firstly, inspired by the iterative method and its theory, we propose an enhanced strategy for significantly accelerating the search capability in GSR. This strategy utilizes an optimal fourth-order iterative method to perform the corresponding function of the second-order Newton's method. Secondly, we suggest an enhanced refraction learning approach with Gaussian distribution to help the algorithm escape from local optima and enhance population diversity. Thirdly, this work devises a new adaptive weight based on the cosine strategy in both GSR and LEO to attain a harmonious balance between exploration and exploitation. To validate the performance of the FWZGBO algorithm, 28 benchmark functions and 20 well-known datasets are tested and compared with 14 optimization algorithms. The experimental results show that FWZGBO is significantly superior in solving global optimization and feature selection problems. Meanwhile, the effectiveness of the FWZGBO algorithm is validated using the Friedman test with the corresponding post-hoc test.

求助全文
约1分钟内获得全文 求助全文
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
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学术官方微信