A novel cooperative co-evolutionary algorithm with context vector enhancement strategy for feature selection on high-dimensional classification

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Zhaoyang Zhang, Jianwu Xue
{"title":"A novel cooperative co-evolutionary algorithm with context vector enhancement strategy for feature selection on high-dimensional classification","authors":"Zhaoyang Zhang,&nbsp;Jianwu Xue","doi":"10.1016/j.cor.2025.107009","DOIUrl":null,"url":null,"abstract":"<div><div>Feature selection (FS) in high-dimensional classification is challenging due to the exponential increase in the number of possible feature subsets and the increased risk of model overfitting. Focusing on this challenge, the cooperative co-evolutionary algorithm (CCEA), which adopts a divide-and-conquer strategy, has been successfully applied to FS. However, existing CCEA based FS methods risk getting trapped in pseudo-optimum. To address this issue, we propose a novel CCEA based FS method, which can manipulate the context vector to escape pseudo-optimum. Specifically, competitive swarm optimizer (CSO), a variant of particle swarm optimization (PSO), is extended into CCEA based CSO due to its high performance in high-dimensional problems. This forms the foundation of the proposed method. Subsequently, a non-parametric space division strategy is proposed, which enables the proposed method to adaptively handle both low-dimensional and high-dimensional data. Most importantly, a context vector enhancement strategy is proposed, which performs search across all subspaces of the context vector, enabling proposed method to escape pseudo-optimum. Following this, a subpopulation enhancement strategy is proposed, which generates new individuals according to the search results of context vector enhancement strategy to replace individuals with poor fitness, accelerating the evolution of subpopulations. We compare the proposed method with a few state-of-the-art FS methods on 18 datasets with up to 12600 features. Experimental results show that, in most cases, the proposed method is able to find a smaller feature subset with higher classification accuracy.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"178 ","pages":"Article 107009"},"PeriodicalIF":4.1000,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825000371","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Feature selection (FS) in high-dimensional classification is challenging due to the exponential increase in the number of possible feature subsets and the increased risk of model overfitting. Focusing on this challenge, the cooperative co-evolutionary algorithm (CCEA), which adopts a divide-and-conquer strategy, has been successfully applied to FS. However, existing CCEA based FS methods risk getting trapped in pseudo-optimum. To address this issue, we propose a novel CCEA based FS method, which can manipulate the context vector to escape pseudo-optimum. Specifically, competitive swarm optimizer (CSO), a variant of particle swarm optimization (PSO), is extended into CCEA based CSO due to its high performance in high-dimensional problems. This forms the foundation of the proposed method. Subsequently, a non-parametric space division strategy is proposed, which enables the proposed method to adaptively handle both low-dimensional and high-dimensional data. Most importantly, a context vector enhancement strategy is proposed, which performs search across all subspaces of the context vector, enabling proposed method to escape pseudo-optimum. Following this, a subpopulation enhancement strategy is proposed, which generates new individuals according to the search results of context vector enhancement strategy to replace individuals with poor fitness, accelerating the evolution of subpopulations. We compare the proposed method with a few state-of-the-art FS methods on 18 datasets with up to 12600 features. Experimental results show that, in most cases, the proposed method is able to find a smaller feature subset with higher classification accuracy.
基于上下文向量增强策略的高维分类特征选择协同进化算法
由于可能的特征子集数量呈指数增长,模型过拟合的风险增加,高维分类中的特征选择(FS)具有挑战性。针对这一挑战,采用分而治之策略的合作协同进化算法(CCEA)已成功应用于FS。然而,现有的基于CCEA的FS方法存在陷入伪最优的风险。为了解决这个问题,我们提出了一种新的基于CCEA的FS方法,该方法可以操纵上下文向量来逃避伪最优。其中,竞争群优化算法(CSO)作为粒子群优化算法(PSO)的一种变体,由于其在高维问题上的优异性能,被扩展为基于CCEA的竞争群优化算法。这构成了所提出方法的基础。随后,提出了一种非参数空间分割策略,使该方法能够自适应处理低维和高维数据。最重要的是,提出了一种上下文向量增强策略,该策略在上下文向量的所有子空间上执行搜索,使所提方法避免了伪最优。在此基础上,提出了一种亚种群增强策略,根据上下文向量增强策略的搜索结果生成新个体,替换适应度较差的个体,加速亚种群的进化。我们将所提出的方法与一些最先进的FS方法在18个数据集上进行了比较,这些数据集具有多达12600个特征。实验结果表明,在大多数情况下,该方法能够找到更小的特征子集,分类精度更高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
×
引用
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学术官方微信