Data points are spread over the space according to two of their component values Using real data sets to simulate evolution within complex environments.

Slides:



Advertisements
Similar presentations
Constraint Satisfaction Problems
Advertisements

Generative Design in Civil Engineering Using Cellular Automata Rafal Kicinger June 16, 2006.
1 Automating the Generation of Mutation Tests Mike Papadakis and Nicos Malevris Department of Informatics Athens University of Economics and Business.
Contextual effects In the previous sections we found that when regressing pupil attainment on pupil prior ability schools vary in both intercept and slope.
MCMC estimation in MlwiN
Assumptions underlying regression analysis
On Sequential Experimental Design for Empirical Model-Building under Interval Error Sergei Zhilin, Altai State University, Barnaul, Russia.
Particle Swarm Optimization (PSO)
Interactive Evolutionary Computation Review of Applications Praminda Caleb-Solly Intelligent Computer Systems Centre University of the West of England.
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Capacity Planning For Products and Services
A synthetic noise generator M. Hueller LTPDA meeting, AEI Hannover 27/04/2007.
Dialogue Policy Optimisation
Formal models of design 1/28 Radford, A D and Gero J S (1988). Design by Optimization in Architecture, Building, and Construction, Van Nostrand Reinhold,
Dept of Biomedical Engineering, Medical Informatics Linköpings universitet, Linköping, Sweden A Data Pre-processing Method to Increase.
Simple Linear Regression Analysis
Week 13 November Three Mini-Lectures QMM 510 Fall 2014.
Agent-Based Modeling PSC 120 Jeff Schank. Agent-Based Modeling What Phenomena are Agent-Based Models Good for? What is Agent-Based Modeling (ABM)? What.
Evolving Edge detection Final project by Rubshtein Andrey ( )
Set Based Search Modeling Examples II
Blast to Psi-Blast Blast makes use of Scoring Matrix derived from large number of proteins. What if you want to find homologs based upon a specific gene.
Student : Mateja Saković 3015/2011.  Genetic algorithms are based on evolution and natural selection  Evolution is any change across successive generations.
Using data sets to simulate evolution within complex environments Bruce Edmonds Centre for Policy Modelling Manchester Metropolitan University.
Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
Natural selection Essential Question: What mechanisms have allowed for diversity in organisms?
Statistics 100 Lecture Set 7. Chapters 13 and 14 in this lecture set Please read these, you are responsible for all material Will be doing chapters
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Code and Decoder Design of LDPC Codes for Gbps Systems Jeremy Thorpe Presented to: Microsoft Research
Evolutionary Computational Intelligence
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Unsupervised Learning. CS583, Bing Liu, UIC 2 Supervised learning vs. unsupervised learning Supervised learning: discover patterns in the data that relate.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Genetic Algorithm.
Using localised gossip to structure distributed learning, Bruce Edmonds, Univ. of Herts., April 2005, slide-1 Using Localised.
Learning Structure in Bayes Nets (Typically also learn CPTs here) Given the set of random variables (features), the space of all possible networks.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
Logistic Regression Debapriyo Majumdar Data Mining – Fall 2014 Indian Statistical Institute Kolkata September 1, 2014.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Genetic Algorithms Genetic algorithms imitate a natural optimization process: natural selection in evolution. Developed by John Holland at the University.
Design of an Evolutionary Algorithm M&F, ch. 7 why I like this textbook and what I don’t like about it!
Introduction to Evolutionary Algorithms Session 4 Jim Smith University of the West of England, UK May/June 2012.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
Wang Y 1,2, Damaraju S 1,3,4, Cass CE 1,3,4, Murray D 3,4, Fallone G 3,4, Parliament M 3,4 and Greiner R 1,2 PolyomX Program 1, Department.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
Multi-Patch Cooperative Specialists With Tags Can Resist Strong Cheaters, Bruce Edmonds, Feb 2013, ECMS 2013, Aalesund, Norway, slide 1 Multi-Patch Cooperative.
2-Day Introduction to Agent-Based Modelling Day 2: Session 6 Mutual adaption.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
Evolutionary Algorithms for Finding Optimal Gene Sets in Micro array Prediction. J. M. Deutsch Presented by: Shruti Sharma.
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
Chapter 9 Genetic Algorithms.  Based upon biological evolution  Generate successor hypothesis based upon repeated mutations  Acts as a randomized parallel.
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #12 2/20/02 Evolutionary Algorithms.
EVOLUTIONARY HMMS BAYESIAN APPROACH TO MULTIPLE ALIGNMENT Siva Theja Maguluri CS 598 SS.
A comparative approach for gene network inference using time-series gene expression data Guillaume Bourque* and David Sankoff *Centre de Recherches Mathématiques,
SUPERVISED AND UNSUPERVISED LEARNING Presentation by Ege Saygıner CENG 784.
Essential Question: How can a change in the environment initiate a change in the population? NATURAL SELECTION.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Unit 3: Probability.  You will need to be able to describe how you will perform a simulation  Create a correspondence between random numbers and outcomes.
Selected Topics in CI I Genetic Programming Dr. Widodo Budiharto 2014.
Genetic Algorithms.
Evolutionary Algorithms Jim Whitehead
Evolution Strategies Evolutionary Programming
Smoothing Serial Data.
Smoothing Serial Data.
Basics of Genetic Algorithms (MidTerm – only in RED material)
Basics of Genetic Algorithms
A Gentle introduction Richard P. Simpson
Coevolutionary Automated Software Correction
Presentation transcript:

Data points are spread over the space according to two of their component values Using real data sets to simulate evolution within complex environments Bruce Edmonds, Centre for Policy Modelling, Manchester Metropolitan University Start of Simulation (HD Data) Individuals each with gene which is an arithmetic expression, e.g.: Data points from set distributed over space dependent on 2 variables chol (x) & thalach (y) Simulation – 25 ticksSimulation – 50 ticks ca 1 sex slope restecg+fbs+1 fbs/oldpeak Simulation – 300 ticks (100 w/o variation) An example simulation run using the HD data set: Illustrative Results: Using Reduced Cleveland Heart Disease Data Set, 20 runs with each setting, 1000 individuals, 1000 iterations, Locality parameter 0.1 (radius), Comparison of Original vs Ersatz Data Sets (same distribution in each dimension but random), Fixed normal noise (0, 0.1) added to both data sets Fitness Gene Complexity/Depth Original Ersatz Evolutionary data-mining is where ideas from biological evolution are applied to data-mining – finding patterns in data Data sets exist for the purpose of testing different ML algorithms that have patterns in them, albeit difficult to discover Reversing this... I am suggesting the use of complex data sets as a test bed to investigate how the complexity of the environment might affect evolution Main Ideas: The Data Set Environment: o Find a rich data set (preferably one derived from a naturally complex system) with many independent variables o The gene of an individual is an arbitrary arithmetic expression stored as a tree (or similar technique) o Resource in the model is modelled by distributing to individuals predicting the outcome variable of local data better than its competitors o The gene are mutated and crossed as the simulation progresses o Individuals are selected for/against depending on their total success in predicting When mighty the complexity of the environment effect evolutionary processes? How might the complexity of the environment effect evolutionary processes? Will models with a simple environment tell us about evolution in the wild? When and about what aspects will models with simple environments be sufficient? In what ways might evolution differ when in complex environments? What kind of complexity might we need? How might one measure this complexity in the wild (if this is even possible)? Data Space For each data point (or a random subset of them) evaluate (a random selection of) near individuals to determine the share of fitness each receive (depending on predictive success) Sum of fitness determines which breed and die Individuals each with genes composed of an arithmetic expression to predict HD based on the other 13 variables Data Space N times: 1.probabilistically select winner(s) on fitness 2.probabilistically select a loser on lack of fitness 3.kill loser Either 4.propagate winner locally with possible mutation 5.mate with another local based on fitness 8.1 Questions: That might be explored using this approach (1) Evaluation Phase of Model: (2) Selection Phase of Model: