Improving Memory Accesses for Heterogeneous Parallel Multi-objective Feature Selection on EEG Classification

Bioinformatics applications that analyze large volumes of high-dimensional data and present different implicit parallelism can benefit from the efficient use, in performance terms, of heterogeneous parallel architectures, including accelerators such as graphics processing units (GPUs). This paper aims to take advantage of parallel codes to accelerate electroencephalogram (EEG) classification and feature selection problems in the context of Branch-Computing Interface (BCI) tasks. As the approaches to tackle these applications usually involve optimized codes that implement different types of parallelism, the use of heterogeneous architectures with multicore microprocessors along with GPUs could provide relevant performance improvements after careful code optimizing. More specifically, the memory access patterns have been taken into account to improve the performance of data-parallel GPU kernels.

[1]  Richard Bellman,et al.  Adaptive Control Processes: A Guided Tour , 1961, The Mathematical Gazette.

[2]  Joshua D. Knowles,et al.  Feature subset selection in unsupervised learning via multiobjective optimization , 2006 .

[3]  Pedro Sequeira,et al.  OpenCL Implementations of a Genetic Algorithm for Feature Selection in Periocular Biometric Recognition , 2012, SEMCCO.

[4]  Gernot R. Müller-Putz,et al.  Brain–Computer Interfaces and Assistive Technology , 2014 .

[5]  Enrique Alba,et al.  Parallel metaheuristics: recent advances and new trends , 2012, Int. Trans. Oper. Res..

[6]  Jesús González,et al.  Assessing Parallel Heterogeneous Computer Architectures for Multiobjective Feature Selection on EEG Classification , 2016, IWBBIO.

[7]  Man Leung Wong,et al.  Data Mining Using Parallel Multi-objective Evolutionary Algorithms on Graphics Processing Units , 2013, Massively Parallel Evolutionary Computation on GPGPUs.

[8]  Norman Rubin,et al.  A new method for GPU based irregular reductions and its application to k-means clustering , 2011, GPGPU-4.

[9]  Michael Granitzer,et al.  Accelerating K-Means on the Graphics Processor via CUDA , 2009, 2009 First International Conference on Intensive Applications and Services.

[10]  Olatz Arbelaitz,et al.  An extensive comparative study of cluster validity indices , 2013, Pattern Recognit..

[11]  J. Q. Gan,et al.  Multiresolution analysis over simple graphs for brain computer interfaces , 2013, Journal of neural engineering.

[12]  Pierre Collet Why GPGPUs for Evolutionary Computation? , 2013, Massively Parallel Evolutionary Computation on GPGPUs.

[13]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[14]  Pierre Collet,et al.  Implementation Techniques for Massively Parallel Multi-objective Optimization , 2013, Massively Parallel Evolutionary Computation on GPGPUs.

[15]  Julio Ortega Lopera,et al.  Leveraging cooperation for parallel multi‐objective feature selection in high‐dimensional EEG data , 2015, Concurr. Comput. Pract. Exp..

[16]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[17]  Meichun Hsu,et al.  Clustering billions of data points using GPUs , 2009, UCHPC-MAW '09.

[18]  Ujjwal Maulik,et al.  A Survey of Multiobjective Evolutionary Algorithms for Data Mining: Part I , 2014, IEEE Transactions on Evolutionary Computation.