Improved Gravitation Field Algorithm and Its Application in Hierarchical Clustering

Background Gravitation field algorithm (GFA) is a new optimization algorithm which is based on an imitation of natural phenomena. GFA can do well both for searching global minimum and multi-minima in computational biology. But GFA needs to be improved for increasing efficiency, and modified for applying to some discrete data problems in system biology. Method An improved GFA called IGFA was proposed in this paper. Two parts were improved in IGFA. The first one is the rule of random division, which is a reasonable strategy and makes running time shorter. The other one is rotation factor, which can improve the accuracy of IGFA. And to apply IGFA to the hierarchical clustering, the initial part and the movement operator were modified. Results Two kinds of experiments were used to test IGFA. And IGFA was applied to hierarchical clustering. The global minimum experiment was used with IGFA, GFA, GA (genetic algorithm) and SA (simulated annealing). Multi-minima experiment was used with IGFA and GFA. The two experiments results were compared with each other and proved the efficiency of IGFA. IGFA is better than GFA both in accuracy and running time. For the hierarchical clustering, IGFA is used to optimize the smallest distance of genes pairs, and the results were compared with GA and SA, singular-linkage clustering, UPGMA. The efficiency of IGFA is proved.

[1]  Hiroshi Kurata,et al.  Majorization for the eigenvalues of Euclidean distance matrices , 2012 .

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

[3]  Mert Gürbüzbalaban,et al.  On Nesterov's Nonsmooth Chebyshev-Rosenbrock Functions , 2012 .

[4]  Zheng Ming.  A Novel Scale-free Network Construction Method and Its Application in Gene Expression Profiles Simulation , 2012 .

[5]  You Zhou,et al.  A Novel Scale-free Network Construction Method and Its Application in Gene Expression Profiles Simulation*: A Novel Scale-free Network Construction Method and Its Application in Gene Expression Profiles Simulation* , 2012 .

[6]  Xia Li,et al.  A robust approach based on Weibull distribution for clustering gene expression data , 2011, Algorithms for Molecular Biology.

[7]  Frank Emmert-Streib,et al.  Bagging Statistical Network Inference from Large-Scale Gene Expression Data , 2012, PloS one.

[8]  Alok J. Saldanha,et al.  Java Treeview - extensible visualization of microarray data , 2004, Bioinform..

[9]  Markus E. Nebel,et al.  Random generation of RNA secondary structures according to native distributions , 2011, Algorithms for Molecular Biology.

[10]  Jian-Zhang Chen,et al.  Multi-layer thermoelectric-temperature-mapping microbial incubator designed for geo-biochemistry applications. , 2012, The Review of scientific instruments.

[11]  Xiuwei Zhang,et al.  Refining transcriptional regulatory networks using network evolutionary models and gene histories , 2010, Algorithms for Molecular Biology.

[12]  Ronald J. M. M. Does,et al.  A Robust Standard Deviation Control Chart , 2012, Technometrics.

[13]  Fariborz Jolai,et al.  Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration , 2012, Adv. Eng. Softw..

[14]  Li-Yeh Chuang,et al.  Particle Swarm Optimization with Reinforcement Learning for the Prediction of CpG Islands in the Human Genome , 2011, PloS one.

[15]  Hamid Soltanian-Zadeh,et al.  Improved particle swarm optimization and applications to Hidden Markov Model and Ackley function , 2011, 2011 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications (CIMSA) Proceedings.

[16]  Idris Ören,et al.  Invariant parametrizations and complete systems of global invariants of curves in the pseudo-Euclidean geometry , 2012, Turkish Journal of Mathematics.

[17]  L. Darrell Whitley,et al.  Alternative implementations of the Griewangk function , 2005, GECCO '05.

[18]  Pedro Isasi Viñuela,et al.  Interactive Evolutionary Computation algorithms applied to solve Rastrigin test functions , 2005, WSTST.

[19]  Nazar Zaki,et al.  A Combination of Compositional Index and Genetic Algorithm for Predicting Transmembrane Helical Segments , 2011, PloS one.

[20]  José M. Soler,et al.  Optimal Fourier filtering of a function that is strictly confined within a sphere , 2008, Comput. Phys. Commun..

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

[22]  S. Raffaele,et al.  Using Hierarchical Clustering of Secreted Protein Families to Classify and Rank Candidate Effectors of Rust Fungi , 2012, PloS one.

[23]  Yanchun Liang,et al.  Gravitation field algorithm and its application in gene cluster , 2010, Algorithms for Molecular Biology.

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

[25]  Thomas Schiex,et al.  Gene Regulatory Network Reconstruction Using Bayesian Networks, the Dantzig Selector, the Lasso and Their Meta-Analysis , 2011, PloS one.

[26]  Shlomo Moran,et al.  Optimal implementations of UPGMA and other common clustering algorithms , 2007, Inf. Process. Lett..

[27]  Fumihiro Ashida,et al.  Kriging-based convex subspace single linkage method with path-based clustering technique for approximation-based global optimization , 2011 .

[28]  Nikos Tzavidis,et al.  Non-parametric bootstrap mean squared error estimation for M-quantile estimators of small area averages, quantiles and poverty indicators , 2012, Comput. Stat. Data Anal..