Feature subset selection is an important preprocessing and guiding step for classification. The combinatorial nature of the problem have made the use of evolutionary and heuristic methods indispensble for the exploration of high dimensional problem search spaces. In this paper, a set of hybridization schemata of genetic algorithm with local search are investigated through a memetic framework. Empirical study compares and discusses the effectiveness of the proposed local search procedure as well as their components. © 2010 Springer-Verlag.
CITATION STYLE
Esseghir, M. A., Goncalves, G., & Slimani, Y. (2010). Memetic feature selection: Benchmarking hybridization schemata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6076 LNAI, pp. 351–358). https://doi.org/10.1007/978-3-642-13769-3_43
Mendeley helps you to discover research relevant for your work.