2020
DOI: 10.21203/rs.3.rs-28683/v1
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

BEO: Binary Equilibrium Optimizer Combined with Simulated Annealing for Feature Selection

Abstract: This work proposed a binary variant of the recently-proposed Equilibrium Optimizer (EO) to solve binary problems. A v-shaped transfer function is used to map continuous values created in EO to binary. To improve the exploitation of the Binary Equilibrium Optimizer (BEO), the Simulated Annealing is used as one of the most popular local search methods. The proposed BEO algorithm is applied to 18 UCI datasets and compared to a wide range of algorithms. The results demonstrate the superiority and merits of EO when… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 48 publications
0
11
0
Order By: Relevance
“…The first experiment studies the effect of two different transformation functions on the original EO. The second experiment introduces a comparison of the proposed IBEO with the original EO and another binary version of EO called BEO that was published in 2020 [83]. In the third experiment, a comparison between IBEO and different algorithms such as PSO, GOA, GWO, WOA, DA, and ISSA is performed.…”
Section: Results and Analysismentioning
confidence: 99%
See 2 more Smart Citations
“…The first experiment studies the effect of two different transformation functions on the original EO. The second experiment introduces a comparison of the proposed IBEO with the original EO and another binary version of EO called BEO that was published in 2020 [83]. In the third experiment, a comparison between IBEO and different algorithms such as PSO, GOA, GWO, WOA, DA, and ISSA is performed.…”
Section: Results and Analysismentioning
confidence: 99%
“…Thus, the proposed IBEO is compared with the original EO and BEO. K. Ghosh proposed BEO as the first binary version of EO, which improved EO's exploitative abilities by using simulated annealing algorithm [83]. The average number of the selected features, classification accuracy, and fitness values are the most crucial comparative performance measurements in our experiment.…”
Section: ) Comparison Of Ibeo With Eo and Beomentioning
confidence: 99%
See 1 more Smart Citation
“…BASO is a meta-heuristic algorithm in which functions well in a number of benchmark tests [30,31]. The BASO replicates molecular dynamics fundamental theory and atom movement principles such as potential function characteristics, contact force, and geometric constraint force [30,31]. Atoms are a term used to describe a population of solutions in BASO algorithm.…”
Section: Selected Features Using Binary Atom Search Optimization (Baso)mentioning
confidence: 99%
“…In [34], the authors implemented a general learning strategy in EOA, helping the search-agents to avoid the local optima and to improve the capability for discovering a promising area. Moreover, [35] integrated simulated annealing with the equilibrium algorithm to improve its local search. In our proposed algorithm, IEOA, EOBL is used at the initialization phase to improve the initial solutions created in the standard EOA.…”
Section: Related Workmentioning
confidence: 99%