Fitness and historical success information-assisted binary particle swarm optimization for feature selection

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Knowledge-Based Systems Pub Date : 2024-11-10 DOI:10.1016/j.knosys.2024.112699
Shubham Gupta, Saurabh Gupta
{"title":"Fitness and historical success information-assisted binary particle swarm optimization for feature selection","authors":"Shubham Gupta,&nbsp;Saurabh Gupta","doi":"10.1016/j.knosys.2024.112699","DOIUrl":null,"url":null,"abstract":"<div><div>Feature selection is a critical preprocessing step in machine learning aimed at identifying the most relevant features or variables from a dataset. Although conventional particle swarm optimization (PSO) has shown efficiency for feature selection tasks, developing an effective PSO algorithm for this task is still challenging. This study proposes a fitness and historical success information-assisted binary particle swarm optimization, denoted by FPSO. The FPSO is developed by integrating different search strategies, including a weighted center-based approach, historical information-based acceleration coefficients, and selection operation. These strategies are embedded into the FPSO to enhance the levels of exploration and exploitation based on the fitness value of particles and their historical search status. In the FPSO, the transfer function is also added to transform the continuous search space into binary search space. Experimental validation and comparison with seven other metaheuristic algorithms on 24 datasets verify the effectiveness of the FPSO in eliminating irrelevant and redundant features.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"306 ","pages":"Article 112699"},"PeriodicalIF":7.2000,"publicationDate":"2024-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge-Based Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0950705124013339","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Feature selection is a critical preprocessing step in machine learning aimed at identifying the most relevant features or variables from a dataset. Although conventional particle swarm optimization (PSO) has shown efficiency for feature selection tasks, developing an effective PSO algorithm for this task is still challenging. This study proposes a fitness and historical success information-assisted binary particle swarm optimization, denoted by FPSO. The FPSO is developed by integrating different search strategies, including a weighted center-based approach, historical information-based acceleration coefficients, and selection operation. These strategies are embedded into the FPSO to enhance the levels of exploration and exploitation based on the fitness value of particles and their historical search status. In the FPSO, the transfer function is also added to transform the continuous search space into binary search space. Experimental validation and comparison with seven other metaheuristic algorithms on 24 datasets verify the effectiveness of the FPSO in eliminating irrelevant and redundant features.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于特征选择的适合度和历史成功信息辅助二元粒子群优化法
特征选择是机器学习中一个关键的预处理步骤,目的是从数据集中识别出最相关的特征或变量。虽然传统的粒子群优化(PSO)在特征选择任务中表现出了高效性,但为这一任务开发有效的 PSO 算法仍具有挑战性。本研究提出了一种适应度和历史成功信息辅助的二元粒子群优化算法,简称 FPSO。FPSO 融合了不同的搜索策略,包括基于加权中心的方法、基于历史信息的加速系数和选择操作。这些策略被嵌入到 FPSO 中,以根据粒子的适应度值及其历史搜索状态提高探索和利用水平。在 FPSO 中,还加入了转移函数,将连续搜索空间转化为二进制搜索空间。在 24 个数据集上进行的实验验证以及与其他七种元搜索算法的比较验证了 FPSO 在消除无关和冗余特征方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Knowledge-Based Systems
Knowledge-Based Systems 工程技术-计算机:人工智能
CiteScore
14.80
自引率
12.50%
发文量
1245
审稿时长
7.8 months
期刊介绍: Knowledge-Based Systems, an international and interdisciplinary journal in artificial intelligence, publishes original, innovative, and creative research results in the field. It focuses on knowledge-based and other artificial intelligence techniques-based systems. The journal aims to support human prediction and decision-making through data science and computation techniques, provide a balanced coverage of theory and practical study, and encourage the development and implementation of knowledge-based intelligence models, methods, systems, and software tools. Applications in business, government, education, engineering, and healthcare are emphasized.
期刊最新文献
Progressive de-preference task-specific processing for generalizable person re-identification GKA-GPT: Graphical knowledge aggregation for multiturn dialog generation A novel spatio-temporal feature interleaved contrast learning neural network from a robustness perspective PSNet: A non-uniform illumination correction method for underwater images based pseudo-siamese network A novel domain-private-suppress meta-recognition network based universal domain generalization for machinery fault diagnosis
×
引用
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