基于帕金森二元排球超级联赛元搜索算法的特征选择竞争算法

IF 1.2 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Edjola K. Naka
{"title":"基于帕金森二元排球超级联赛元搜索算法的特征选择竞争算法","authors":"Edjola K. Naka","doi":"10.2478/cait-2023-0038","DOIUrl":null,"url":null,"abstract":"Abstract A novel proposed Binary Volleyball Premier League algorithm (BVPL) has shown some promising results in a Parkinson’s Disease (PD) dataset related to fitness and accuracy [1]. This paper evaluates and provides an overview of the efficiency of BVPL in feature selection compared to various metaheuristic optimization algorithms and PD datasets. Moreover, an improved variant of BVPL is proposed that integrates the opposite-based solution to enlarge search domains and increase the possibility of getting rid of the local optima. The performance of BVPL is validated using the accuracy of the k-Nearest Neighbor Algorithm. The superiority of BVPL over the competing algorithms for each dataset is measured using statistical tests. The conclusive results indicate that the BVPL exhibits significant competitiveness compared to most metaheuristic algorithms, thereby establishing its potential for accurate prediction of PD. Overall, BVPL shows high potential to be employed in feature selection.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Competitive Parkinson-Based Binary Volleyball Premier League Metaheuristic Algorithm for Feature Selection\",\"authors\":\"Edjola K. Naka\",\"doi\":\"10.2478/cait-2023-0038\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract A novel proposed Binary Volleyball Premier League algorithm (BVPL) has shown some promising results in a Parkinson’s Disease (PD) dataset related to fitness and accuracy [1]. This paper evaluates and provides an overview of the efficiency of BVPL in feature selection compared to various metaheuristic optimization algorithms and PD datasets. Moreover, an improved variant of BVPL is proposed that integrates the opposite-based solution to enlarge search domains and increase the possibility of getting rid of the local optima. The performance of BVPL is validated using the accuracy of the k-Nearest Neighbor Algorithm. The superiority of BVPL over the competing algorithms for each dataset is measured using statistical tests. The conclusive results indicate that the BVPL exhibits significant competitiveness compared to most metaheuristic algorithms, thereby establishing its potential for accurate prediction of PD. Overall, BVPL shows high potential to be employed in feature selection.\",\"PeriodicalId\":45562,\"journal\":{\"name\":\"Cybernetics and Information Technologies\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2023-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cybernetics and Information Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/cait-2023-0038\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cybernetics and Information Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/cait-2023-0038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

摘要 一种新提出的二进制排球超级联赛算法(BVPL)在帕金森病(PD)数据集的适配性和准确性方面取得了一些有希望的结果[1]。本文评估并概述了 BVPL 在特征选择方面与各种元启发式优化算法和帕金森病数据集相比的效率。此外,本文还提出了 BVPL 的改进变体,该变体集成了基于相反方向的解决方案,从而扩大了搜索域,增加了摆脱局部最优的可能性。BVPL 的性能通过 k 近邻算法的准确性得到了验证。在每个数据集上,BVPL 相对于竞争算法的优越性都是通过统计检验来衡量的。最终结果表明,与大多数元启发式算法相比,BVPL 表现出了明显的竞争力,从而确立了其准确预测 PD 的潜力。总体而言,BVPL 在特征选择中显示出了巨大的应用潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Competitive Parkinson-Based Binary Volleyball Premier League Metaheuristic Algorithm for Feature Selection
Abstract A novel proposed Binary Volleyball Premier League algorithm (BVPL) has shown some promising results in a Parkinson’s Disease (PD) dataset related to fitness and accuracy [1]. This paper evaluates and provides an overview of the efficiency of BVPL in feature selection compared to various metaheuristic optimization algorithms and PD datasets. Moreover, an improved variant of BVPL is proposed that integrates the opposite-based solution to enlarge search domains and increase the possibility of getting rid of the local optima. The performance of BVPL is validated using the accuracy of the k-Nearest Neighbor Algorithm. The superiority of BVPL over the competing algorithms for each dataset is measured using statistical tests. The conclusive results indicate that the BVPL exhibits significant competitiveness compared to most metaheuristic algorithms, thereby establishing its potential for accurate prediction of PD. Overall, BVPL shows high potential to be employed in feature selection.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Cybernetics and Information Technologies
Cybernetics and Information Technologies COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
3.20
自引率
25.00%
发文量
35
审稿时长
12 weeks
×
引用
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学术官方微信