Research Article
Optimization-Based Ensemble Feature Selection Algorithm and Deep Learning Classifier for Parkinson’s Disease
Algorithm 1
Levy flights cuckoo search algorithm.
| (1) | Begin | | (2) | Objective function with | | (3) | Generate initial population of N host nests | | (4) | While (t < MaxGeneration) | | (5) | Get a cuckoo (say i) randomly by Lévy flights | | (6) | Evaluate fitness by the accuracy of the classifier | | (7) | Choose a nest among N (say j) randomly | | (8 | ) If | | (9) | Replace j with the new solution | | (10) | End | | (11) | A fraction of worse nest(features in the dataset) are abandoned and new features are built by | | (12) | Lévy Flights | | (13) | Keep the best solutions using the accuracy of the feature | | (14) | End while | | (15) | Postprocess the results and visualization | | (16) | End |
|
