Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11889/5540
Title: An efficient binary salp swarm algorithm with crossover scheme for feature selection problems
Authors: Faris, Hossam
Mafarja, Majdi
Heidari, Ali Asghar
Aljarah, Ibrahim
Al-Zoubi, Ala’ M.
Mirjalili, Seyedali
Fujita, Hamido
Keywords: Mathematical optimization;Computer algorithms;Artificial intelligence;Data mining;Machine learning;Classification;Data structures (Computer science)
Issue Date: 9-May-2018
Publisher: Expert systems (Computer science)
Abstract: Searching for the (near) optimal subset of features is a challenging problem in the process of Feature Selection (FS). In the literature, Swarm Intelligence (SI) algorithms show superior performance in solving this problem. This motivated our attempts to test the performance of the newly proposed Salp Swarm Algorithm (SSA) in this area. As such, two new wrapper FS approaches that use SSA as the search strategy are proposed. In the first approach, eight transfer functions are employed to convert the continuous version of SSA to binary. In the second approach, the crossover operator is used in addition to the transfer functions to replace the average operator and enhance the exploratory behavior of the algorithm. The proposed approaches are benchmarked on 22 well-known UCI datasets and the results are compared with 5 FS methods: Binary Grey Wolf Optimizer (BGWO), Binary Gravitational Search Algorithms (BGSA), Binary Bat Algorithm (BBA), Binary Particle Swarm Optimization (BPSO), and Genetic Algorithm (GA). The paper also considers an extensive study of the parameter setting for the proposed technique. From the results, it is observed that the proposed approach significantly outperforms others on around 90% of the datasets.
URI: http://hdl.handle.net/20.500.11889/5540
Appears in Collections:Fulltext Publications

Show full item record

Page view(s)

43
Last Week
0
Last month
2
checked on Jan 2, 2022

Download(s)

457
checked on Jan 2, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.