Memetic Algorithms for the Automatic Discovery of Software Architectures

Author(s):  
Aurora Ramírez ◽  
Rafael Barbudo ◽  
José Raúl Romero ◽  
Sebastián Ventura
2014 ◽  
Vol 24 (8) ◽  
pp. 1731-1745 ◽  
Author(s):  
Hui SONG ◽  
Gang HUANG ◽  
Yi-Han WU ◽  
CHAUVEL Franck ◽  
Yan-Chun SUN ◽  
...  

2007 ◽  
Author(s):  
Rick Kazman ◽  
Len Bass ◽  
Gregory Abowd ◽  
Mike Webb

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 506
Author(s):  
Jorge Daniel Mello-Román ◽  
Adolfo Hernández ◽  
Julio César Mello-Román

Kernel partial least squares regression (KPLS) is a non-linear method for predicting one or more dependent variables from a set of predictors, which transforms the original datasets into a feature space where it is possible to generate a linear model and extract orthogonal factors also called components. A difficulty in implementing KPLS regression is determining the number of components and the kernel function parameters that maximize its performance. In this work, a method is proposed to improve the predictive ability of the KPLS regression by means of memetic algorithms. A metaheuristic tuning procedure is carried out to select the number of components and the kernel function parameters that maximize the cumulative predictive squared correlation coefficient, an overall indicator of the predictive ability of KPLS. The proposed methodology led to estimate optimal parameters of the KPLS regression for the improvement of its predictive ability.


Author(s):  
Michael Mayrhofer ◽  
Christoph Mayr-Dorn ◽  
Ouijdane Guiza ◽  
Alexander Egyed

Author(s):  
W.K. Ehrlich ◽  
R. Chan ◽  
W.J. Donnelly ◽  
H.H. Park ◽  
M.B. Saltzman ◽  
...  

2017 ◽  
Vol 60 (9) ◽  
pp. 1363-1381 ◽  
Author(s):  
Lucas Bueno Ruas Oliveira ◽  
Elena Leroux ◽  
Katia Romero Felizardo ◽  
Flavio Oquendo ◽  
Elisa Yumi Nakagawa

Sign in / Sign up

Export Citation Format

Share Document