Memetic Algorithms for Feature Selection on Microarray Data

In this paper, we present two novel memetic algorithms (MAs) for gene selection. Both are synergies of Genetic Algorithm (wrapper methods) and local search methods (filter methods) under a memetic framework. In particular, the first MA is a Wrapper-Filter Feature Selection Algorithm (WFFSA) fine-tunes the population of genetic algorithm (GA) solutions by adding or deleting features based on univariate feature filter ranking method. The second MA approach, Markov Blanket-Embedded Genetic Algorithm (MBEGA), fine-tunes the population of solutions by adding relevant features, removing redundant and/or irrelevant features using Markov blanket. Our empirical studies on synthetic and real world microarray dataset suggest that both memetic approaches select more suitable gene subset than the basic GA and at the same time outperforms GA in terms of classification predictions. While the classification accuracies between WFFSA and MBEGA are not significantly statistically different on most of the datasets considered, MBEGA is observed to converge to more compact gene subsets than WFFSA.

[1]  Zexuan Zhu,et al.  Markov blanket-embedded genetic algorithm for gene selection , 2007, Pattern Recognit..

[2]  Kevin Kok Wai Wong,et al.  Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Zexuan Zhu,et al.  Wrapper–Filter Feature Selection Algorithm Using a Memetic Framework , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[4]  R Kahavi,et al.  Wrapper for feature subset selection , 1997 .

[5]  Ju Li,et al.  A QoS-Tunable Scheme for ATM Cell Scheduling Using Evolutionary Fuzzy System , 2005, Applied Intelligence.

[6]  Yu Yuan,et al.  Extensive Testing of a Hybrid Genetic Algorithm for Solving Quadratic Assignment Problems , 2002, Comput. Optim. Appl..

[7]  Andy J. Keane,et al.  Combining Global and Local Surrogate Models to Accelerate Evolutionary Optimization , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[8]  Bu-Sung Lee,et al.  A Multi-cluster Grid Enabled Evolution Framework for Aerodynamic Airfoil Design Optimization , 2005, ICNC.

[9]  Ron Kohavi,et al.  Wrappers for Feature Subset Selection , 1997, Artif. Intell..

[10]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[11]  Edward R. Dougherty,et al.  Is cross-validation valid for small-sample microarray classification? , 2004, Bioinform..

[12]  James E. Baker,et al.  Adaptive Selection Methods for Genetic Algorithms , 1985, International Conference on Genetic Algorithms.

[13]  Z. Szallasi,et al.  A survey of methods for classification of gene expression data using evolutionary algorithms , 2006, Expert review of molecular diagnostics.

[14]  Huan Liu,et al.  Efficient Feature Selection via Analysis of Relevance and Redundancy , 2004, J. Mach. Learn. Res..

[15]  Bu-Sung Lee,et al.  Efficient Hierarchical Parallel Genetic Algorithms using Grid computing , 2007, Future Gener. Comput. Syst..

[16]  Marko Robnik-Sikonja,et al.  Theoretical and Empirical Analysis of ReliefF and RReliefF , 2003, Machine Learning.

[17]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[18]  Yew-Soon Ong,et al.  A domain knowledge based search advisor for design problem solving environments , 2002 .

[19]  Daphne Koller,et al.  Toward Optimal Feature Selection , 1996, ICML.

[20]  Kai-Yew Lum,et al.  Max-min surrogate-assisted evolutionary algorithm for robust design , 2006, IEEE Transactions on Evolutionary Computation.

[21]  Bu-Sung Lee,et al.  Grid-based PSE for Engineering of Materials (GPEM) , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[22]  Sigeru Omatu,et al.  Efficient Genetic Algorithms Using Simple Genes Exchange Local Search Policy for the Quadratic Assignment Problem , 2000, Comput. Optim. Appl..