%0 Conference Paper %1 galos:2003:gecco %A Galos, Peter %A Nordin, Peter %A Olsén, Joel %A Ringnér, Kristofer Sundén %B Genetic and Evolutionary Computation -- GECCO-2003 %C Chicago %D 2003 %E Cantú-Paz, E. %E Foster, J. A. %E Deb, K. %E Davis, D. %E Roy, R. %E O'Reilly, U.-M. %E Beyer, H.-G. %E Standish, R. %E Kendall, G. %E Wilson, S. %E Harman, M. %E Wegener, J. %E Dasgupta, D. %E Potter, M. A. %E Schultz, A. C. %E Dowsland, K. %E Jonoska, N. %E Miller, J. %I Springer-Verlag %K algorithms, genetic poster programming, %P 1806--1807 %T A General Approach to Automatic Programming Using Occam's Razor, Compression, and Self-Inspection %V 2724 %X 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 compressed. %@ 3-540-40603-4

@inproceedings{galos:2003:gecco, 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 compressed.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Chicago}, author = {Galos, Peter and Nordin, Peter and Ols{\'e}n, Joel and Ringn{\'e}r, Kristofer Sund{\'e}n}, biburl = {https://www.bibsonomy.org/bibtex/2046a683887d5a5b36f8b80889abbab44/brazovayeye}, booktitle = {Genetic and Evolutionary Computation -- GECCO-2003}, editor = {Cant{\'u}-Paz, E. and Foster, J. A. and Deb, K. and Davis, D. and Roy, R. and O'Reilly, U.-M. and Beyer, H.-G. and Standish, R. and Kendall, G. and Wilson, S. and Harman, M. and Wegener, J. and Dasgupta, D. and Potter, M. A. and Schultz, A. C. and Dowsland, K. and Jonoska, N. and Miller, J.}, interhash = {409e63085d91269ade650de24db66ab5}, intrahash = {046a683887d5a5b36f8b80889abbab44}, isbn = {3-540-40603-4}, keywords = {algorithms, genetic poster programming,}, month = {12-16 July}, 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)}, pages = {1806--1807}, publisher = {Springer-Verlag}, publisher_address = {Berlin}, series = {LNCS}, timestamp = {2008-06-19T17:40:02.000+0200}, title = {A General Approach to Automatic Programming Using {O}ccam's Razor, Compression, and Self-Inspection}, volume = 2724, year = 2003 }