<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">CS</journal-id><journal-title-group><journal-title>Circuits and Systems</journal-title></journal-title-group><issn pub-type="epub">2153-1285</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/cs.2016.78127</article-id><article-id pub-id-type="publisher-id">CS-67296</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject><subject> Engineering</subject><subject> Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  A Unique Approach to Epilepsy Classification from EEG Signals Using Dimensionality Reduction and Neural Networks
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Harikumar</surname><given-names>Rajaguru</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Sunil</surname><given-names>Kumar Prabhakar</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Department of ECE, Bannari Amman Institute of Technology, Sathyamangalam, India</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>sunilprabhakar22@gmail.com(SKP)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>02</day><month>06</month><year>2016</year></pub-date><volume>07</volume><issue>08</issue><fpage>1455</fpage><lpage>1464</lpage><history><date date-type="received"><day>28</day>	<month>March</month>	<year>2016</year></date><date date-type="rev-recd"><day>accepted</day>	<month>20</month>	<year>April</year>	</date><date date-type="accepted"><day>13</day>	<month>June</month>	<year>2016</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  Characterized by recurrent and rapid seizures, epilepsy is a great threat to the livelihood of the human beings. Abnormal transient behaviour of neurons in the cortical regions of the brain leads to a seizure which characterizes epilepsy. The physical and mental activities of the patient are totally dampened with this epileptic seizure. A significant clinical tool for the study, analysis and diagnosis of the epilepsy is electroencephalogram (EEG). To detect such seizures, EEG signals aids greatly to the clinical experts and it is used as an important tool for the analysis of brain disorders, especially epilepsy. In this paper, the high dimensional EEG data are reduced to a low dimension by incorporating techniques such as Fuzzy Mutual Information (FMI), Independent Component Analysis (ICA), Linear Graph Embedding (LGE), Linear Discriminant Analysis (LDA) and Variational Bayesian Matrix Factorization (VBMF). After employing them as dimensionality reduction techniques, the Neural Networks (NN) such as Cascaded Feed Forward Neural Network (CFFNN), Time Delay Neural Network (TDNN) and Generalized Regression Neural Network (GRNN) are used as Post Classifiers for the Classification of Epilepsy Risk Levels from EEG signals. The bench mark parameters used here are Performance Index (PI), Quality Values (QV), Time Delay, Accuracy, Specificity and Sensitivity.
 
</p></abstract><kwd-group><kwd>LDA</kwd><kwd> FMI</kwd><kwd> ICA</kwd><kwd> LGE</kwd><kwd> VBMF</kwd><kwd> NN</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>For a majority of the biomedical scientists, medical practitioners and biomedical engineers, a lot of research is in progress about the functioning of the human brain [<xref ref-type="bibr" rid="scirp.67296-ref1">1</xref>] . The brain is actually a very complex and important organ of a human body where the interconnection of the neurons happens with both the remote and local ones. Since epilepsy greatly affects the quality of life of humans on a day to day basis, tremendous attention is drawn towards this particular disorder. The local or the remote interactions of the neurons in the brain are projected as the spatio-temporal electromagnetic field of the brain and thus EEG recordings are made easily [<xref ref-type="bibr" rid="scirp.67296-ref2">2</xref>] . To measure the activities of the brain, the only direct way is processing EEG and thus in the area of biomedical research it holds a paramount importance.</p><p>When performing the analysis of any particular information, high dimensional data are found often in most of the disciplines. The dimensions of the data must be made low and it should be regularized because only then approximation techniques can be applied easily [<xref ref-type="bibr" rid="scirp.67296-ref3">3</xref>] . In a high dimensional vector space, it is difficult to process the data and therefore it is mandatory to convert into a smooth low-dimensional manifold. For easy classification purposes and for the modeling of numerous non-linear applications, low dimensional data are often required.</p><p>EEG signal processing has several vital constraints. In EEG signal processing, a huge number of signals have to be processed, which is generally very difficult since all the signals are highly interdependent. Each signal is very unique in an EEG and hence it is not repeatable. Also, based on the characteristics of the equipment or source, EEG signals are often noisy [<xref ref-type="bibr" rid="scirp.67296-ref4">4</xref>] . The observed dataset is focused primarily by the dimensionality reduction techniques and it avoids the generalization performance. The total number of columns is reduced in Dimensionality Reduction techniques and the vectors are mapped to their respective sub-spaces. In the EEG recording session, it is mandatory to record the waveforms ranging from minutes to hours with a sampling frequency of about 200 Hz. In such cases, the generated data are so huge and magnified by a thousand-fold which ranges to even more than hundreds of gigabytes. So, data reduction is definitely required without which the loading of the dataset into the memory module becomes a very hectic task. Dimensionality Reduction is employed by means of selecting the most appropriate channels and time epochs. The organization of the paper is as follows. In Section 2, the materials and methods are discussed followed by the dimensionality reduction techniques in Section 3. In section 4 the Neural Networks as post classifiers are discussed followed by the results and discussion in Section 5 and in Section 6 the paper is concluded.</p></sec><sec id="s2"><title>2. Materials and Methods</title><p>For the performance assessment of the epilepsy risk levels using the FMI, ICA, LGE, LDA and VBMF as Dimensionality Reduction technique followed by NN as Post Classifiers, the raw EEG data of 20 epileptic patients who were under treatment in the Neurology Department of Sri Ramakrishna Hospital, Coimbatore in European Data Format (EDF) are taken for study. The EEG is recorded by placing electrodes on the scalp according to the International 10 - 20 system. Sixteen channels of EEG are recorded simultaneously for both referential montages, where all electrodes are referenced to a common potential like ear, and bipolar montages, where each electrode is referenced to an adjacent electrode. Recordings are made while the patient is fully awake but in resting condition and include periods of eyes open, eyes closed, hyperventilation and photonic stimulation. Amplification is provided by an EEG-machine (Siemens Minograph Universal). Before placing the electrodes, the scalp is cleaned, lightly abraded and electrode paste is applied between the electrode and the skin. By means of this application of electrode paste, the contact impedance is less than 10 kW. Generally disk like surface electrodes are used. In some cases, needle electrodes are used to pick up the EEG signals. The signals are recorded with the speed of 30 mm/s.</p><p>The pre processing stage of the EEG signals is given more attention because it is vital to use the best available technique in literature to extract all the useful information embedded in the non-stationary biomedical signals [<xref ref-type="bibr" rid="scirp.67296-ref5">5</xref>] . The EEG records which were obtained were continuous for about 30 minutes and each of them was divided into epochs of two second duration. Generally a two second epoch is long enough to avoid unnecessary redundancy in the signal and it is long enough to detect any significant changes in activity and to detect the presence of artifacts in the signal [<xref ref-type="bibr" rid="scirp.67296-ref5">5</xref>] . For each and every patient, the total number of channels is 16 and it is over three epochs. The frequency is considered to be 50 Hz and the sampling frequency is considered to be about 200 Hz. Each and every sample corresponds to the instantaneous amplitude values of the signal which totals to 400 values for an epoch. The total number of artifacts present in the data is four. Chewing artifact, motion artifact, eye blink and electromyography (EMG) are the four numbers of artifacts present and approximately the percentage of data which are artifacts is 1%. No attempts were made to select certain number of artifacts which are of more specific nature. The main objective to include artifacts is to differentiate the spike categories of waveforms from non spike categories. <xref ref-type="fig" rid="fig1">Figure 1</xref> shows the block diagram of the procedure.</p></sec><sec id="s3"><title>3. Dimensionality Reduction Techniques</title><p>The dimensions of the EEG data are stored by a pre-processing step known as Dimensionality Reduction (DR). By separating a set of important features that goes hand in hand with certain important criteria, the dimensions of the data can be reduced. The impact of the reduced dimensions has a vital effect to play in the classification process. Each epoch contains 400 values and hence the total volume for a patient is around 25,600 samples. So it absolutely necessary to reduce the dimensions of the data for smooth processing of the EEG signals. In a high-dimensional data set, it is important to understand that not all the obtained variables by appropriate measurements are utilized for analyzing the underlying area of interest.</p><sec id="s3_1"><title>3.1. Independent Component Analysis (ICA)</title><p>Assuming that there are totally “n” linear mixtures as<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x6.png" xlink:type="simple"/></inline-formula>, where “n” represents the independent components, it can be written mathematically as follows:</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x7.png" xlink:type="simple"/></inline-formula>for all j. (1)</p><p>The vector-matrix notation is utilized completely and the above equation can be written as follows [<xref ref-type="bibr" rid="scirp.67296-ref6">6</xref>]</p><disp-formula id="scirp.67296-formula324"><label>. (2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x8.png"  xlink:type="simple"/></disp-formula><p>where A denotes the matrix with particular elements<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x9.png" xlink:type="simple"/></inline-formula>, x is the random row vector of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x10.png" xlink:type="simple"/></inline-formula> or sometimes <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x11.png" xlink:type="simple"/></inline-formula> is used which denotes the transpose of the row vector, s is also the random row vector of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x12.png" xlink:type="simple"/></inline-formula>. Emphasizing the</p><p>importance of columns of matrix A, the model can be written as follows<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x13.png" xlink:type="simple"/></inline-formula>, where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x14.png" xlink:type="simple"/></inline-formula> denotes the</p><p>columns of matrix A. It is considered as a generative model where an observed data is described clearly. If the matrix A is estimated, then the computation of its inverse, say P, is obtained easily and then the independent component is obtained as follows</p><disp-formula id="scirp.67296-formula325"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x15.png"  xlink:type="simple"/></disp-formula></sec><sec id="s3_2"><title>3.2. Linear Graph Embedding (LGE)</title><p>This process generally involves Graph Embedding, Linearization and Kernelization procedures but for</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Block diagram of the procedure</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/27-7600653x16.png"/></fig><p>dimensionality reduction of EEG signals the following procedure is considered. A sample set for model training is represented as a matrix<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x17.png" xlink:type="simple"/></inline-formula>, where N represents the sample number. Consider<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x18.png" xlink:type="simple"/></inline-formula>, where m is the feature dimension [<xref ref-type="bibr" rid="scirp.67296-ref7">7</xref>] . In reality, the dimension of the feature “m” is too high and so it is mandatory to transform the data from high-dimensional space (original data) to lower-dimensional space [<xref ref-type="bibr" rid="scirp.67296-ref7">7</xref>] . The main task of this Dimensionality Reduction is to just find a mapping function which is represented as follows</p><disp-formula id="scirp.67296-formula326"><label>. (4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x19.png"  xlink:type="simple"/></disp-formula><p>This main function always transforms <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x20.png" xlink:type="simple"/></inline-formula> into the desired low-dimensional representation<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x21.png" xlink:type="simple"/></inline-formula>, where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x22.png" xlink:type="simple"/></inline-formula>.</p><p>Therefore it is mathematically represented as follows</p><disp-formula id="scirp.67296-formula327"><label>. (5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x23.png"  xlink:type="simple"/></disp-formula></sec><sec id="s3_3"><title>3.3. Fuzzy Mutual Information (FMI)</title><p>It is a filter method where the irrelevant features can be easily reduced. Enrichment of the mutual information is done using the fuzzy concept [<xref ref-type="bibr" rid="scirp.67296-ref8">8</xref>] . Initially the discretization process is done and the number of clusters is assigned. The membership function of the fuzzy set is constructed using triangular membership function [<xref ref-type="bibr" rid="scirp.67296-ref8">8</xref>] . The fuzzy entropy is then calculated using class degree as follows</p><disp-formula id="scirp.67296-formula328"><label>. (6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x24.png"  xlink:type="simple"/></disp-formula><p>The entropy of class C is then calculated as follows</p><disp-formula id="scirp.67296-formula329"><label>. (7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x25.png"  xlink:type="simple"/></disp-formula><p>The normalized Fuzzy entropy measure is then calculated as follows</p><disp-formula id="scirp.67296-formula330"><label>. (8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x26.png"  xlink:type="simple"/></disp-formula></sec><sec id="s3_4"><title>3.4. Linear Discriminant Analysis (LDA)</title><p>It is a popular technique for dimensionality reduction [<xref ref-type="bibr" rid="scirp.67296-ref9">9</xref>] . An orientation P is found out which reduces feature vectors belonging to different or higher classes to a low dimensional space. Supporting, if the dimensionality reduction is from a b-dimensional <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x27.png" xlink:type="simple"/></inline-formula> space to an c-dimensional <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x28.png" xlink:type="simple"/></inline-formula> space (where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x29.png" xlink:type="simple"/></inline-formula>), then the size of the orientation P is easily obtained by maximizing the Fischer’s criterion function<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x30.png" xlink:type="simple"/></inline-formula>. The orientation P, within-class scatter matrix <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x31.png" xlink:type="simple"/></inline-formula> and between-class scatter matrix <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x31.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x32.png" xlink:type="simple"/></inline-formula> are the three important factors for the determination of criterion function [<xref ref-type="bibr" rid="scirp.67296-ref9">9</xref>] .</p><p>To determine the LDA explicitly, it is vital to consider a multiclass pattern recognition and classification problem with e classes. Let <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x33.png" xlink:type="simple"/></inline-formula> be the set of “e” class labels, where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x34.png" xlink:type="simple"/></inline-formula> denotes the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x35.png" xlink:type="simple"/></inline-formula> class label. In such cases, the Fischer’s criterion as a function of “P” can be given as follows</p><disp-formula id="scirp.67296-formula331"><label>. (9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x36.png"  xlink:type="simple"/></disp-formula></sec><sec id="s3_5"><title>3.5. Variational Bayesian Matrix Factorization</title><p>It refers to a method for uncovering a very low-rank structure of a particular data [<xref ref-type="bibr" rid="scirp.67296-ref10">10</xref>] . It also approximately determines the data matrix as a product of any two factor matrices. For collaborative prediction, matrix factorization is very popular and the user predicts the unknown ratings. If <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x37.png" xlink:type="simple"/></inline-formula> is considered to be a user-item rating matrix, the (a, b) entry in which, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x38.png" xlink:type="simple"/></inline-formula>represents the rating of user on an item matrix b. The Matrix factorization [<xref ref-type="bibr" rid="scirp.67296-ref10">10</xref>] determines the factor matrices <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x39.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x40.png" xlink:type="simple"/></inline-formula>, where the rank of the factor matrices is represented by K. It is done to approximate the rating matrix Y by <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x41.png" xlink:type="simple"/></inline-formula> as is represented as follows</p><disp-formula id="scirp.67296-formula332"><label>. (10)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x42.png"  xlink:type="simple"/></disp-formula><p>The over fitting problem is successfully alleviated by the Bayesian treatment of matrix factorization.</p></sec></sec><sec id="s4"><title>4. Post Classifiers Used Here</title><p>Several post classifiers for the classification of epilepsy risk levels was considered in [<xref ref-type="bibr" rid="scirp.67296-ref11">11</xref>] . The Neural Networks which are used as post classifiers here are Cascaded Feed Forward Neural Network (CFFNN) Generalized Regression Neural Network (GRNN) and Time Delay Neural Network (TDNN).</p><sec id="s4_1"><title>4.1. Cascaded Feed Forward Neural Network (CFFNN)</title><p>To understand the cascaded feed forward neural network, feed forward back propagation model is considered. The feed forward back propagation model consists of input, hidden and output layers. The learning algorithm used here is Back Propagation Networks (BPN). During the training phase, from the input layer of the network to the output layer of network, calculations were carried out and the generated error values are then forwarded to the prior layers [<xref ref-type="bibr" rid="scirp.67296-ref12">12</xref>] . Generally, the hidden layers are one or more and it consists of sigmoidal neurons. The cascaded forward networks are very similar to the feed forward networks. From input to each layer, a weight connection is given and between the successive layers also, a weight connection is given. The finite input-output relationship can be learnt arbitrarily in this type of network. To improve the speed, the additional connections aids greatly so that the network learns the desired relationship quickly. Here, the testing process is evaluated by the parameter Mean Square Error (MSE) which is defined as</p><disp-formula id="scirp.67296-formula333"><label>(11)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x43.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x44.png" xlink:type="simple"/></inline-formula> denotes the observed value at time i, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x45.png" xlink:type="simple"/></inline-formula>is the target value at model j; j = 1 - 10, and N is the total number of observations per epoch.</p></sec><sec id="s4_2"><title>4.2. Generalized Regression Neural Network (GRNN)</title><p>This network does not require a training procedure which is iterative in nature. It is always very consistent in its attributes. For the estimation of the continuous variables, GRNN can be used easily. The approximation of arbitrary function between input and output vectors are done quite easily in this model [<xref ref-type="bibr" rid="scirp.67296-ref13">13</xref>] . It is composed of four layers namely, input layer, pattern layer, summation layer and output layer respectively. The total number of input units equals the total number of parameters always. The first layer is joined to the pattern layer, which forms the second layer. A training pattern is signified by each unit in the pattern layer. Each pattern layer unit is connected to the two neurons present in the summation layer, namely S-summation neuron and D-summation neuron. S-summation computes the weighted outputs of the pattern layer and D-summation computes the unweighted outputs of the pattern layer. The function of the output layer is to divide the output of each S-summa- tion neuron by the output of each D-summation neuron [<xref ref-type="bibr" rid="scirp.67296-ref13">13</xref>] and so to an unknown vector<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/27-7600653x46.png" xlink:type="simple"/></inline-formula>, a predicted value is supplied as follows</p><disp-formula id="scirp.67296-formula334"><label>. (12)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x47.png"  xlink:type="simple"/></disp-formula></sec><sec id="s4_3"><title>4.3. Time Delay Neural Network (TDNN)</title><p>It is an Artificial Neural architecture, where the main intention of it is to work on data which is sequential in manner and it is feed forward in nature. The TDNN units easily recognize the features which are highly independent of time shift [<xref ref-type="bibr" rid="scirp.67296-ref14">14</xref>] . Its application is higher and forms an integral part in the pattern recognition system. Augmentation of the input signal is done initially and other input is represented as delayed copies. Since there are no internal states present here, the Neural Network is generally assumed to be time-shift invariant.</p></sec><sec id="s4_4"><title>4.4. Training Algorithm Used for the Neural Networks</title><p>The Levenberg-Marquardt (LM) algorithm is the basic training method for minimization of MSE (Mean Square Error) criteria, due to its fast converging properties and robustness [<xref ref-type="bibr" rid="scirp.67296-ref15">15</xref>] . It provides a rapid convergence and hence it is versatile, efficient, robust and simple to implement, and it is not necessary for the user to initialize any strange design parameters. It out performs simple gradient descent and other conjugate gradient methods in a wide variety of scenarios. The LM algorithm is first shown to be a blend of vanilla gradient descent and Gaussian Newton iteration [<xref ref-type="bibr" rid="scirp.67296-ref15">15</xref>] . This error back propagation algorithm is used to compute the weights updates in each layer of the network. The derivation of LM update rule is shown below for a standard back propagation algorithm. An approximate steepest descent rule has been used and updated the weight according to the following equation as devised by</p><disp-formula id="scirp.67296-formula335"><label>(13)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x48.png"  xlink:type="simple"/></disp-formula><p>where W(k) is the weight at the k<sup>th</sup> iteration, α is the learning rate, (k) is the difference between NN output and the expected output. DW(k) is the weighted difference between the k<sup>th</sup> and (k − 1)<sup>th</sup> iteration (this item is optimal), and m is the momentum constant. In some adaptive algorithms, α change with time, but this requires many iterations and leads to a high computational burden. Fortunately, the non-linear least squares Gauss-Newton has been used to solve many supervised NN training problem.</p></sec></sec><sec id="s5"><title>5. Results and Discussion</title><p>For FMI, ICA, LGE, LDA and VBMF as dimensionality reduction techniques and Neural Networks as Post Classifiers, based on the Performance Index, Quality values, Time Delay and Accuracy the simulated result values are plotted in Tables 1-3 respectively. The formulae for the Performance Index (PI), Sensitivity, Specificity and Accuracy are given as follows</p><disp-formula id="scirp.67296-formula336"><label>(14)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x49.png"  xlink:type="simple"/></disp-formula><p>where PC―Perfect Classification, MC―Missed Classification, FA―False Alarm.</p><p>The Sensitivity, Specificity and Accuracy measures are stated by the following</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Analysis of dimensionality reduction techniques with GR-NN</title></caption><table><tbody><thead><tr><th align="center" valign="middle" ></th><th align="center" valign="middle" >PC</th><th align="center" valign="middle" >MC</th><th align="center" valign="middle" >FA</th><th align="center" valign="middle" >PI</th><th align="center" valign="middle" >Sensitivity</th><th align="center" valign="middle" >Specificity</th><th align="center" valign="middle" >Time</th><th align="center" valign="middle" >Quality</th><th align="center" valign="middle" >Accuracy</th></tr></thead><tr><td align="center" valign="middle" >FMI + GR-NN</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >25</td><td align="center" valign="middle" >100</td></tr><tr><td align="center" valign="middle" >ICA + GR-NN</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >25</td><td align="center" valign="middle" >100</td></tr><tr><td align="center" valign="middle" >LDA + GR-NN</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >25</td><td align="center" valign="middle" >100</td></tr><tr><td align="center" valign="middle" >LGE + GR-NN</td><td align="center" valign="middle" >93.19</td><td align="center" valign="middle" >0.83</td><td align="center" valign="middle" >5.97</td><td align="center" valign="middle" >92.38</td><td align="center" valign="middle" >94.02</td><td align="center" valign="middle" >99.16</td><td align="center" valign="middle" >1.91</td><td align="center" valign="middle" >20.79</td><td align="center" valign="middle" >96.59</td></tr><tr><td align="center" valign="middle" >VBMF + GR-NN</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >25</td><td align="center" valign="middle" >100</td></tr></tbody></table></table-wrap><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> Analysis of dimensionality reduction techniques with TD-NN</title></caption><table><tbody><thead><tr><th align="center" valign="middle" ></th><th align="center" valign="middle" >PC</th><th align="center" valign="middle" >MC</th><th align="center" valign="middle" >FA</th><th align="center" valign="middle" >PI</th><th align="center" valign="middle" >Sensitivity</th><th align="center" valign="middle" >Specificity</th><th align="center" valign="middle" >Time</th><th align="center" valign="middle" >Quality</th><th align="center" valign="middle" >Accuracy</th></tr></thead><tr><td align="center" valign="middle" >FMI + TD-NN</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >25</td><td align="center" valign="middle" >100</td></tr><tr><td align="center" valign="middle" >ICA + TD-NN</td><td align="center" valign="middle" >95.27</td><td align="center" valign="middle" >2.22</td><td align="center" valign="middle" >2.5</td><td align="center" valign="middle" >94.52</td><td align="center" valign="middle" >97.5</td><td align="center" valign="middle" >97.77</td><td align="center" valign="middle" >2.03</td><td align="center" valign="middle" >22.42</td><td align="center" valign="middle" >97.63</td></tr><tr><td align="center" valign="middle" >LDA + TD-NN</td><td align="center" valign="middle" >95.06</td><td align="center" valign="middle" >0.69</td><td align="center" valign="middle" >4.23</td><td align="center" valign="middle" >94.51</td><td align="center" valign="middle" >95.76</td><td align="center" valign="middle" >99.30</td><td align="center" valign="middle" >1.94</td><td align="center" valign="middle" >21.90</td><td align="center" valign="middle" >97.53</td></tr><tr><td align="center" valign="middle" >LGE + TD-NN</td><td align="center" valign="middle" >96.45</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >3.54</td><td align="center" valign="middle" >96.10</td><td align="center" valign="middle" >96.45</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >1.92</td><td align="center" valign="middle" >22.55</td><td align="center" valign="middle" >98.22</td></tr><tr><td align="center" valign="middle" >VBMF + TD-NN</td><td align="center" valign="middle" >94.79</td><td align="center" valign="middle" >0.34</td><td align="center" valign="middle" >4.86</td><td align="center" valign="middle" >94.19</td><td align="center" valign="middle" >95.13</td><td align="center" valign="middle" >99.65</td><td align="center" valign="middle" >1.91</td><td align="center" valign="middle" >21.66</td><td align="center" valign="middle" >97.39</td></tr></tbody></table></table-wrap><table-wrap id="table3" ><label><xref ref-type="table" rid="table3">Table 3</xref></label><caption><title> Analysis of dimensionality reduction techniques with CFF-NN</title></caption><table><tbody><thead><tr><th align="center" valign="middle" ></th><th align="center" valign="middle" >PC</th><th align="center" valign="middle" >MC</th><th align="center" valign="middle" >FA</th><th align="center" valign="middle" >PI</th><th align="center" valign="middle" >Sensitivity</th><th align="center" valign="middle" >Specificity</th><th align="center" valign="middle" >Time</th><th align="center" valign="middle" >Quality</th><th align="center" valign="middle" >Accuracy</th></tr></thead><tr><td align="center" valign="middle" >FMI + CFF-NN</td><td align="center" valign="middle" >93.26</td><td align="center" valign="middle" >1.45</td><td align="center" valign="middle" >5.30</td><td align="center" valign="middle" >92.41</td><td align="center" valign="middle" >94.72</td><td align="center" valign="middle" >98.54</td><td align="center" valign="middle" >1.95</td><td align="center" valign="middle" >21.00</td><td align="center" valign="middle" >96.63</td></tr><tr><td align="center" valign="middle" >ICA + CFF-NN</td><td align="center" valign="middle" >92.26</td><td align="center" valign="middle" >1.87</td><td align="center" valign="middle" >5.86</td><td align="center" valign="middle" >90.91</td><td align="center" valign="middle" >94.13</td><td align="center" valign="middle" >98.12</td><td align="center" valign="middle" >1.95</td><td align="center" valign="middle" >20.78</td><td align="center" valign="middle" >96.13</td></tr><tr><td align="center" valign="middle" >LDA + CFF-NN</td><td align="center" valign="middle" >94.30</td><td align="center" valign="middle" >1.73</td><td align="center" valign="middle" >3.95</td><td align="center" valign="middle" >93.72</td><td align="center" valign="middle" >96.04</td><td align="center" valign="middle" >98.26</td><td align="center" valign="middle" >1.99</td><td align="center" valign="middle" >21.65</td><td align="center" valign="middle" >97.15</td></tr><tr><td align="center" valign="middle" >LGE + CFF-NN</td><td align="center" valign="middle" >93.81</td><td align="center" valign="middle" >0.57</td><td align="center" valign="middle" >5.62</td><td align="center" valign="middle" >92.95</td><td align="center" valign="middle" >94.37</td><td align="center" valign="middle" >99.44</td><td align="center" valign="middle" >1.90</td><td align="center" valign="middle" >21.15</td><td align="center" valign="middle" >96.90</td></tr><tr><td align="center" valign="middle" >VBMF + CFF-NN</td><td align="center" valign="middle" >93.26</td><td align="center" valign="middle" >0.62</td><td align="center" valign="middle" >6.11</td><td align="center" valign="middle" >92.49</td><td align="center" valign="middle" >93.88</td><td align="center" valign="middle" >99.37</td><td align="center" valign="middle" >1.90</td><td align="center" valign="middle" >20.74</td><td align="center" valign="middle" >96.63</td></tr></tbody></table></table-wrap><disp-formula id="scirp.67296-formula337"><label>(15)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x50.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67296-formula338"><label>(16)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x51.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67296-formula339"><label>. (17)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x52.png"  xlink:type="simple"/></disp-formula><p>The Time Delay and the Quality Value Measures are given by the following</p><disp-formula id="scirp.67296-formula340"><label>(18)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x53.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67296-formula341"><label>. (19)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/27-7600653x54.png"  xlink:type="simple"/></disp-formula><p>On the careful examination of <xref ref-type="table" rid="table1">Table 1</xref>, other than LGE technique all the other dimensionality reduction techniques with GR-NN provide a 100% accuracy and similar results. On the careful analysis of <xref ref-type="table" rid="table2">Table 2</xref>, the FMI with TD-NN provides a 100% accuracy when compared to the other dimensionality reduction techniques. On the careful analysis of <xref ref-type="table" rid="table3">Table 3</xref>, it is inferred that LDA-CFNN provides the highest accuracy as of 97.15%. Figures 2-5 provide the accuracy measures, quality value measures, time delay measures and performance index measures respectively.</p></sec><sec id="s6"><title>6. Conclusion</title><p>Thus the most used technique to capture the brain signals is the EEG signals. EEG always provides an excellent temporal resolution. EEG is considered as a highly complex human brain signal which consists of valid information about the functions of the brain and the other neurological disorders. EEG also plays a vital role for diagnosis of epilepsy, early detection of brain tumour, early detection of problems related to sleep etc. Epilepsy generally affects people from all ages but young infants and the elderly people are more prone to it. Epilepsy occurs due to abnormalities in the genetic mechanisms of humans or it may be due to developmental anomalies and infections in the central nervous system. It is quite difficult to extract the feature rhythms because the EEG signal is quite complex, stochastic and non-stationary in nature. Due to the abrupt and unpredictable nature of the epileptic seizures, the everyday routine life of an epileptic patient is severely affected. Since epilepsy is witnessed by sudden disturbances of the mental functions which results due to the excessive discharging of groups of cells in the brain, the epileptic EEG obtained from the scalp is characterized by synchronized periodic waveforms which have very high amplitude. Spikes and sharp waves too are found in between the seizures and hence the detection of it by an encephalographer is quite difficult as it requires skilled technicians who are in great demand nowadays. This leads to a prolonged diagnosis time period and also the expenditures related to it are too much to bear. Surgery may not be suitable to all the patients because it demands the consideration of other health risks also. Therefore, the seizures have to be detected in an automatic manner and it forms an integral part of biomedical research. This</p><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> Accuracy measures of dimensionality reduction techniques with NN</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/27-7600653x55.png"/></fig><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Quality value measures of dimensionality reduction techniques with NN</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/27-7600653x56.png"/></fig><fig id="fig4"  position="float"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> Time delay measures of dimensionality reduction techniques with NN</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/27-7600653x57.png"/></fig><p>research on epilepsy has therefore become an active interdisciplinary field of biomedical research. Thus the dimensions of the EEG signals were reduced using five different dimensionality reduction techniques and then it was classified by using three different types of Neural Network Post Classifiers. Results showed that FMI-GRNN, ICA-GRNN, LDA-GRNN, VBMF-GRNN and FMI-TDNN showed an accuracy of 100% with the highest quality</p><fig id="fig5"  position="float"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> Performance index measures of dimensionality reduction techniques with NN</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/27-7600653x58.png"/></fig><p>values as of 25. Future works plan to incorporate other neural networks and genetic algorithms for the epilepsy classification from EEG signals.</p></sec><sec id="s7"><title>Cite this paper</title><p>Harikumar Rajaguru,Sunil Kumar Prabhakar, (2016) A Unique Approach to Epilepsy Classification from EEG Signals Using Dimensionality Reduction and Neural Networks. Circuits and Systems,07,1455-1464. doi: 10.4236/cs.2016.78127</p></sec></body><back><ref-list><title>References</title><ref id="scirp.67296-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Gotman, J. (1982) Automatic Recognition of Epileptic Seizures in the EEG. Electroencephalography and Clinical Neurophysiology, 54, 530-540. http://dx.doi.org/10.1016/0013-4694(82)90038-4</mixed-citation></ref><ref id="scirp.67296-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Finley, K.H. and Dynes, J.B. (1942) Electroencephalographic Studies in Epilepsy: A Critical Analysis. Brain, 65, 256-265. http://dx.doi.org/10.1093/brain/65.3.256</mixed-citation></ref><ref id="scirp.67296-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Easwaramoorthy, D. and Uthayakumar, R. (2010) Analysis of Biomedical EEG Signals Using Wavelet Transforms and Multiultifractal Analysis. IEEE EMB Magazine, 30, 7487.</mixed-citation></ref><ref id="scirp.67296-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Harikumar, R. and Sunil Kumar, P. (2015) Dimensionality Reduction Techniques for Processing Epileptic Encephalographic Signals. Biomedical and Pharmacology Journal, 8, No. 1.</mixed-citation></ref><ref id="scirp.67296-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Zhang, G.Q. (2000) Neural Networks for Classification A Survey. IEEE Transactions on Systems Man Cybernetics—Part C: Applications and Reviews, 30, 451-462. http://dx.doi.org/10.1109/5326.897072</mixed-citation></ref><ref id="scirp.67296-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Xu, L., Cheung, C., Yang, H. and Amari, S. (1997) Independent Component Analysis by the Information-Theoretic Approach with Mixture of Densities. International Conference on Neural Networks, Houston, TX, 9-12 June 1997, 1821-1826.</mixed-citation></ref><ref id="scirp.67296-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Yan, S., Xu, D., Zhang, B. and Zhang, H.J. (2005) Graph Embedding: A General Framework for Dimensionality Reduction. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, San Diego, CA, June 2005, 830-837.</mixed-citation></ref><ref id="scirp.67296-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Sanchez, L. (2005) A Fuzzy Definition of Mutual Information with Application to the Design of Genetic Fuzzy Classifiers. International Conference on Machine Intelligence, Tozeur, Tunisia, 5-7 November 2005, 602-609.</mixed-citation></ref><ref id="scirp.67296-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Gu, Q.Q., Li, Z.H. and Han, J.W. (2011) Linear Discriminant Dimensionality Reduction. Machine Learning and Knowledge Discovery in Databases, 6911, 549-564.</mixed-citation></ref><ref id="scirp.67296-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Seeger, M. and Bouchard, G. (2012) Fast Variational Bayesian Inference for Non-Conjugate Matrix Factorization Models. Proceedings of the 15th International Conference on Artificial Intelligence and Statistics (AISTATS), La Palma, Canary Islands, 15 February 2012, 1012-1016.</mixed-citation></ref><ref id="scirp.67296-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Harikumar, R. and Sunil Kumar, P. (2015) Classifiers for the Epilepsy Risk Level Classification from Electroencephalographic Signals. Research Journal of Pharmaceutical, Biological and Chemical Sciences, 6, 469.</mixed-citation></ref><ref id="scirp.67296-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Sumit, et al. (2011) Cascade and Feedforward BPN Neural Network Models for Prediction of Sensory Quality of Instant Coffee Flavoured Sterilized Drink. Canadian Journal on Artificial Intelligence, Machine Learning and Pattern Recognition, 2, No. 6.</mixed-citation></ref><ref id="scirp.67296-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Shaikh, et al. (2010) Generalized Regression Neural Network and RBF for Heart Rate Diagnosis. IJCA Journal, 7, No. 13.</mixed-citation></ref><ref id="scirp.67296-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Lang, K.J., et al. (1990) A Time-Delay Neural Network Architecture for Isolated Word Recognition. Neural Networks, 3, 23-43.</mixed-citation></ref><ref id="scirp.67296-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Harikumar, R., Vijayakumar, T. and Sreejith, M.G. (2012) Performance Analysis of Morphological Operators Based Feature Extraction and SVD, Neural Networks as Post Classifier for the Classification of Epilepsy Risk Levels. Proceedings of the Fourth International Conference on Signal and Image Processing 2012, Coimbatore, 13-15 December, 1-12.</mixed-citation></ref></ref-list></back></article>