Advances in metaheuristics for gene selection and classification of microarray data.
Gene selection aims at identifying a (small) subset of informative genes from the initial data in order to obtain high predictive accuracy for classification. Gene selection can be considered as a combinatorial search problem and thus be conveniently handled with optimization methods. In this article, we summarize some recent developments of using metaheuristic-based methods within an embedded approach for gene selection. In particular, we put forward the importance and usefulness of integrating problem-specific knowledge into the search operators of such a method. To illustrate the point, we explain how ranking coefficients of a linear classifier such as support vector machine (SVM) can be profitably used to reinforce the search efficiency of Local Search and Evolutionary Search metaheuristic algorithms for gene selection and classification.
Duval
Béatrice
B
University of Angers, 2 Boulevard Lavoisier, 49045 Angers Cedex 01, France.
Hao
Jin-Kao
JK
D000465:Algorithms; D005796:Genes; D020411:Oligonucleotide Array Sequence Analysis