Project 2: Classification Using Genetic Programming 2008. 10. 27 Kim, MinHyeok Biointelligence laboratory Artificial.

Slides:



Advertisements
Similar presentations
Random Forest Predrag Radenković 3237/10
Advertisements

Optimization Problem with Simple Genetic Algorithms Cho, Dong-Yeon
GP Applications Two main areas of research Testing genetic programming in areas other techniques have been applied to. Applying genetic programming to.
Genetic Programming 김용덕 Page 2 Contents What is Genetic Programming? Difference between GP and GA Flowchart for GP Structures in GP.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Doug Downey, adapted from Bryan Pardo, Machine Learning EECS 349 Machine Learning Genetic Programming.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Genetic Programming.
Genetic Programming Chapter 6. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Genetic Programming GP quick overview Developed: USA.
Medical Diagnosis via Genetic Programming Project #2 Artificial Intelligence: Biointelligence Computational Neuroscience Connectionist Modeling of Cognitive.
Genetic Algorithm.
Project 1: Classification Using Neural Networks Kim, Kwonill Biointelligence laboratory Artificial Intelligence.
Efficient Model Selection for Support Vector Machines
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Improved Gene Expression Programming to Solve the Inverse Problem for Ordinary Differential Equations Kangshun Li Professor, Ph.D Professor, Ph.D College.
Study on Genetic Network Programming (GNP) with Learning and Evolution Hirasawa laboratory, Artificial Intelligence section Information architecture field.
GA-Based Feature Selection and Parameter Optimization for Support Vector Machine Cheng-Lung Huang, Chieh-Jen Wang Expert Systems with Applications, Volume.
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.
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
Artificial Intelligence Project 1 Neural Networks Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Introduction to Evolutionary Algorithms Session 4 Jim Smith University of the West of England, UK May/June 2012.
Biological data mining by Genetic Programming AI Project #2 Biointelligence lab Cho, Dong-Yeon
Project 1: Machine Learning Using Neural Networks Ver 1.1.
Computational Complexity Jang, HaYoung BioIntelligence Lab.
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.
Genetic Programming. GP quick overview Developed: USA in the 1990’s Early names: J. Koza Typically applied to: machine learning tasks (prediction, classification…)
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Artificial Intelligence Project 1 Neural Networks Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
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,
Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:
Poster Presentation Date: Dec. 4, 10:00 Location: 500-L301 For 40 students, 20 poster presentations for 1.5 hours twice separately You may use your own.
Project 1: Classification Using Neural Networks Kim, Kwonill Biointelligence laboratory Artificial Intelligence.
Introduction Genetic programming falls into the category of evolutionary algorithms. Genetic algorithms vs. genetic programming. Concept developed by John.
Artificial Intelligence Project 1 Neural Networks Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Genetic Programming COSC Ch. F. Eick, Introduction to Genetic Programming GP quick overview Developed: USA in the 1990’s Early names: J. Koza Typically.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Blocks World Problem. The CS Terminal Specifies the block at the top of the stack. Example CS evaluates to E Note: Evaluates to nil if the stack is empty.
John R. Koza [Edited by J. Wiebe] 1. GENETIC PROGRAMMING 2.
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.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
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.
Bulgarian Academy of Sciences
Medical Diagnosis via Genetic Programming
Artificial Intelligence Project 2 Genetic Algorithms
GENETIC PROGRAMMING BBB4003.
Artificial Intelligence
Optimization and Learning via Genetic Programming
Artificial Intelligence Chapter 4. Machine Evolution
Project 1: Text Classification by Neural Networks
Artificial Intelligence Chapter 4. Machine Evolution
EE368 Soft Computing Genetic Algorithms.
Genetic Programming Chapter 6.
Genetic Programming.
Genetic Programming Chapter 6.
Genetic Programming Chapter 6.
GENETIC PROGRAMMING BBB4003.
Beyond Classical Search
Presentation transcript:

Project 2: Classification Using Genetic Programming Kim, MinHyeok Biointelligence laboratory Artificial Intelligence

Contents Project outline Description on the data set Genetic Programming  Brief overview  Fitness function & Selection methods  Classification with GP (in this project) Guide to writing reports  Style & contents Submission guide / Marking scheme 2 (C) 2008, SNU Biointelligence Laboratory

3 Outline Goal  Understand the Genetic Programming (GP) deeper  Practice researching and writing a paper Forest Fires problem (classification)  To predict whether a fire occurs or not  Using Genetic Programming  Estimating several statistics on the dataset Data set  Variation of the ‘Forest Fires data set’ 

Forest Fires Data Set Description  Database of 517 samples  You can use at most 500 samples for training  17 samples for prediction  12 attributes  X,Y,month,day,FFMC,DMC,DC,ISI,temp,RH,wind,rain,label  Integer or real value  Label (Class)  Two classes –0 : a fire does not occur –1 : a fire occurs 4 (C) 2008, SNU Biointelligence Laboratory

Brief Summary of GP A kind of evolutionary algorithms It is represented with a tree structure You need to set up following elements for GP run  The set of terminals (input attributes, the class variable, constants)  The set of functions (numerical / condition operators)  The fitness measure  The algorithm parameters  population size, maximum number of generations  crossover rate and mutation rate  maximum depth of GP trees etc.  The method for designating a result and the criterion for terminating a run. 5 (C) 2008, SNU Biointelligence Laboratory

6 GP Flowchart GA loopGP loop

Initialization Maximum initial depth of trees D max is set. Full method (each branch has depth = D max ):  nodes at depth d < D max randomly chosen from function set F  nodes at depth d = D max randomly chosen from terminal set T Grow method (each branch has depth  D max ):  nodes at depth d < D max randomly chosen from F  T  nodes at depth d = D max randomly chosen from T Common GP initialisation: ramped half-and-half, where grow and full method each deliver half of initial population 7 (C) 2008, SNU Biointelligence Laboratory

Fitness Functions Relative squared error The number of outputs that are within  % of the correct value And you can try other fitness functions which are well- defined to solve problems

Selection methods (1/2) Fitness proportional (roulette wheel) selection  The roulette wheel can be constructed as follows.  Calculate the total fitness for the population.  Calculate selection probability p k for each chromosome v k.  Calculate cumulative probability q k for each chromosome v k.

Procedure: Proportional_Selection  Generate a random number r from the range [0,1].  If r  q 1, then select the first chromosome v 1 ; else, select the kth chromosome v k (2  k  pop_size) such that q k-1 < r  q k. pkpk qkqk

Selection methods (2/2) Tournament selection  Tournament size q Ranking-based selection  2    POP_SIZE  1   +  2 and  - = 2 -  + Elitism  To preserve n good solutions until the next generation

Classification with GP (in this project) Function Regression  Search a function f(x) s.t.  f(x) ≥ threshold twhen y=1  f(x) < threshold twhen y=0 Converting to Boolean value ∧ ¬∨ = >< 0 rainRH 50 wind + FFMCISI IF > 1 0 f(x)t

What to do for the experiment? Select a library that implements GP  You can find various libraries written in C++/Java/Matlab  See the list of recommended libraries on the next page Build up your own code for the experiment  Check sample codes and tutorials of libraries for quick start  Add comments to explain the flow of your program Caution  Running GP may take much time 13 (C) 2008, SNU Biointelligence Laboratory

Recommended Libraries for GP C++  GPLib: Java  JGAP:  ECJ: Matlab toolbox  GPLAB: More References  Implementations section in Wiki – Genetic Programming: (C) 2008, SNU Biointelligence Laboratory

Reports Style English only!! Scientific journal-style  How to Write A Paper in Scientific Journal Style and Format  (C) 2008, SNU Biointelligence Laboratory Experimental process Section of Paper What did I do in a nutshell? Abstract What is the problem?Introduction How did I solve the problem? Materials and Methods What did I find out? Results What does it mean? Discussion Who helped me out? Acknowledgments (optional) Whose work did I refer to? Literature Cited Extra InformationAppendices (optional)

Report Contents (1/3) System description  Used programming language and running environments Result tables Analysis & discussion (Very Important!!) 16 (C) 2008, SNU Biointelligence Laboratory Training Average  SD BestWorst Setting 1 %  % % Setting 2 %  % % Setting 3 %  % % Your prediction 12…1617Equation

Report Contents (2/3) Graph  Avg., Max. Fitness versus Generation  Tree size versus Generation 17 (C) 2008, SNU Biointelligence Laboratory

Report Contents (3/3) Basic experiments  Changing parameters for the crossover and mutation  Various function sets: arithmetic, numerical Optional experiments  Various selection methods  Depth limitation  Population size, generation numbers  Comparison to Neural Network  … References 18 (C) 2008, SNU Biointelligence Laboratory

19 (C) 2008, SNU Biointelligence Laboratory Submission Guide Due date: Nov. 19 (Wed) 18:00 Submit both ‘hardcopy’ and ‘ ’  Hardcopy submission to the office ( )  submission to  Subject : [AI Project1 Report] Student number, Name  Report + your source code with comments + executable file(s)  Length: report should be summarized within 12 pages. We are NOT interested in the accuracy and your programming skill, but your creativity and research ability. If your major is not a C.S, team project with a C.S major student is possible (Use the class board to find your partner and notice the information of your team to TA by Nov.

Marking Scheme 5 points for programming 5 points for result prediction 30 points for experiment & analysis  15 pts for experiments, 15pts for analysis 10 points for report Late work  - 10% per one day  Maximum 7 days 20 (C) 2008, SNU Biointelligence Laboratory

QnA 21 (C) 2008, SNU Biointelligence Laboratory

Test Data XYmonthdayFFMCDMCDCISItempRHwindrain Data Data Data Data Data Data Data Data Data Data Data Data Data Data Data Data Data