基于进化q学习的特征选择优化算法

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS
Guan Yang, Zhiyong Zeng, Xinrui Pu, Ren Duan
{"title":"基于进化q学习的特征选择优化算法","authors":"Guan Yang,&nbsp;Zhiyong Zeng,&nbsp;Xinrui Pu,&nbsp;Ren Duan","doi":"10.1016/j.ins.2025.122441","DOIUrl":null,"url":null,"abstract":"<div><div>Classification problems are an important research area in the field of data mining and machine learning. To enhance classification accuracy and optimize the effectiveness of learning algorithms, feature selection, as a data preprocessing operation, deserves ongoing attention. Based on reinforcement learning and particle swarm optimization, this paper proposes an evolutionary Q-learning feature selection optimization algorithm (EQL-FS). It leverages the advantages of reinforcement learning and combines them with the global exploration capability of the particle swarm optimization algorithm to achieve the optimal strategy. The multiagent approach is adopted, and the interaction is achieved through particle swarm optimization. The effectiveness of the proposed algorithm has been validated using sixteen public datasets. The experimental results indicate that this new algorithm can select the shortest feature subset without compromising accuracy. Additionally, it demonstrates a robust ability to eliminate noise and redundant features. Furthermore, the algorithm has been applied to analyze the broadband customer base churn for a communication operator, and the results are consistent with those obtained from the public datasets. Finally, the statistical test comparing different algorithms has been completed, and the results indicate that the new algorithm EQL-FS demonstrates statistical significance in terms of accuracy and the number of selected features.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"719 ","pages":"Article 122441"},"PeriodicalIF":8.1000,"publicationDate":"2025-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Feature selection optimization algorithm based on evolutionary Q-learning\",\"authors\":\"Guan Yang,&nbsp;Zhiyong Zeng,&nbsp;Xinrui Pu,&nbsp;Ren Duan\",\"doi\":\"10.1016/j.ins.2025.122441\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Classification problems are an important research area in the field of data mining and machine learning. To enhance classification accuracy and optimize the effectiveness of learning algorithms, feature selection, as a data preprocessing operation, deserves ongoing attention. Based on reinforcement learning and particle swarm optimization, this paper proposes an evolutionary Q-learning feature selection optimization algorithm (EQL-FS). It leverages the advantages of reinforcement learning and combines them with the global exploration capability of the particle swarm optimization algorithm to achieve the optimal strategy. The multiagent approach is adopted, and the interaction is achieved through particle swarm optimization. The effectiveness of the proposed algorithm has been validated using sixteen public datasets. The experimental results indicate that this new algorithm can select the shortest feature subset without compromising accuracy. Additionally, it demonstrates a robust ability to eliminate noise and redundant features. Furthermore, the algorithm has been applied to analyze the broadband customer base churn for a communication operator, and the results are consistent with those obtained from the public datasets. Finally, the statistical test comparing different algorithms has been completed, and the results indicate that the new algorithm EQL-FS demonstrates statistical significance in terms of accuracy and the number of selected features.</div></div>\",\"PeriodicalId\":51063,\"journal\":{\"name\":\"Information Sciences\",\"volume\":\"719 \",\"pages\":\"Article 122441\"},\"PeriodicalIF\":8.1000,\"publicationDate\":\"2025-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020025525005730\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525005730","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

分类问题是数据挖掘和机器学习领域的一个重要研究领域。为了提高分类精度和优化学习算法的有效性,特征选择作为一种数据预处理操作值得持续关注。基于强化学习和粒子群优化,提出了一种进化q学习特征选择优化算法(EQL-FS)。它利用强化学习的优点,结合粒子群优化算法的全局探索能力来实现最优策略。采用多智能体方法,通过粒子群优化实现交互。利用16个公共数据集验证了该算法的有效性。实验结果表明,该算法可以在不影响准确率的前提下选择最短的特征子集。此外,它还显示了消除噪声和冗余特征的强大能力。将该算法应用于某通信运营商的宽带客户群流失分析,结果与公共数据集的分析结果一致。最后,完成了不同算法的对比统计检验,结果表明,新算法EQL-FS在准确率和选择特征数量上都具有统计学意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Feature selection optimization algorithm based on evolutionary Q-learning
Classification problems are an important research area in the field of data mining and machine learning. To enhance classification accuracy and optimize the effectiveness of learning algorithms, feature selection, as a data preprocessing operation, deserves ongoing attention. Based on reinforcement learning and particle swarm optimization, this paper proposes an evolutionary Q-learning feature selection optimization algorithm (EQL-FS). It leverages the advantages of reinforcement learning and combines them with the global exploration capability of the particle swarm optimization algorithm to achieve the optimal strategy. The multiagent approach is adopted, and the interaction is achieved through particle swarm optimization. The effectiveness of the proposed algorithm has been validated using sixteen public datasets. The experimental results indicate that this new algorithm can select the shortest feature subset without compromising accuracy. Additionally, it demonstrates a robust ability to eliminate noise and redundant features. Furthermore, the algorithm has been applied to analyze the broadband customer base churn for a communication operator, and the results are consistent with those obtained from the public datasets. Finally, the statistical test comparing different algorithms has been completed, and the results indicate that the new algorithm EQL-FS demonstrates statistical significance in terms of accuracy and the number of selected features.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
×
引用
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学术官方微信