Feature Selection on Elite Hybrid Binary Cuckoo Search in Binary Label Classification

Algorithm 1

Classical version of CS adapted from [15].

Objective function f(x)

Generate initial population of n host nest ,(i=1,2,,n)

 while () or (stop criterion)do

 Get a cuckoo randomly by Levy flights evaluate its quality/fitness

 Choose a nest among n (say, j);

 if () then

  replace j by new solution;

 end

 A fraction () of worse nests are abandoned and new ones are built

 Keep the best solution (or nests with quality solutions)

 Rank the solutions and find the current best

 end

Postprocess results and visualization