A wavelet-chaos methodology is presented for analysis of EEGs and delta, theta, alpha, beta, and gamma subbands of EEGs for detection of seizure and epilepsy. The nonlinear dynamics of the original EEGs are quantified in the form of the correlation dimension (CD, representing system complexity) and the largest Lyapunov exponent (LLE, representing system chaoticity). The new wavelet-based methodology isolates the changes in CD and LLE in specific subbands of the EEG. The methodology is applied to three different groups of EEG signals: 1) healthy subjects; 2) epileptic subjects during a seizure-free interval (interictal EEG); 3) epileptic subjects during a seizure (ictal EEG). The effectiveness of CD and LLE in differentiating between the three groups is investigated based on statistical significance of the differences. It is observed that while there may not be significant differences in the values of the parameters obtained from the original EEG, differences may be identified when the parameters are employed in conjunction with specific EEG subbands. Moreover, it is concluded that for the higher frequency beta and gamma subbands, the CD differentiates between the three groups, whereas for the lower frequency alpha subband, the LLE differentiates between the three groups

This paper presents a novel dynamic ensemble learning (DEL) algorithm for designing ensemble of neural networks (NNs). DEL algorithm determines the size of ensemble, the number of individual NNs employing a constructive strategy, the number of hidden nodes of individual NNs employing a constructive–pruning strategy, and different training samples for individual NN’s learning. For diversity, negative correlation learning has been introduced and also variation of training samples has been made for individual NNs that provide better learning from the whole training samples. The major benefits of the proposed DEL compared to existing ensemble algorithms are (1) automatic design of ensemble; (2) maintaining accuracy and diversity of NNs at the same time; and (3) minimum number of parameters to be defined by user. DEL algorithm is applied to a set of real-world classification problems such as the cancer, diabetes, heart disease, thyroid, credit card, glass, gene, horse, letter recognition, mushroom, and soybean datasets. It has been confirmed by experimental results that DEL produces dynamic NN ensembles of appropriate architecture and diversity that demonstrate good generalization ability.

The keys for the development of an effective classification algorithm are: 1) discovering feature spaces with large margins between clusters and close proximity of the classmates and 2) discovering the smallest number of the features to perform accurate classification. In this paper, a new supervised classification algorithm, called neural dynamic classification (NDC), is presented with the goal of: 1) discovering the most effective feature spaces and 2) finding the optimum number of features required for accurate classification using the patented robust neural dynamic optimization model of Adeli and Park. The new classification algorithm is compared with the probabilistic neural network (PNN), enhanced PNN (EPNN), and support vector machine using two sets of classification problems. The first set consists of five standard benchmark problems. The second set is a large benchmark problem called Mixed National Institute of Standards and Technology database of handwritten digits. In general, NDC yields the most accurate classification results followed by EPNN. A beauty of the new algorithm is the smoothness of convergence curves which is an indication of robustness and good performance of the algorithm. The main aim is to maximize the prediction accuracy.