Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.

Slides:



Advertisements
Similar presentations
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Advertisements

Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Section 14.5: Local search – Genetic Algorithms.
Estimation of Distribution Algorithms Ata Kaban School of Computer Science The University of Birmingham.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Introduction to Genetic Algorithms Yonatan Shichel.
1 Genetic Algorithms. CS The Traditional Approach Ask an expert Adapt existing designs Trial and error.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Genetic Algorithm for Variable Selection
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Selecting Informative Genes with Parallel Genetic Algorithms Deodatta Bhoite Prashant Jain.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
16 November, 2005 Statistics in HEP, Manchester 1.
EVOLVING ANTS Enrique Areyan School of Informatics and Computing Indiana University January 24, 2012.
A Genetic Algorithms Approach to Feature Subset Selection Problem by Hasan Doğu TAŞKIRAN CS 550 – Machine Learning Workshop Department of Computer Engineering.
Evolutionary Intelligence
1 GAs and Feature Weighting Rebecca Fiebrink MUMT March 2005.
Evolving a Sigma-Pi Network as a Network Simulator by Justin Basilico.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
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 Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
CS Machine Learning Genetic Algorithms (II).
CS 484 – Artificial Intelligence1 Announcements Lab 3 due Tuesday, November 6 Homework 6 due Tuesday, November 6 Lab 4 due Thursday, November 8 Current.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Chapter 8 The k-Means Algorithm and Genetic Algorithm.
More on Heuristics Genetic Algorithms (GA) Terminology Chromosome –candidate solution - {x 1, x 2,...., x n } Gene –variable - x j Allele –numerical.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
1 Machine Learning: Lecture 12 Genetic Algorithms (Based on Chapter 9 of Mitchell, T., Machine Learning, 1997)
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
Kansas State University Department of Computing and Information Sciences CIS 732: Machine Learning and Pattern Recognition Friday, 16 February 2007 William.
A Parallel Genetic Algorithm with Distributed Environment Scheme
Chapter 9 Genetic Algorithms.  Based upon biological evolution  Generate successor hypothesis based upon repeated mutations  Acts as a randomized parallel.
 Genetic Algorithms  A class of evolutionary algorithms  Efficiently solves optimization tasks  Potential Applications in many fields  Challenges.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
CpSc 881: Machine Learning Genetic Algorithm. 2 Copy Right Notice Most slides in this presentation are adopted from slides of text book and various sources.
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Overview Last two weeks we looked at evolutionary algorithms.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm(GA)
Advanced AI – Session 7 Genetic Algorithm By: H.Nematzadeh.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Genetic Algorithm (Knapsack Problem)
Evolutionary Algorithms Jim Whitehead
Genetic-Algorithm-Based Instance and Feature Selection
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Bulgarian Academy of Sciences
Simulated molecular evolution in a full combinatorial library
Simulated molecular evolution in a full combinatorial library
Machine Learning: UNIT-4 CHAPTER-2
Applications of Genetic Algorithms TJHSST Computer Systems Lab
Genetic algorithms: case study
Md. Tanveer Anwar University of Arkansas
Population Based Metaheuristics
Presentation transcript:

Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution of biological organisms.” Basically genetic algorithms tend to find the best solution to a problem by following an evolutionary process.

Basic Genetic Algorithm

Parallel Genetic Algorithm For large population sizes, G.A. is computationally infeasible. Hence the use of Parallel Genetic Algorithms.

Parallel Genetic Algorithm

Model and Encoding Island Model -: Each processor runs a G.A. on a subset of the population and there is periodic migration. Fixed Length Binary String Encoding -: Here if gene is included in the subset then value is 1 else 0.

Fitness Evaluation Two Different Criteria Classification Accuracy Size of the subset fitness(x) = w 1 * accuracy(x) + w 2 *(1 – dimensionality(x)) Here, accuracy(x) =test accuracy of the classifier built with the gene subset represented by x dimensionality(x)  [0,1] = the dimension of the subset

Fitness Evaluation w 1 = weight assigned to accuracy w 2 = weight assigned to dimensionality High classification accuracy and low dimension has high fitness.

Data Sets Used

Test Parameters The tests were run on two processors. The parameters of G.A. in each processor were set as -: Population Size : 1000 Trials : Crossover probability: 0.6 Mutation probability: 0.001

Test Parameters Selection Strategy: Elitist Migration Probability: Crossover probability of average level to get different subpopulation with good traits of the parents. Mutation Probability low to avoid randomness of selection. Selection Strategy is Elitist which ensures that the best individuals are kept and hence leads to more accurate subsets of genes.

Results

Leukemia Data Set Subset with 29 Genes found Classifies 36/38 training instances correctly Classifies 30/34 test instances correctly Colon Data Set Subset with 30 genes found 92% accuracy on the training data set

Results Comparison Results better than other algorithms such as G-S and NB algorithms which have accuracies less than 90% and gene numbers varying from 10 to 500.

Average Performance Graphs

Conclusion Method does well in finding smaller gene subsets and better accuracies. Fitness function needs to be something more sophisticated than the simple one used right now to ensure a final compact subset every time.