Application of Optimization Techniques for Gene Expression Data Analysis

The feature selection from gene expression data is the NP hard problem, few of evolutionary techniques give optimal solutions to find feature subsets. In this chapter, authors introduce some evolutionary optimization techniques and proposed a Binary Particle Swarm Optimization (BPSO) based algorithm for feature subset selection. The Feature selection is one of the important and challenging tasks for gene expression data where many traditional methods failed and evolutionary based methods were succeeded. In this study, the initial datasets are preprocessed using a quartile based fast heuristic technique to reduce the crude domain features which are less relevant in categorizing the samples of either group. The experimental results on three bench-mark datasets vis-a-vis colon cancer, defused B-cell lymphoma and leukemia data are evaluated by means of classification accuracies. Detailed comparative studies with some of popular existing algorithms like Genetic Algorithm (GA), Multi Objective GA are also made to show the superiority and effectiveness of the proposed method. Application of Optimization Techniques for Gene Expression Data Analysis

[1]  Martin J. Oates,et al.  The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation , 2000, PPSN.

[2]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[3]  Mohd Saberi Mohamad,et al.  Particle swarm optimization for gene selection in classifying cancer classes , 2009, Artificial Life and Robotics.

[4]  Anirban Mukherjee,et al.  Cancer Classification from Gene Expression Data by NPPC Ensemble , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[5]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[6]  Chenn-Jung Huang,et al.  CLASS PREDICTION OF CANCER USING PROBABILISTIC NEURAL NETWORKS AND RELATIVE CORRELATION METRIC , 2004, Appl. Artif. Intell..

[7]  Sushmita Mitra,et al.  Evolutionary Rough Feature Selection in Gene Expression Data , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[8]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[9]  James Kennedy,et al.  The particle swarm: social adaptation of knowledge , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[10]  Andrew Lim,et al.  Example-based learning particle swarm optimization for continuous optimization , 2012, Information Sciences.

[11]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[12]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[13]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .