Dynamic Candidate Solution Boosted Beluga Whale Optimization Algorithm for Biomedical Classification
In many fields, complicated issues can now be solved with the help of Artificial Intelligence (AI) and Machine Learning (ML). One of the more modern Metaheuristic (MH) algorithms used to tackle numerous issues in various fields is the Beluga Whale Optimization (BWO) method. However, BWO has a lack o...
Published in: | Mathematics |
---|---|
Main Authors: | , |
Format: | Article in Journal/Newspaper |
Language: | English |
Published: |
MDPI AG
2023
|
Subjects: | |
Online Access: | https://doi.org/10.3390/math11030707 https://doaj.org/article/ad58842b454546cb905a946ae80964d6 |
id |
ftdoajarticles:oai:doaj.org/article:ad58842b454546cb905a946ae80964d6 |
---|---|
record_format |
openpolar |
spelling |
ftdoajarticles:oai:doaj.org/article:ad58842b454546cb905a946ae80964d6 2023-05-15T15:41:44+02:00 Dynamic Candidate Solution Boosted Beluga Whale Optimization Algorithm for Biomedical Classification Essam H. Houssein Awny Sayed 2023-01-01T00:00:00Z https://doi.org/10.3390/math11030707 https://doaj.org/article/ad58842b454546cb905a946ae80964d6 EN eng MDPI AG https://www.mdpi.com/2227-7390/11/3/707 https://doaj.org/toc/2227-7390 doi:10.3390/math11030707 2227-7390 https://doaj.org/article/ad58842b454546cb905a946ae80964d6 Mathematics, Vol 11, Iss 707, p 707 (2023) Artificial Intelligence (AI) Beluga Whale Optimization (BWO) Dynamic Candidate Solution (DCS) Opposition-Based Learning (OBL) k-Nearest Neighbor (kNN) Mathematics QA1-939 article 2023 ftdoajarticles https://doi.org/10.3390/math11030707 2023-02-12T01:26:08Z In many fields, complicated issues can now be solved with the help of Artificial Intelligence (AI) and Machine Learning (ML). One of the more modern Metaheuristic (MH) algorithms used to tackle numerous issues in various fields is the Beluga Whale Optimization (BWO) method. However, BWO has a lack of diversity, which could lead to being trapped in local optimaand premature convergence. This study presents two stages for enhancing the fundamental BWO algorithm. The initial stage of BWO’s Opposition-Based Learning (OBL), also known as OBWO, helps to expedite the search process and enhance the learning methodology to choose a better generation of candidate solutions for the fundamental BWO. The second step, referred to as OBWOD, combines the Dynamic Candidate Solution (DCS) and OBWO based on the k-Nearest Neighbor (kNN) classifier to boost variety and improve the consistency of the selected solution by giving potential candidates a chance to solve the given problem with a high fitness value. A comparison study with present optimization algorithms for single-objective bound-constraint optimization problems was conducted to evaluate the performance of the OBWOD algorithm on issues from the 2022 IEEE Congress on Evolutionary Computation (CEC’22) benchmark test suite with a range of dimension sizes. The results of the statistical significance test confirmed that the proposed algorithm is competitive with the optimization algorithms. In addition, the OBWOD algorithm surpassed the performance of seven other algorithms with an overall classification accuracy of 85.17% for classifying 10 medical datasets with different dimension sizes according to the performance evaluation matrix. Article in Journal/Newspaper Beluga Beluga whale Beluga* Directory of Open Access Journals: DOAJ Articles Mathematics 11 3 707 |
institution |
Open Polar |
collection |
Directory of Open Access Journals: DOAJ Articles |
op_collection_id |
ftdoajarticles |
language |
English |
topic |
Artificial Intelligence (AI) Beluga Whale Optimization (BWO) Dynamic Candidate Solution (DCS) Opposition-Based Learning (OBL) k-Nearest Neighbor (kNN) Mathematics QA1-939 |
spellingShingle |
Artificial Intelligence (AI) Beluga Whale Optimization (BWO) Dynamic Candidate Solution (DCS) Opposition-Based Learning (OBL) k-Nearest Neighbor (kNN) Mathematics QA1-939 Essam H. Houssein Awny Sayed Dynamic Candidate Solution Boosted Beluga Whale Optimization Algorithm for Biomedical Classification |
topic_facet |
Artificial Intelligence (AI) Beluga Whale Optimization (BWO) Dynamic Candidate Solution (DCS) Opposition-Based Learning (OBL) k-Nearest Neighbor (kNN) Mathematics QA1-939 |
description |
In many fields, complicated issues can now be solved with the help of Artificial Intelligence (AI) and Machine Learning (ML). One of the more modern Metaheuristic (MH) algorithms used to tackle numerous issues in various fields is the Beluga Whale Optimization (BWO) method. However, BWO has a lack of diversity, which could lead to being trapped in local optimaand premature convergence. This study presents two stages for enhancing the fundamental BWO algorithm. The initial stage of BWO’s Opposition-Based Learning (OBL), also known as OBWO, helps to expedite the search process and enhance the learning methodology to choose a better generation of candidate solutions for the fundamental BWO. The second step, referred to as OBWOD, combines the Dynamic Candidate Solution (DCS) and OBWO based on the k-Nearest Neighbor (kNN) classifier to boost variety and improve the consistency of the selected solution by giving potential candidates a chance to solve the given problem with a high fitness value. A comparison study with present optimization algorithms for single-objective bound-constraint optimization problems was conducted to evaluate the performance of the OBWOD algorithm on issues from the 2022 IEEE Congress on Evolutionary Computation (CEC’22) benchmark test suite with a range of dimension sizes. The results of the statistical significance test confirmed that the proposed algorithm is competitive with the optimization algorithms. In addition, the OBWOD algorithm surpassed the performance of seven other algorithms with an overall classification accuracy of 85.17% for classifying 10 medical datasets with different dimension sizes according to the performance evaluation matrix. |
format |
Article in Journal/Newspaper |
author |
Essam H. Houssein Awny Sayed |
author_facet |
Essam H. Houssein Awny Sayed |
author_sort |
Essam H. Houssein |
title |
Dynamic Candidate Solution Boosted Beluga Whale Optimization Algorithm for Biomedical Classification |
title_short |
Dynamic Candidate Solution Boosted Beluga Whale Optimization Algorithm for Biomedical Classification |
title_full |
Dynamic Candidate Solution Boosted Beluga Whale Optimization Algorithm for Biomedical Classification |
title_fullStr |
Dynamic Candidate Solution Boosted Beluga Whale Optimization Algorithm for Biomedical Classification |
title_full_unstemmed |
Dynamic Candidate Solution Boosted Beluga Whale Optimization Algorithm for Biomedical Classification |
title_sort |
dynamic candidate solution boosted beluga whale optimization algorithm for biomedical classification |
publisher |
MDPI AG |
publishDate |
2023 |
url |
https://doi.org/10.3390/math11030707 https://doaj.org/article/ad58842b454546cb905a946ae80964d6 |
genre |
Beluga Beluga whale Beluga* |
genre_facet |
Beluga Beluga whale Beluga* |
op_source |
Mathematics, Vol 11, Iss 707, p 707 (2023) |
op_relation |
https://www.mdpi.com/2227-7390/11/3/707 https://doaj.org/toc/2227-7390 doi:10.3390/math11030707 2227-7390 https://doaj.org/article/ad58842b454546cb905a946ae80964d6 |
op_doi |
https://doi.org/10.3390/math11030707 |
container_title |
Mathematics |
container_volume |
11 |
container_issue |
3 |
container_start_page |
707 |
_version_ |
1766374625415004160 |