Evolution of learning rules for supervised tasks II: hard learning problems

by

Kuscu, I.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: 1995
Keywords:genetic algorithms, genetic programming
Abstract:
Recent experiments with a genetic-based encoding schema are presented as a potentially powerful tool to discover learning rules by means of evolution. The representation used is similar to the one used in Genetic Programming (GP) [GP] but it employs only a fixed set of functions to solve a variety of problems. In this paper three Monks' and parity problems [PP] are tested. The results indicate the usefulness of the encoding schema in discovering learning rules for hard learning problems. The problems and future research directions are discussed within the context of GP practices.
URL(s):(G)zipped postscript

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@TechReport{Kuscu:1995:elrst2,
  author =       "Ibrahim Kuscu",
  title =        "Evolution of learning rules for supervised tasks {II}:
                 hard learning problems",
  institution =  "School of Cognitive and Computing Sciences, University
                 of Sussex",
  year =         "1995",
  type =         "Cognitive Science Research Paper",
  number =       "395",
  address =      "Falmer, Brighton, Sussex, UK",
  month =        "10 " # nov,
  keywords =     "genetic algorithms, genetic programming",
  URL =          "ftp://ftp.cogs.susx.ac.uk/pub/reports/csrp/csrp395.ps.Z",
  abstract =     "Recent experiments with a genetic-based encoding
                 schema are presented as a potentially powerful tool to
                 discover learning rules by means of evolution. The
                 representation used is similar to the one used in
                 Genetic Programming (GP) but it employs only a fixed
                 set of functions to solve a variety of problems. In
                 this paper three Monks' and parity problems are tested.
                 The results indicate the usefulness of the encoding
                 schema in discovering learning rules for hard learning
                 problems. The problems and future research directions
                 are discussed within the context of GP practices.",
  size =         "18 pages",
}