基于Pearson相关系数的肿瘤基因表达特征选择多策略融合二元SHO

IF 5 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Yu-Cai Wang, Hao-Ming Song, Jie-Sheng Wang, Xin-Ru Ma, Yu-Wei Song, Yu-Liang Qi
{"title":"基于Pearson相关系数的肿瘤基因表达特征选择多策略融合二元SHO","authors":"Yu-Cai Wang,&nbsp;Hao-Ming Song,&nbsp;Jie-Sheng Wang,&nbsp;Xin-Ru Ma,&nbsp;Yu-Wei Song,&nbsp;Yu-Liang Qi","doi":"10.1016/j.eij.2025.100639","DOIUrl":null,"url":null,"abstract":"<div><div>Cancer gene expression data is extensively utilized to address the challenges of cancer subtype diagnosis. However, this data is often characterized by high-dimensional, multi-text and multi-classification, which requires an effective feature selection (FS) method. A multi-strategy fusion binary sea-horse optimizer guided by Pearson correlation coefficient was proposed for FS with cancer gene expression data. For the multi-strategy fusion, the rest strategy is introduced in the sea-horse motor behavior stage. Subsequently, a search strategy based on symbiotic organisms of sea horses is designed for the predation stage. Finally, the elementary function dynamic weight strategy is proposed. Multi-strategy fusion enables the sea-horse optimizer (SHO) to perform dynamic exploitation and exploration in the early stage of iteration, expand the search scope initially, and narrow the search scope in the middle and later stages of the algorithm, so as to avoid the algorithm falling into the local optimal and increase the possibility of the algorithm jumping out of the local optimal, and avoid the blind search caused by elite influence. In the FS part, Pearson correlation coefficient guided strategy is proposed firstly to add or delete features. Then eight binary algorithms are derived from S-type and V-type transfer functions. The simulation experiment was divided into four parts. Firstly, the CEC-2022 test functions were used to test the performance of the multi-strategy fusion SHO, from which the best variant TanASSHO was selected, and then compared with other nine swarm intelligent optimization algorithms. Performance tests of various algorithm variants on 18 UCI datasets show that V1PTASSHO is the most effective binary version. Finally, V1PTASSHO was compared with other nine swarm intelligent optimization algorithms on 18 cancer gene expression datasets. The results demonstrate that V1PTASSHO effectively reduces feature subsets, improve classification accuracy and obtain lower fitness value. Friedman test and Wilcoxon rank sum test were used for statistical analysis to verify the effectiveness of the proposed algorithm.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"29 ","pages":"Article 100639"},"PeriodicalIF":5.0000,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-strategy fusion binary SHO guided by Pearson correlation coefficient for feature selection with cancer gene expression data\",\"authors\":\"Yu-Cai Wang,&nbsp;Hao-Ming Song,&nbsp;Jie-Sheng Wang,&nbsp;Xin-Ru Ma,&nbsp;Yu-Wei Song,&nbsp;Yu-Liang Qi\",\"doi\":\"10.1016/j.eij.2025.100639\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Cancer gene expression data is extensively utilized to address the challenges of cancer subtype diagnosis. However, this data is often characterized by high-dimensional, multi-text and multi-classification, which requires an effective feature selection (FS) method. A multi-strategy fusion binary sea-horse optimizer guided by Pearson correlation coefficient was proposed for FS with cancer gene expression data. For the multi-strategy fusion, the rest strategy is introduced in the sea-horse motor behavior stage. Subsequently, a search strategy based on symbiotic organisms of sea horses is designed for the predation stage. Finally, the elementary function dynamic weight strategy is proposed. Multi-strategy fusion enables the sea-horse optimizer (SHO) to perform dynamic exploitation and exploration in the early stage of iteration, expand the search scope initially, and narrow the search scope in the middle and later stages of the algorithm, so as to avoid the algorithm falling into the local optimal and increase the possibility of the algorithm jumping out of the local optimal, and avoid the blind search caused by elite influence. In the FS part, Pearson correlation coefficient guided strategy is proposed firstly to add or delete features. Then eight binary algorithms are derived from S-type and V-type transfer functions. The simulation experiment was divided into four parts. Firstly, the CEC-2022 test functions were used to test the performance of the multi-strategy fusion SHO, from which the best variant TanASSHO was selected, and then compared with other nine swarm intelligent optimization algorithms. Performance tests of various algorithm variants on 18 UCI datasets show that V1PTASSHO is the most effective binary version. Finally, V1PTASSHO was compared with other nine swarm intelligent optimization algorithms on 18 cancer gene expression datasets. The results demonstrate that V1PTASSHO effectively reduces feature subsets, improve classification accuracy and obtain lower fitness value. Friedman test and Wilcoxon rank sum test were used for statistical analysis to verify the effectiveness of the proposed algorithm.</div></div>\",\"PeriodicalId\":56010,\"journal\":{\"name\":\"Egyptian Informatics Journal\",\"volume\":\"29 \",\"pages\":\"Article 100639\"},\"PeriodicalIF\":5.0000,\"publicationDate\":\"2025-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Egyptian Informatics Journal\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1110866525000325\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Egyptian Informatics Journal","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1110866525000325","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

癌症基因表达数据被广泛用于解决癌症亚型诊断的挑战。然而,这些数据往往具有高维、多文本和多分类的特点,这就需要一种有效的特征选择(FS)方法。提出了一种以Pearson相关系数为指导的多策略融合二进制海马优化器。对于多策略融合,在海马运动行为阶段引入休息策略。随后,在捕食阶段设计了基于海马共生生物的搜索策略。最后,提出了初等函数动态权重策略。多策略融合使海马优化器(SHO)在迭代初期进行动态挖掘和探索,初期扩大搜索范围,在算法中后期缩小搜索范围,从而避免算法陷入局部最优,增加算法跳出局部最优的可能性,避免精英影响造成的盲目搜索。在FS部分,首先提出了Pearson相关系数引导策略来增加或删除特征。然后分别从s型和v型传递函数导出了8种二值化算法。仿真实验分为四个部分。首先,利用CEC-2022测试函数对多策略融合SHO算法进行性能测试,从中选出最佳的TanASSHO变体,并与其他9种群体智能优化算法进行比较。在18个UCI数据集上对各种算法变体的性能测试表明,V1PTASSHO是最有效的二进制版本。最后,在18个癌症基因表达数据集上比较了V1PTASSHO算法的其他9种群体智能优化算法。结果表明,V1PTASSHO有效地减少了特征子集,提高了分类精度,获得了较低的适应度值。采用Friedman检验和Wilcoxon秩和检验进行统计分析,验证算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-strategy fusion binary SHO guided by Pearson correlation coefficient for feature selection with cancer gene expression data
Cancer gene expression data is extensively utilized to address the challenges of cancer subtype diagnosis. However, this data is often characterized by high-dimensional, multi-text and multi-classification, which requires an effective feature selection (FS) method. A multi-strategy fusion binary sea-horse optimizer guided by Pearson correlation coefficient was proposed for FS with cancer gene expression data. For the multi-strategy fusion, the rest strategy is introduced in the sea-horse motor behavior stage. Subsequently, a search strategy based on symbiotic organisms of sea horses is designed for the predation stage. Finally, the elementary function dynamic weight strategy is proposed. Multi-strategy fusion enables the sea-horse optimizer (SHO) to perform dynamic exploitation and exploration in the early stage of iteration, expand the search scope initially, and narrow the search scope in the middle and later stages of the algorithm, so as to avoid the algorithm falling into the local optimal and increase the possibility of the algorithm jumping out of the local optimal, and avoid the blind search caused by elite influence. In the FS part, Pearson correlation coefficient guided strategy is proposed firstly to add or delete features. Then eight binary algorithms are derived from S-type and V-type transfer functions. The simulation experiment was divided into four parts. Firstly, the CEC-2022 test functions were used to test the performance of the multi-strategy fusion SHO, from which the best variant TanASSHO was selected, and then compared with other nine swarm intelligent optimization algorithms. Performance tests of various algorithm variants on 18 UCI datasets show that V1PTASSHO is the most effective binary version. Finally, V1PTASSHO was compared with other nine swarm intelligent optimization algorithms on 18 cancer gene expression datasets. The results demonstrate that V1PTASSHO effectively reduces feature subsets, improve classification accuracy and obtain lower fitness value. Friedman test and Wilcoxon rank sum test were used for statistical analysis to verify the effectiveness of the proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Egyptian Informatics Journal
Egyptian Informatics Journal Decision Sciences-Management Science and Operations Research
CiteScore
11.10
自引率
1.90%
发文量
59
审稿时长
110 days
期刊介绍: The Egyptian Informatics Journal is published by the Faculty of Computers and Artificial Intelligence, Cairo University. This Journal provides a forum for the state-of-the-art research and development in the fields of computing, including computer sciences, information technologies, information systems, operations research and decision support. Innovative and not-previously-published work in subjects covered by the Journal is encouraged to be submitted, whether from academic, research or commercial sources.
×
引用
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学术官方微信