Hierarchical Genetic Algorithms Operating on Populations of Computer Programs
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Machine Learning. Pages 768-773.
Abstract
Existing approaches to artificial intelligence problems such as sequence induction, automatic programming, machine learning, planning, and pattern recognition typically require specification in advance of the size and shape of the solution to the problem (often in a unnatural and difficult way). This paper reports on a new approach in which the size and shape of the solution to such problems is dynamically created using Darwinian principles of reproduction and survival of the fittest. Moreover, the resulting solution is inherently hierarchical. The paper describes computer experiments, using the author's 4341 line LISP program, in five areas of artifical intelligence, namely (1) sequence induction, (2) automatic programming, (3) machine learning of functions, (4) planning, and (5) pattern recognition.
@inproceedings{ijcai1989p123,
title = {Hierarchical Genetic Algorithms Operating on Populations of Computer Programs},
author = {Koza, John R.},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {768--773},
year = {1989},
month = {8},
note = {Machine Learning},
url = {https://ijcai.org/proceedings/1989/123},
}
TY - CPAPER TI - Hierarchical Genetic Algorithms Operating on Populations of Computer Programs AU - Koza, John R. T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 768 EP - 773 UR - https://ijcai.org/proceedings/1989/123 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
