Gravitation field algorithm and its application in gene cluster

BackgroundSearching optima is one of the most challenging tasks in clustering genes from available experimental data or given functions. SA, GA, PSO and other similar efficient global optimization methods are used by biotechnologists. All these algorithms are based on the imitation of natural phenomena.ResultsThis paper proposes a novel searching optimization algorithm called Gravitation Field Algorithm (GFA) which is derived from the famous astronomy theory Solar Nebular Disk Model (SNDM) of planetary formation. GFA simulates the Gravitation field and outperforms GA and SA in some multimodal functions optimization problem. And GFA also can be used in the forms of unimodal functions. GFA clusters the dataset well from the Gene Expression Omnibus.ConclusionsThe mathematical proof demonstrates that GFA could be convergent in the global optimum by probability 1 in three conditions for one independent variable mass functions. In addition to these results, the fundamental optimization concept in this paper is used to analyze how SA and GA affect the global search and the inherent defects in SA and GA. Some results and source code (in Matlab) are publicly available at http://ccst.jlu.edu.cn/CSBG/GFA.

[1]  W. Cody,et al.  Rational Chebyshev approximations for the error function , 1969 .

[2]  V. Safronov,et al.  Evolution of the protoplanetary cloud and formation of the earth and the planets , 1972 .

[3]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[5]  Chrisila C. Pettey,et al.  A Theoretical Investigation of a Parallel Genetic Algorithm , 1989, ICGA.

[6]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[7]  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.

[8]  Patrik D'haeseleer,et al.  Genetic network inference: from co-expression clustering to reverse engineering , 2000, Bioinform..

[9]  Bor-Sen Chen,et al.  Dynamic modeling of cis-regulatory circuits and gene expression prediction via cross-gene identification , 2005, BMC Bioinformatics.

[10]  Gisbert Schneider,et al.  Optimized Particle Swarm Optimization (OPSO) and its application to artificial neural network training , 2006, BMC Bioinformatics.

[11]  Shuba Gopal,et al.  Correction: genetic algorithm learning as a robust approach to RNA editing site site prediction , 2006, BMC Bioinformatics.

[12]  Hua Yang,et al.  Searching for interpretable rules for disease mutations: a simulated annealing bump hunting strategy , 2006, BMC Bioinformatics.

[13]  Paul T. Spellman,et al.  A simple spreadsheet-based, MIAME-supportive format for microarray data: MAGE-TAB , 2006, BMC Bioinformatics.

[14]  Francesco Pappalardo,et al.  Discovery of cancer vaccination protocols with a genetic algorithm driving an agent based simulator , 2006, BMC Bioinformatics.

[15]  George E. Karniadakis,et al.  A sharp error estimate for the fast Gauss transform , 2006, J. Comput. Phys..

[16]  Fang-Xiang Wu,et al.  Genetic weighted k-means algorithm for clustering large-scale gene expression data , 2008, BMC Bioinformatics.

[17]  Guixia Liu,et al.  Measuring the Similarity of Co-Regulated Genes by Integrating Quantity and Tendency of Gene Expression Changing , 2008, 2008 2nd International Conference on Bioinformatics and Biomedical Engineering.

[18]  J. Rao,et al.  Jackknife estimation of mean squared error of small area predictors in nonlinear mixed models , 2009 .

[19]  Philippe Castagliola,et al.  Computational Statistics and Data Analysis an Ewma Chart for Monitoring the Process Standard Deviation When Parameters Are Estimated , 2022 .