Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao https://doi.org/10.1...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
https://doi.org/10.1109/cec458...
Article . 2021 . Peer-reviewed
License: STM Policy #29
Data sources: Crossref
versions View all 1 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Parallel Evolutionary Algorithm for EEG Optimization Problems

Authors: Mohamed A. Meselhi; Saber M. Elsayed; Ruhul A. Sarker; Daryl L. Essam;

Parallel Evolutionary Algorithm for EEG Optimization Problems

Abstract

Big data optimization has become an important research topic in many disciplines. These optimization problems involve a large volume of data, from different sources, in different formats, that are generated at a high speed. For example, in the healthcare sector, electroencephalography (EEG), which is a method for monitoring brain signals and typically used to diagnose neurological disorders, generates a large amount of data which, however, is often captured with artifacts added from non-brain sources. Evolutionary algorithms are considered one of the most successful approaches for solving many such complex optimization problems. In this paper, a differential evolution algorithm is developed to remove artifacts from EEG signals of interest, by using the parallel computing ability of a Graphics Processing Unit. Two levels of parallelization, variable and individual, are implemented, with a gradient-based local search and adaptive control parameters incorporated in order to enhance a search’s convergence. The proposed algorithm is tested using six single objective problems from the 2015 big data optimization competition problems with 1024, 3072 and 4864 decision variables, as both noise-free and with white noise. The results presented in this paper indicate that the proposed algorithm is capable of achieving high-quality solutions, and is up to 374.7 faster than the state-of-the-art algorithms.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    3
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
3
Top 10%
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!