{"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}
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.