Dipper Throated Optimization Algorithm for Unconstrained Function and Feature Selection

Dipper throated optimization (DTO) algorithm is a novel with a very efficient metaheuristic inspired by the dipper throated bird. DTO has its unique hunting technique by performing rapid bowing movements. To show the efficiency of the proposed algorithm, DTO is tested and compared to the algorithms...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers, materials & continua Ročník 72; číslo 1; s. 1465 - 1481
Hlavní autori: E. Takieldeen, Ali, M. El-kenawy, El-Sayed, Hadwan, Mohammed, M. Zaki, Rokaia
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Henderson Tech Science Press 2022
Predmet:
Bowing
Dipping
Feature selection
Genetic algorithms
Heuristic methods
Optimization algorithms
Optimization techniques
Particle swarm optimization
ISSN:1546-2226, 1546-2218, 1546-2226
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Dipper throated optimization (DTO) algorithm is a novel with a very efficient metaheuristic inspired by the dipper throated bird. DTO has its unique hunting technique by performing rapid bowing movements. To show the efficiency of the proposed algorithm, DTO is tested and compared to the algorithms of Particle Swarm Optimization (PSO), Whale Optimization Algorithm (WOA), Grey Wolf Optimizer (GWO), and Genetic Algorithm (GA) based on the seven unimodal benchmark functions. Then, ANOVA and Wilcoxon rank-sum tests are performed to confirm the effectiveness of the DTO compared to other optimization techniques. Additionally, to demonstrate the proposed algorithm's suitability for solving complex real-world issues, DTO is used to solve the feature selection problem. The strategy of using DTOs as feature selection is evaluated using commonly used data sets from the University of California at Irvine (UCI) repository. The findings indicate that the DTO outperforms all other algorithms in addressing feature selection issues, demonstrating the proposed algorithm's capabilities to solve complex real-world situations.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1546-2226
1546-2218
1546-2226
DOI:10.32604/cmc.2022.026026