An Advanced Nelder Mead Simplex Method for Clustering of Gene Expression Data

The DNA microarray technology concurrently monitors the expression levels of thousands of genes during significant biological processes and across the related samples. The better understanding of functional genomics is obtained by extracting the patterns hidden in gene expression data. It is handled by clustering which reveals natural structures and identify interesting patterns in the underlying data. In the proposed work clustering gene expression data is done through an Advanced Nelder Mead (ANM) algorithm. Nelder Mead (NM) method is a method designed for optimization process. In Nelder Mead method, the vertices of a triangle are considered as the solutions. Many operations are performed on this triangle to obtain a better result. In the proposed work, the operations like reflection and expansion is eliminated and a new operation called spread-out is introduced. The spread-out operation will increase the global search area and thus provides a better result on optimization. The spread-out operation will give three points and the best among these three points will be used to replace the worst point. The experiment results are analyzed with optimization benchmark test functions and gene expression benchmark datasets. The results show that ANM outperforms NM in both benchmarks. Keywords—Spread out, simplex, multi-minima, fitness function, optimization, search area, monocyte, solution, genomes.

[1]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[2]  Jugal K. Kalita,et al.  Gene expression data clustering analysis: A survey , 2011, 2011 2nd National Conference on Emerging Trends and Applications in Computer Science.

[3]  J JacinthSalome,et al.  Efficient Clustering for Gene Expression Data , 2012 .

[4]  Jarka Glassey,et al.  A novel methodology for finding the regulation on gene expression data , 2009 .

[5]  Erwie Zahara,et al.  Hybrid Nelder-Mead simplex search and particle swarm optimization for constrained engineering design problems , 2009, Expert Syst. Appl..

[6]  U. Alon,et al.  Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Fazel Famili,et al.  Evaluation and optimization of clustering in gene expression data analysis , 2004, Bioinform..

[8]  A. M. Natarajan,et al.  Comparative Study on Swarm Intelligence Techniques for Biclustering of Microarray Gene Expression Data , 2014 .

[9]  Paul Tseng,et al.  Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search , 2002, Comput. Optim. Appl..

[10]  Toshimitsu Hamasaki,et al.  Evaluation of Clustering Based on Preprocessing in Gene Expression Data , 2007 .

[11]  Ricardo J. G. B. Campello,et al.  Comparing Correlation Coefficients as Dissimilarity Measures for Cancer Classification in Gene Expression Data , 2011 .

[12]  Patrick Siarry,et al.  A hybrid method combining continuous tabu search and Nelder-Mead simplex algorithms for the global optimization of multiminima functions , 2005, Eur. J. Oper. Res..

[13]  Mu Zhu,et al.  A factor analysis model for functional genomics , 2005, BMC Bioinformatics.

[14]  Vito Di Gesù,et al.  GenClust: A genetic algorithm for clustering gene expression data , 2005, BMC Bioinformatics.

[15]  Rui Xu,et al.  Clustering Algorithms in Biomedical Research: A Review , 2010, IEEE Reviews in Biomedical Engineering.

[16]  Heather J. Ruskin,et al.  Techniques for clustering gene expression data , 2008, Comput. Biol. Medicine.

[17]  J. Alliot,et al.  A combined nelder-mead simplex and genetic algorithm , 1999 .

[18]  G. R. Hext,et al.  Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation , 1962 .

[19]  Zhen Ji,et al.  PK-means: A new algorithm for gene clustering , 2008, Comput. Biol. Chem..

[20]  Chris H. Q. Ding,et al.  Analysis of gene expression profiles: class discovery and leaf ordering , 2002, RECOMB '02.

[21]  Xin Yao,et al.  An evolutionary clustering algorithm for gene expression microarray data analysis , 2006, IEEE Transactions on Evolutionary Computation.

[22]  Lixing Han,et al.  Implementing the Nelder-Mead simplex algorithm with adaptive parameters , 2010, Computational Optimization and Applications.

[23]  Marco Antonio Luersen,et al.  Globalized Nelder-Mead method for engineering optimization , 2002 .

[24]  R. Krovi,et al.  Genetic algorithms for clustering: a preliminary investigation , 1992, Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences.

[25]  Michael Ruogu Zhang,et al.  Comprehensive identification of cell cycle-regulated genes of the yeast Saccharomyces cerevisiae by microarray hybridization. , 1998, Molecular biology of the cell.

[26]  Pascal Nsoh,et al.  Large-scale temporal gene expression mapping of central nervous system development , 2007 .

[27]  Ye Xu,et al.  Parameter identification of chaotic systems by hybrid Nelder-Mead simplex search and differential evolution algorithm , 2011, Expert Syst. Appl..

[28]  Ming-Ta Yang,et al.  A New Hybrid Nelder-Mead Particle Swarm Optimization for Coordination Optimization of Directional Overcurrent Relays , 2012 .