A Novel Binary Seagull Optimizer and its Application to Feature Selection Problem

37Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Seagull Optimization Algorithm (SOA) is a metaheuristic algorithm that mimics the migrating and hunting behaviour of seagulls. SOA is able to solve continuous real-life problems, but not to discrete problems. The eight different binary versions of SOA are proposed in this paper. The proposed algorithm uses four transfer functions, S-shaped and V-shaped, which are used to map the continuous search space into discrete search space. Twenty-five benchmark functions are used to validate the performance of the proposed algorithm. The statistical significance of the proposed algorithm is also analysed. Experimental results divulge that the proposed algorithm outperforms the competitive algorithms. The proposed algorithm is also applied on data mining. The results demonstrate the superiority of binary seagull optimization algorithm in data mining application.

Cite

CITATION STYLE

APA

Kumar, V., Kumar, Di., Kaur, M., Singh, Di., Idris, S. A., & Alshazly, H. (2021). A Novel Binary Seagull Optimizer and its Application to Feature Selection Problem. IEEE Access, 9, 103481–103496. https://doi.org/10.1109/ACCESS.2021.3098642

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free