Multiobjective optizition shuffled frog-leaping biclustering

Biclustering of DNA microarray data that can mine significant patterns to help in understanding gene regulation and interactions. This is a classical multi-objective optimization problem (MOP). Recently, many researchers have developed stochastic search methods that mimic the efficient behavior of species such as ants, bees, birds and frogs, as a means to seek faster and more robust solutions to complex optimization problems. The particle swarm optimization(PSO) is a heuristics-based optimization approach simulating the movements of a bird flock finding food. The shuffled frog leaping algorithm (SFLA) is a population-based cooperative search metaphor combining the benefits of the local search of PSO and the global shuffled of information of the complex evolution technique. This paper introduces SFL algorithm to solve biclustering of microarray data, and proposes a novel multi-objective shuffled frog leaping biclustering(MOSFLB) algorithm to mine coherent patterns from microarray data. Experimental results on two real datasets show that our approach can effectively find significant biclusters of high quality.

[1]  D. Botstein,et al.  Cluster analysis and display of genome-wide expression patterns. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Jürgen Teich,et al.  Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO) , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[3]  Zhoujun Li,et al.  Multi-objective Particle Swarm Optimization Biclustering of Microarray Data , 2008, 2008 IEEE International Conference on Bioinformatics and Biomedicine.

[4]  Arlindo L. Oliveira,et al.  Biclustering algorithms for biological data analysis: a survey , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[5]  J. Mesirov,et al.  Interpreting patterns of gene expression with self-organizing maps: methods and application to hematopoietic differentiation. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

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

[7]  Kathleen Marchal,et al.  Adaptive quality-based clustering of gene expression profiles , 2002, Bioinform..

[8]  Roded Sharan,et al.  Discovering statistically significant biclusters in gene expression data , 2002, ISMB.

[9]  Ronald W. Davis,et al.  A genome-wide transcriptional analysis of the mitotic cell cycle. , 1998, Molecular cell.

[10]  Maoguo Gong,et al.  Multiobjective optimization using an immunodominance and clonal selection inspired algorithm , 2008, Science in China Series F: Information Sciences.

[11]  Sushmita Mitra,et al.  Multi-objective evolutionary biclustering of gene expression data , 2006, Pattern Recognit..

[12]  Federico Divina,et al.  A multi-objective approach to discover biclusters in microarray data , 2007, GECCO '07.

[13]  Quan-Ke Pan,et al.  An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem , 2011 .

[14]  Philip S. Yu,et al.  /spl delta/-clusters: capturing subspace correlation in a large data set , 2002, Proceedings 18th International Conference on Data Engineering.

[15]  Muzaffar Eusuff,et al.  Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization , 2006 .

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

[17]  Katayoun Madani,et al.  A discrete shuffled frog optimization algorithm , 2011, Artificial Intelligence Review.

[18]  George M. Church,et al.  Biclustering of Expression Data , 2000, ISMB.

[19]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[20]  Ash A. Alizadeh,et al.  Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling , 2000, Nature.

[21]  Kevin E Lansey,et al.  Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm , 2003 .

[22]  Philip S. Yu,et al.  Clustering by pattern similarity in large data sets , 2002, SIGMOD '02.

[23]  Martin Middendorf,et al.  A Population Based Approach for ACO , 2002, EvoWorkshops.

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

[25]  R. K. Ursem Multi-objective Optimization using Evolutionary Algorithms , 2009 .