Comprehensive Analysis of Swarm Based Classifiers and Bayesian Based Models for Epilepsy Risk Level Classification from EEG Signals

Rajaguru, Harikumar, Prabhakar, Sunil Kumar

ISBN 10: 3960671229 / ISBN 13: 9783960671220

Verlag: Anchor Academic Publishing, 2017

Beschreibung

New.

Bestandsnummer des Verkäufers ERICA80039606712296

Bibliografische Details

• Titel: Comprehensive Analysis of Swarm Based Classifiers and Bayesian Based Models for Epilepsy Risk Level Classification from EEG Signals
• Verlag: Anchor Academic Publishing
• Erscheinungsjahr: 2017
• Sprache: Englisch
• ISBN-10: 3960671229
• ISBN-13: 9783960671220
• Einband: paperback
• Zustand: New
• Buchtyp: book

Über diesen Titel

Inhaltsangabe

This project presents the performance analysis of Particle swarm optimization (PSO), hybrid PSO and Bayesian classifier to calculate the epileptic risk level from electroencephalogram (EEG) inputs. PSO is an optimization technique which is initialized with a population of random solutions and searches for optima by updating generations. PSO is initialized with a group of random particles (solutions) and then searches for optima by updating generations. Hybrid PSO differs from ordinary PSO by calculating inertia weight to avoid the local minima problem. Bayesian classifier works on the principle of Bayes' rule in which it is the probability based theorem.
The results of PSO, hybrid PSO and Bayesian classifier are calculated and their performance is analyzed using performance index, quality value, cost function and classification rate in calculating the epileptic risk level from EEG.

Auszug. © Genehmigter Nachdruck. Alle Rechte vorbehalten.

Text Sample:
CHAPTER 3. PSO AND BAYESIAN CLASSIFIER AS POST CLASSIFIER FOR CLASSIFICATION OF EPILEPSY RISK LEVEL:
3.1 INTRODUCTION:
Classification plays a vital role in signal processing, for classification of classifiers are used, here we are using particle swarm optimization, hybrid particle swarm optimization and Bayesian classifier for classification of epileptic risk level from EEG. The objective of multi-models is that, to find a better solution without trapping in local minimums models, to achieve faster convergence rate and better efficiency.
3.2 PARTICLE SWARM OPTIMIZATION:
Particle swarm optimization (PSO) is a population based stochastic optimization technique developed by Dr. Eberhart and Dr. Kennedy in 1995, inspired by social behavior of bird flocking or fish schooling. PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. Acceleration is weighted by a random term, with separate random numbers being generated for acceleration toward pbest and lbest locations.
In past several years, PSO has been successfully applied in many research and application areas. It is demonstrated that PSO gets better results in a faster, cheaper way compared with other methods. Another reason that PSO is attractive is that there are few parameters to adjust. One version, with slight variations, works well in a wide variety of applications. Particle swarm optimization has been used for approaches that can be used across a wide range of applications, as well as for specific applications focused on a specific requirement. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. The detailed information will be given in following. Compared to GA, the advantages of PSO are that PSO is easy to implement and there are few parameters to adjust. PSO has been successfully applied in many areas: function optimization, artificial neural network training, fuzzy system control, and other areas where GA can be applied.
As stated before, PSO simulates the behaviors of bird flocking. Suppose the following scenario: a group of birds are randomly searching food in an area. There is only one piece of food in the area being searched. All the birds do not know where the food is. But they know how far the food is in each iteration. So what's the best strategy to find the food? The effective one is to follow the bird which is nearest to the food. PSO learned from the scenario and used it to solve the optimization problems. In PSO, each single solution is a "bird" in the search space. We call it "particle". All of particles have fitness values which are evaluated by the fitness function to be optimized, and have velocities which direct the flying of the particles. The particles fly through the problem space by following the current optimum particles. PSO is initialized with a group of random particles (solutions) and then searches for optima by updating generations. In each iteration, each particle is updated by following two "best" values. The first one is the best solution (fitness) it has achieved so far. (The fitness value is also stored.) This value is called pbest. Another "best" value that is tracked by the particle swarm optimizer is the best value, obtained so far by any particle in the population. This best value is a global best and called gbest. When a particle takes part of the population as its topological neighbors, the best value is a local best and is called lbest. [...].
3.2.1 PSO PARAMETER CONTROL:
From the above case, we can learn that there are two key steps when applying PSO to optimization problems: the representation of the solution and the fitness function. One of the advantages of PSO is that PSO take real numbers as pa