PSO-Based Support Vector Machine with Cuckoo Search Technique for Clinical Disease Diagnoses

Algorithm 1

Objective function:

𝑓(𝑥), 𝑋=𝑥₁,𝑥₂,𝑥_3,…,𝑥_𝑑

Generate an initial population of 𝑛 host nests;

While (𝑡 < MaxGeneration) or (stop criterion)

  Get a cuckoo’s nest 𝑖 randomly and replace its solution by performing Lévy flights;

  Evaluate its quality/fitness 𝐹_𝑖

  Choose a nest 𝑗 among 𝑛 randomly;

  if (𝐹_𝑖>𝐹_𝑗),

    Replace 𝑗 by the new solution;

  end if

  A fraction (𝑃_𝑎) of the worse nests are abandoned and new ones are built;

  Keep the best solutions/nests;

  Rank the solutions/nests and find the current best;

  Pass the current best solutions to the next generation;

end while