GP Applications Two main areas of research Testing genetic programming in areas other techniques have been applied to. Applying genetic programming to.

Slides:



Advertisements
Similar presentations
Theory of Computing Lecture 3 MAS 714 Hartmut Klauck.
Advertisements

Chapter 4: Image Enhancement
Computer Science Genetic Algorithms10/10/ A comparative analysis of selection schemes used in genetic algorithms David E. Goldberg Kalyanmoy Deb.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Introduction to Genetic Algorithms Yonatan Shichel.
Spot Price Models. Spot Price Dynamics An examination of the previous graph shows several items of interest. –Price series exhibit spikes with seasonal.
Doug Downey, adapted from Bryan Pardo, Machine Learning EECS 349 Machine Learning Genetic Programming.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Chapter 14 Genetic Algorithms.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Genetic Programming.
Data Mining Techniques
1 Analysis - Improving GP with Statistics Chap. 8 발표자 : 김정집.
Genetic Algorithm.
Decision tree: Example 0 = Not a Saturday, 1 = Saturday Given: rainy, humid, not windy Is it a Saturday? It is a Saturday.
Computer Implementation of Genetic Algorithm
© Negnevitsky, Pearson Education, CSC 4510 – Machine Learning Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University.
Efficient Model Selection for Support Vector Machines
Problems Premature Convergence Lack of genetic diversity Selection noise or variance Destructive effects of genetic operators Cloning Introns and Bloat.
Random Variables Numerical Quantities whose values are determine by the outcome of a random experiment.
Automatically Defined Functions Used to evolve modular programs Architecture implemented by Koza Architecture implemented by Bruce Function calls A critical.
CS 484 – Artificial Intelligence1 Announcements Lab 3 due Tuesday, November 6 Homework 6 due Tuesday, November 6 Lab 4 due Thursday, November 8 Current.
Iteration Iterative operator: for, du, while. Problem: Infinite and time-consuming iterations. Halting problem: We are not able to determine whether an.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Introduction to Evolutionary Algorithms Session 4 Jim Smith University of the West of England, UK May/June 2012.
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
Biological data mining by Genetic Programming AI Project #2 Biointelligence lab Cho, Dong-Yeon
1 Chapter 14 Genetic Algorithms. 2 Chapter 14 Contents (1) l Representation l The Algorithm l Fitness l Crossover l Mutation l Termination Criteria l.
G ENETIC P ROGRAMMING Ranga Rodrigo March 17,
Artificial Intelligence Chapter 4. Machine Evolution.
Initial Population Generation Methods for population generation: Grow Full Ramped Half-and-Half Variety – Genetic Diversity.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
1 Class Project 510 Team Members John A. Watne Jordan D. Howe Ian R. Erlanson Geoffrey A. Reglos Sengdara Phetsomphou.
Fitness Cases Are input-output pairs describing the output a program should produce given the particular input value. The fitness of an individual is usually.
Edge Assembly Crossover
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Project 2: Classification Using Genetic Programming Kim, MinHyeok Biointelligence laboratory Artificial.
Genetic Programming A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 6.
Automated discovery in math Machine learning techniques (GP, ILP, etc.) have been successfully applied in science Machine learning techniques (GP, ILP,
Alice E. Smith and Mehmet Gulsen Department of Industrial Engineering
Introduction Genetic programming falls into the category of evolutionary algorithms. Genetic algorithms vs. genetic programming. Concept developed by John.
The Standard Genetic Algorithm Start with a “population” of “individuals” Rank these individuals according to their “fitness” Select pairs of individuals.
Game Playing Evolve a strategy for two-person zero-sum games. Help the user to determine the next move. Constructing a game tree Each node represents a.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Symbolic Regression via Genetic Programming AI Project #2 Biointelligence lab Cho, Dong-Yeon
Genetic Programming Using Simulated Natural Selection to Automatically Write Programs.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Chapter 3 Chapter Summary  Algorithms o Example Algorithms searching for an element in a list sorting a list so its elements are in some prescribed.
Evolving Recursive Algorithms The SRF function Automatically defined recursions (ADRs) The recur operator Dealing with infinite and time-consuming recursions.
Genetic Algorithm(GA)
GENETIC ALGORITHM By Siti Rohajawati. Definition Genetic algorithms are sets of computational procedures that conceptually follow steps inspired by the.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Evolutionary Computation Evolving Neural Network Topologies.
Genetic Programming.
Selected Topics in CI I Genetic Programming Dr. Widodo Budiharto 2014.
Introduction Genetic programming falls into the category of evolutionary algorithms. Genetic algorithms vs. genetic programming. Concept developed by John.
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Optimization and Learning via Genetic Programming
Artificial Intelligence Chapter 4. Machine Evolution
Artificial Intelligence Chapter 4. Machine Evolution
Genetic Programming Chapter 6.
Genetic Programming Chapter 6.
Genetic algorithms: case study
Genetic Programming Chapter 6.
Presentation transcript:

GP Applications Two main areas of research Testing genetic programming in areas other techniques have been applied to. Applying genetic programming to problems that have not been previously solved. Examples of applications Data mining Image processing Computer graphics Natural language processing Board games

GP Parameters Standard parameters Population size (M) Number of generations Tournament size Application rates for each of the genetic operators Maximum tree depth Bound Maximum offspring size These parameters are varied in an attempt to find a solution.

Reporting on GP Results GP reports must specify: A description of the objective. The terminal set used. The function set used. The fitness cases used. The raw fitness measure. Hits criterion. The population size. The number of generations. The success predicate used. The method used to create the initial population. The seeds of the random number generator used on successful runs together with the corresponding solution found on each of these runs.

Describing the Performance of a GP System Hits histogram Standardized fitness histogram Structural complexity histogram Variety histogram Number of runs that must be performed to find a solution. Calculating the computational effort needed to find a solution.

Hits Histogram Example

Creating a Hits Histogram A hits histogram is created for each generation. Count the number of individuals that have n hits. n usually ranges from 0 to the number of fitness cases Plot the number of individuals with n hits against each n value.

Standardized Fitness Histogram Example

Creating a Standardized Fitness Histogram Illustrates the standardized of an entire run. The standardized fitness is averaged for each generation. Plot the average standardized fitness against each generation.

Structural Complexity Histogram Example

Creating a Structural Complexity Histogram Illustrates the structural complexity over an entire run. Calculate the size, i.e. the number of nodes, of each individual in a generation. Calculate the average tree size for each generation. Plot the average tree size for each generation.

Variety Variety = 100% Variety = 60%

Variety Histogram Example

Creating a Variety Histogram Illustrates the variety over an entire run. Calculate the variety percentage for each generation. Plot the variety percentage against each generation.

Calculating the Number of Runs Needed The probability, x, that a successful solution to a problem will be found in R independent runs of the GP algorithm. x = 1 - ( 1 - P(M, i)) R where P(M,i) is the cumulative probability of success by generation i, using population M. P(M,i) is calculated by finding the total number of runs that succeeded before or on generation i and dividing this total by the total number of runs conducted. The number of runs needed is given by: R(x, M, i) = log ( 1 – x ) (note: the ceiling is taken) log (1 – P(M, I))

Calculating Computational Effort The number of individuals that must be examined as part of the search for the generational control model, i.e. the computational effort, is then calculated using: f(x, M, i) = R(x, M, i)*M*i The following equation is used to calculate the number of individuals that will be examined in a steady-state system with a fixed population size: f(x, M, i) = R(x, M, i) * i

Example How many runs are needed to find a solution with a 99% probability by generation 15? What is the computational effort needed?