Feature selection through Dynamic Mesh Optimization

9Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper introduces the Dynamic Mesh Optimization meta-heuristic, which falls under the evolutionary computation techniques. Moreover, we outline its application to the feature selection problem. A set of nodes representing subsets of features makes up a mesh which dynamically grows and moves across the search space. The novel methodology is compared with other existing meta-heuristic approaches, thus leading to encouraging empirical results. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bello, R., Puris, A., Falcón, R., & Gómez, Y. (2008). Feature selection through Dynamic Mesh Optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5197 LNCS, pp. 348–355). https://doi.org/10.1007/978-3-540-85920-8_43

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