A General Approach to Automatic Programming Using Occam's Razor, Compression, and Self-Inspection

Created by W.Langdon from gp-bibliography.bib Revision:1.4192

  author =       "Peter Galos and Peter Nordin and Joel Ols{\'e}n and 
                 Kristofer Sund{\'e}n Ringn{\'e}r",
  title =        "A General Approach to Automatic Programming Using
                 {Occam's} Razor, Compression, and Self-Inspection",
  booktitle =    "Genetic and Evolutionary Computation -- GECCO-2003",
  editor =       "E. Cant{\'u}-Paz and J. A. Foster and K. Deb and 
                 D. Davis and R. Roy and U.-M. O'Reilly and H.-G. Beyer and 
                 R. Standish and G. Kendall and S. Wilson and 
                 M. Harman and J. Wegener and D. Dasgupta and M. A. Potter and 
                 A. C. Schultz and K. Dowsland and N. Jonoska and 
                 J. Miller",
  year =         "2003",
  pages =        "1806--1807",
  address =      "Chicago",
  publisher_address = "Berlin",
  month =        "12-16 " # jul,
  volume =       "2724",
  series =       "LNCS",
  ISBN =         "3-540-40603-4",
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming, poster",
  DOI =          "doi:10.1007/3-540-45110-2_74",
  abstract =     "general method for automatic programming which can be
                 seen as a generalization of techniques such as genetic
                 programming and ADATE. The approach builds on the
                 assumption that data compression can be used as a
                 metaphor for cognition and intelligence. The
                 proof-of-concept system is evaluated on sequence
                 prediction problems. As a starting point, the process
                 of inferring a general law from a data set is viewed as
                 an attempt to compress the observed data. From an
                 artificial intelligence point of view, compression is a
                 useful way of measuring how deeply the observed data is
                 understood. If the sequence contains redundancy it
                 exists a shorter description i.e. the sequence can be
  notes =        "GECCO-2003. A joint meeting of the twelfth
                 International Conference on Genetic Algorithms
                 (ICGA-2003) and the eighth Annual Genetic Programming
                 Conference (GP-2003)",

Genetic Programming entries for Peter Galos Peter Nordin Joel Ols\'en Kristofer Sund\'en Ringn\'er