Skip to search boxSkip to navigationSkip to main content

BEPO: A novel binary emperor penguin optimizer for automatic feature selection

  • Gaurav Dhiman(corresponding author)
    ,
  • Diego Oliva
    ,
  • Amandeep Kaur
    ,
  • Krishna Kant Singh
    ,
  • S. Vimal
    ,
  • Ashutosh Sharma
*Corresponding author for this work
  • Government Bikram College of Commerce
    ,
  • Universidad de Guadalajara
    ,
  • Open University of Catalonia
    ,
  • Sri Guru Granth Sahib World University
    ,
  • Delhi-NCR
    ,
  • National Engineering College, Kovilpatti
Research Output:
Contribution to journal
Article
Research
Peer-review

Abstract

<p>Emperor Penguin Optimizer (EPO) is a metaheuristic algorithm which is recently developed and illustrates the emperor penguin's huddling behaviour. However, the original version of the EPO will fix issues that are continuing in fact but not discrete. The eight separate EPO variants have been provided in this article. Four transfer features, s-shaped and v-shaped, that are used in order to map the search space into a separate research space are considered in the proposed algorithm. The output of the proposed algorithm is validated using 25 standard benchmark functions. It also analyses the statistical sense of the proposed algorithm. Experimental findings and comparisons suggest that the proposed algorithm performs better than other algorithms. The solution also applies to the issue of feature selection. The findings reveal the supremacy of the binary emperor penguin optimization algorithm.</p>

Research Output Information

Output type

Research Output:
Contribution to journal
Article
Research
Peer-review

Original language

English

Article number

106560

Journal (Volume, Issue Number)

Knowledge-Based Systems (Volume 211)

Publication milestones

  • Published - 09/01/2021

Publication status

Published - 09/01/2021

ISSN

0950-7051

Publication IDs

  • Scopus: 85095687542

Publication metrics

Metrics

SciVal
FWCI
10.95
Scopus
citations

PlumX, opens in new tab

Captures
72
Citation count
223