Chaotic binary reptile search algorithm and its feature selection applications

Laith Abualigah, Ali Diabat

Research output: Contribution to journalArticlepeer-review


Feature selection (FS) is known as the most challenging problem in the Machine Learning field. FS can be considered an optimization problem that requires an efficient method to prepare its optimal subset of relative features. This article introduces a new FS method-based wrapper scheme that mixes chaotic maps (CMs) and binary Reptile Search Algorithm (RSA) called CRSA, employed to address various FS problems. In this method, different chaotic maps are included with the main ideas of the RSA algorithm. The objective function is revealed to combine three objectives: maximizing the classification accuracy, the number of chosen features, and the complexity of produced wrapper models. To assess the achievement of the proposed methods, 20 UCI datasets are applied, and the results are compared with other well-known methods. The results showed the superiority of the introduced method in bettering other well-known techniques, particularly when applying binary RSA with Tent CM.

Original languageEnglish (US)
Pages (from-to)13931-13947
Number of pages17
JournalJournal of Ambient Intelligence and Humanized Computing
Issue number10
StatePublished - Oct 2023


  • Binary optimization problem
  • Chaotic maps
  • Feature selection (FS)
  • Meta-heuristic algorithm
  • Reptile Search Algorithm (RSA)

ASJC Scopus subject areas

  • General Computer Science


Dive into the research topics of 'Chaotic binary reptile search algorithm and its feature selection applications'. Together they form a unique fingerprint.

Cite this