Abstract
In this paper, a new class of Evolutionary Algorithm (EA) named as Genetic Folding (GF) is introduced. GF is based on novel chromosomes organisation which is structured in a parent form. In this paper, the model selection problem of Support Vector Machine (SVM) kernel expression has been utilised as a case study. Five UCI datasets have been tested and experimental results are compared with other methods. As a conclusion, the proposed algorithm is very promising and it can be applied to solve further complicated domains and problems. © 2011 Springer-Verlag London Limited.
Cite
CITATION STYLE
Mezher, M. A., & Abbod, M. F. (2011). Genetic folding: A new class of evolutionary algorithms. In Res. and Dev. in Intelligent Syst. XXVII: Incorporating Applications and Innovations in Intel. Sys. XVIII - AI 2010, 30th SGAI Int. Conf. on Innovative Techniques and Applications of Artificial Intel. (pp. 279–284). Springer London. https://doi.org/10.1007/978-0-85729-130-1_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
