Parallelization of a Modified Firefly Algorithm using GPU for Variable Selection in a Multivariate Calibration Problem

2014 ◽  
Vol 4 (1) ◽  
pp. 31-42 ◽  
Author(s):  
Lauro C. M. de Paula ◽  
Anderson S. Soares ◽  
Telma W. L. Soares ◽  
Alexandre C. B. Delbem ◽  
Clarimar J. Coelho ◽  
...  

The recent improvements of Graphics Processing Units (GPU) have provided to the bio-inspired algorithms a powerful processing platform. Indeed, a lot of highly parallelizable problems can be significantly accelerated using GPU architecture. Among these algorithms, the Firefly Algorithm (FA) is a newly proposed method with potential application in several real world problems such as variable selection problem in multivariate calibration. The main drawback of this task lies in its computation burden, as it grows polynomially with the number of variables available. In this context, this paper proposes a GPU-based FA for variable selection in a multivariate calibration problem. Such implementation is aimed at improving the computational efficiency of the algorithm. For this purpose, a new strategy of regression coefficients calculation is employed. The advantage of the proposed implementation is demonstrated in an example involving a large number of variables. In such example, gains of speedup were obtained. Additionally the authors also demonstrate that the FA, in comparison with traditional algorithms, can be a relevant contribution for the variable selection problem.

2019 ◽  
Vol 144 (2) ◽  
pp. 625-646 ◽  
Author(s):  
Erdem Yörük ◽  
İbrahim Öker ◽  
Kerem Yıldırım ◽  
Burcu Yakut-Çakar

2017 ◽  
Vol 13 (11) ◽  
pp. 659-666
Author(s):  
Lauro Cassio Martins de Paula ◽  
Anderson da Silva Soares ◽  
Telma Woerle Soares ◽  
Anselmo Elcana Pereira ◽  
Clarimar José Coelho

2018 ◽  
Author(s):  
Colleen Molloy Farrelly

Paper overviews variable selection problem in high dimensionality, particularly focused on genetic psychiatry and genetic epidemiology in general. Genetic and quantum evolutionary algorithms, tree-based classification/regression models, random forest, and other approaches are detailed. Paper concludes with a roadmap for new algorithm and two-stage selection methodology.


DYNA ◽  
2018 ◽  
Vol 85 (204) ◽  
pp. 108-116 ◽  
Author(s):  
Pablo Javier Vidal ◽  
Ana Carolina Olivera

El problema de ensamblado de fragmentos de cadenas de ácido desoxirribonucleico (Deoxyribonucleic Acid Fragment Assembly Problem, DNA-FAP) consiste en la reconstrucción de cadenas de ADN desde un conjunto de fragmentos tomados aleatoriamente. El DNA-FAP ha sido resuelto por diferentes autores utilizando distintos enfoques. Aunque se obtienen buenos resultados, el tiempo computacional asociado es alto. El algoritmo de luciérnaga (Firefly Algorithm, FA) es un modelo bioinspirado basado en el comportamiento de las luciérnagas. Al ser un algoritmo bioinspirado poblacional es posible generar un modelo paralelo del mismo sobre Unidades de Procesamiento Gráfico (Graphics Processing Units, GPU). En este trabajo un algoritmo de luciérnaga es diseñado especialmente para ser ejecutado sobre una arquitectura GPU de manera tal de acelerar el proceso computacional buscando resolver el DNA-FAP. A través de diferentes experimentos se demuestra la eficiencia computacional y la calidad de los resultados obtenidos.


Sign in / Sign up

Export Citation Format

Share Document