1 / 7

Genetic Algorithms (GAs)

Genetic Algorithms (GAs). by Jia-Huei Liao Source: Chapter 9, Machine Learning, Tom M. Mitchell, 1997 The Genetic Programming Tutorial Notebook http://www.geneticprogramming.com/Tutorial/tutorial.html#anchor160803 Simple Symbolic Regression Using Genetic Programming John Koza

skyler
Download Presentation

Genetic Algorithms (GAs)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Genetic Algorithms(GAs) by Jia-Huei Liao Source: Chapter 9, Machine Learning, Tom M. Mitchell, 1997 The Genetic Programming Tutorial Notebook http://www.geneticprogramming.com/Tutorial/tutorial.html#anchor160803 Simple Symbolic Regression Using Genetic Programming John Koza http://www.ifh.ee.ethz.ch/~gerber/approx/default.html

  2. Genetic Algorithms • Genetic Algorithms • Genetic Programming • Models of Evaluation And Learning

  3. Overview of GAs • It is a kind of evolutionary computation. • It is general optimization method that searches a large space of candidate objects (hypotheses, population) seeking one that performs best according to the fitness function (a predefined numerical measure ). • It is NOT guaranteed to find an optimal object. • It is broadly applied on optimization, machine learning, circuit layout, job-shop scheduling, and so on.

  4. Motivation for GAs • Evolution is know to be a successful, robust method for adaptation within biological systems. • GAs can search spaces of hypotheses containing complex interacting models. • GAs are easily parallelized and can take advantage of the decreasing costs of powerful computer hardware.

  5. A Prototypical GA

  6. Representing Hypotheses Rule Precondition: 100 -> Outlook = Sunny 011-> Outlook = Overcast  Rainy Attribute 1 : Outlook Values : Sunny, Overcast or Rainy Attribute 2 : Wind Values : Strong or Weak Outlook Wind 011 10 (Outlook = Overcast  Rainy)  (Wind = Strong)  Rule Postcondition: Attribute 3 : PlayTennis Values : Yes or No  1 bit Example of Bit String: IF Wind = Strong THEN PlayTennis = No Outlook Wind PlayTennis 111 10 0  bit string: 111100

  7. Genetic Operators

More Related