1. Elements of the Genetic Algorithm  Genome: A finite dynamical system model as a set of d polynomials over  2 (finite field of 2 elements)  Fitness.

Slides:



Advertisements
Similar presentations
Stochastic algebraic models SAMSI Transition Workshop June 18, 2009 Reinhard Laubenbacher Virginia Bioinformatics Institute and Mathematics Department.
Advertisements

Ali Husseinzadeh Kashan Spring 2010
Polynomial dynamical systems over finite fields, with applications to modeling and simulation of biological networks. IMA Workshop on Applications of.
A Mathematical Formalism for Agent- Based Modeling 22 nd Mini-Conference on Discrete Mathematics and Algorithms Clemson University October 11, 2007 Reinhard.
Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
Tetris and Genetic Algorithms Math Club 5/30/2011.
Algorithms + L. Grewe.
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
Graphs Graphs are the most general data structures we will study in this course. A graph is a more general version of connected nodes than the tree. Both.
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Data Mining Techniques Outline
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Supervised classification performance (prediction) assessment Dr. Huiru Zheng Dr. Franscisco Azuaje School of Computing and Mathematics Faculty of Engineering.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Evolutionary Computational Intelligence Lecture 8: Memetic Algorithms Ferrante Neri University of Jyväskylä.
Selecting Informative Genes with Parallel Genetic Algorithms Deodatta Bhoite Prashant Jain.
Discrete models of biochemical networks Algebraic Biology 2007 RISC Linz, Austria July 3, 2007 Reinhard Laubenbacher Virginia Bioinformatics Institute.
Geometric Approaches to Reconstructing Times Series Project Outline 15 February 2007 CSC/Math 870 Computational Discrete Geometry Connie Phong.
Laurent Itti: CS599 – Computational Architectures in Biological Vision, USC Lecture 7: Coding and Representation 1 Computational Architectures in.
1 Efficient Discovery of Conserved Patterns Using a Pattern Graph Inge Jonassen Pattern Discovery Arwa Zabian 13/07/2015.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery in Unstructured P2P Networks Distributed Systems Research Seminar on Mikko Vapa, research student.
Unsupervised Rough Set Classification Using GAs Reporter: Yanan Yean.
國立陽明大學生資學程 陳虹瑋. Genetic Algorithm Background Fitness function ……. population selection Cross over mutation Fitness values Random cross over.
Bayes Net Perspectives on Causation and Causal Inference
Genetic Algorithm.
Efficient Model Selection for Support Vector Machines
On comparison of different approaches to the stability radius calculation Olga Karelkina Department of Mathematics University of Turku MCDM 2011.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
A Clustering Algorithm based on Graph Connectivity Balakrishna Thiagarajan Computer Science and Engineering State University of New York at Buffalo.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Abstract Background: In this work, a candidate gene prioritization method is described, and based on protein-protein interaction network (PPIN) analysis.
1/27 Discrete and Genetic Algorithms in Bioinformatics 許聞廉 中央研究院資訊所.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Supplementary Figure S1 eQTL prior model modified from previous approaches to Bayesian gene regulatory network modeling. Detailed description is provided.
Clustering Metabolic Networks Using Minimum Cut Trees Ryan Kellogg 1, Allison Heath 2, Lydia Kavraki 2,3 1 Carnegie Mellon University, Department of Electrical.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
Learning the Structure of Related Tasks Presented by Lihan He Machine Learning Reading Group Duke University 02/03/2006 A. Niculescu-Mizil, R. Caruana.
ELeaRNT: Evolutionary Learning of Rich Neural Network Topologies Authors: Slobodan Miletic 3078/2010 Nikola Jovanovic 3077/2010
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
Yen-Ting Yu Iris Hui-Ru Jiang Yumin Zhang Charles Chiang DRC-Based Hotspot Detection Considering Edge Tolerance and Incomplete Specification ICCAD’14.
Coevolutionary Automated Software Correction Josh Wilkerson PhD Candidate in Computer Science Missouri S&T.
Alice E. Smith and Mehmet Gulsen Department of Industrial Engineering
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Network Partition –Finding modules of the network. Graph Clustering –Partition graphs according to the connectivity. –Nodes within a cluster is highly.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
CSE280Stefano/Hossein Project: Primer design for cancer genomics.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Evolutionary Computation Evolving Neural Network Topologies.
Evolutionary Technique for Combinatorial Reverse Auctions
Results for all features Results for the reduced set of features
○ Hisashi Shimosaka (Doshisha University)
Methods and Materials (cont.)
Boltzmann Machine (BM) (§6.4)
Presentation transcript:

1. Elements of the Genetic Algorithm  Genome: A finite dynamical system model as a set of d polynomials over  2 (finite field of 2 elements)  Fitness function: Hamming distance between time series generated by the model and the input time series along with a measure of model complexity  Mutated Initial States: Improve robustness of estimated model  Mutation: Addition or removal of one variable from one monomial  Crossover: Creation of a Polynomial as mixture of subsets of the monomials from two parent models. An Optimization Algorithm for the Identification of Biochemical Network Models M. Paola Vera-Licona, Luis David Garcia, M. Paola Vera-Licona, Luis David Garcia, John McGee, Miguel Colon-Velez and Reinhard Laubenbacher An important problem in computational biology is the modeling of several types of networks, ranging from gene regulatory networks and metabolic networks to neural response networks. In [LS], Laubenbacher and Stigler presented an algorithm that takes as input time series of system measurements, including certain perturbation time series, and provides as output a discrete dynamical system over a finite field. Since functions over finite fields can always be represented by polynomial functions, one can use tools from computational algebra for this purpose. The key step in the algorithm is an interpolation step, which leads to a model that fits the given data set exactly. Due to the fact that biological data sets tend to contain noise, the algorithm leads to over-fitting. Here we present a genetic algorithm, that optimizes the model produced by the Laubenbacher-Stigler algorithm between model complexity and data fit. This algorithm (implemented in C++), uses tools from computational algebra in order to provide a computationally simple description of the mutation rules. INTRODUCTION GENETIC ALGORITHM 3. Parameters of Genetic Algorithm In order to control the evolutionary search for a satisfactory solution model, our genetic algorithm uses 12 parameters (e.g. population size, mutation rate, crossover rate, etc). The tuning of this set of parameters is one main feature in the early stage of this project. DISCRETE POLYNOMIALMODELS DISCRETE POLYNOMIAL MODELS 3. Effectiveness of Fitness Score We used empirical measurements to verify that if an estimated model is close to the true model, then the time series produced by the estimated model will have a small Hamming distance from that produced by the true model from the same initial state. Figure 1 plots h for the values of d up to 30, where d is the number of mutations between two models, and h is the average Hamming distance between time series produced by the two models. A discrete polynomial model is a vector function f = (f 1,…,f n ) :  n   n where  is a finite field and f i :  n  , are local update polynomials for each node i = 1,…,n. The phase space of a polynomial model, is given by the directed graph, where: vertices := states of system Edge from v j to v k iff f(v j )=v k Therefore a time series is represented as a path in this graph. Example of a model and phase space graph f = (f 1, f 2 ) : {1,0,} 2  {1,0} 2 f 1 = x 1 + x 2 f 2 = x Figure 1 4. Computational Algebra Tools We formulated an upper bound for the number of variables in every monomial, given the input time series samples. This formulation is based on the maximum support of a monomial member of any Gröbner basis of the ideal that vanishes on a time series t, which greatly restricts the genetic algorithm search space, improving the efficiency of the optimization. Testing and Tuning We employed an 8-variable model to generate time series and perturbed data, as input into the Laubenbacher-Stigler method and/or directly as input into the genetic algorithm. The performance of the G.A. is significantly improved when the model from L-S was used as input in the G.A. f 1 = x 1 + x 2 f 2 = x 2 + x 3 x 5 f 3 = x 3 + x 4 x 6 f 4 = x 4 + x 8 f 5 = x 5 + x 3 f 6 = x 6 f 7 = x 7 f 8 = x 8 + x 1 Figure 2. On the left, model used. On the right, Topology of the model used. In black is the intersection of the graphs produced by the original model, L-S model and that obtained from the genetic algorithm. In red are the extra links that the last two share and finally, the purple link is the extra link that L-S model has and that the genetic algorithm was able to delete APPLICATIONS Network of the Segment Polarity Genes in the Fruit Fly D. Melanogaster This network consists of the genes whose function is to define the segment boundaries and polarity in the D. melanogaster embryo. Each one of the four cells in the network consists of 5 genes and the products encoded by them, as well as two protein compounds and 6 more elements from neighbor cells. We perform a series of experiments on the 21-variable model obtained in [LS], adjusting our method by applying the genetic algorithm twice. Label of Parameter Set Corrected links Loops deleted Table 1. Considering [AO] model (21 nodes and 44 links), we compare our results with [LS]. The second column refers to the number of excessive links in [LS] topology that the G.A. corrected and the second column represents the number of loops that the G.A. deleted. en Hh Wg Hh Wg REFERENCES [LS] R. Laubenbacher and B. Stigler, A Computational Algebra Approach to the Reverse Engineering of Gene Regulatory Networks [BO] E. Babson, S. Onn. The Hilbert Zonotope and a Polynomial Time Algorithm for Universal Grobner Bases [HC] Hochmuth Gregor, On the Genetic Evolution of a Perfect Tic-Tac- Toe Strategy [AO] R. Albert and H. Othmer. The Topology of the Regulatory Interactions Predicts the Expression Pattern of the Segment Polarity Genes in Drosophila melanogaster. 2. Input Data Time Series: A set of discrete time series over  2, with different initial states Knockout Data: Perturbed data from the knockout of some or all of the entities in the network Candidate Model: Obtained by applying L-S algorithm to the available data. FINAL COMMENTS 1.Initial results indicate that our Genetic Algorithm approach to either discovery or refinement of a dynamical system model can be an effective element of a robust system for genetic network identification. 2. An extension of this algorithm for more general finite fields is being performed as part of a second phase of this project.