An optimized Parkinson’s disorder identification through evolutionary fast learning network

Purpose-Parkinson’s disease(PD)is a well-known complex neurodegenerative disease.Typically,its identification is based on motor disorders,while the computer estimation of its main symptoms with computational machine learning(ML)has a high exposure which is supported by researches conducted.Nevertheless,ML approaches required first to refine their parameters and then to work with the best model generated.This process often requires an expert user to oversee the performance of the algorithm.Therefore,an attention is required towards new approaches for better forecasting accuracy.Design/methodology/approach-To provide an available identification model for Parkinson disease as an auxiliary function for clinicians,the authors suggest a new evolutionary classification model.The core of the prediction model is a fast learning network(FLN)optimized by a genetic algorithm(GA).To get a better subset of features and parameters,a new coding architecture is introduced to improve GA for obtaining an optimal FLN model.Findings-The proposed model is intensively evaluated through a series of experiments based on Speech and HandPD benchmark datasets.The very popular wrappers induction models such as support vector machine(SVM),K-nearest neighbors(KNN)have been tested in the same condition.The results support that the proposed model can achieve the best performances in terms of accuracy and g-mean.Originality/value-A novel efficient PD detectionmodel is proposed,which is called A-W-FLN.The A-W-FLN utilizes FLN as the base classifier;in order to take its higher generalization ability,and identification capability is alsoembedded to discover themost suitable featuremodel in the detection process.Moreover,the proposedmethod automatically optimizes the FLN’s architecture to a smaller number of hidden nodes and solid connecting weights.This helps the network to train on complex PD datasets with non-linear features and yields superior result.

Novel Newton’s learning algorithm of neural networks

Newton＇s learning algorithm of NN is presented and realized. In theory, the convergence rate of learning algorithm of NN based on Newton＇s method must be faster than BP＇s and other learning algorithms, because the gradient method is linearly convergent while Newton＇s method has second order convergence rate. The fast computing algorithm of Hesse matrix of the cost function of NN is proposed and it is the theory basis of the improvement of Newton＇s learning algorithm. Simulation results show that the convergence rate of Newton＇s learning algorithm is high and apparently faster than the traditional BP method＇s, and the robustness of Newton＇s learning algorithm is also better than BP method＇ s.