Feature selection via genetic optimization

31Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we present a novel Genetic Algorithm (GA) for feature selection in machine learning problems. We introduce a novel genetic operator which fixes the number of selected features. This operator, we will refer to it as m-features operator, reduces the size of the search space and improves the GA performance and convergence. Simulations on synthetic and real problems have shown very good performance of the m-features operator, improving the performance of other existing approaches over the feature selection problem. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Salcedo-Sanz, S., Prado-Cumplido, M., Pérez-Cruz, F., & Bousõno-Calzón, C. (2002). Feature selection via genetic optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2415 LNCS, pp. 547–552). Springer Verlag. https://doi.org/10.1007/3-540-46084-5_89

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free