Yu, T;
Clack, C;
(1998)
PolyGP: a polymorphic genetic programming system in Haskell.
In:
Genetic Programming 1998: Proceedings of the Third Annual Conference.
(pp. pp. 416-421).
Morgan Kaufman: San Francisco, CA.
Preview |
Text
pgp.new.pdf - Accepted Version Download (123kB) | Preview |
Abstract
In general, the machine learning process can be accelerated through the use of additional knowledge about the problem solution. For example, monomorphic typed Genetic Programming (GP) uses type information to reduce the search space and improve performance. Unfortunately, monomorphic typed GP also loses the generality of untyped GP: the generated programs are only suitable for inputs with the specified type. Polymorphic typed GP improves over monomorphic and untyped GP by allowing the type information to be expressed in a more generic manner, and yet still imposes constraints on the search space. This paper describes a polymorphic GP system which can generate polymorphic programs: programs which take inputs of more than one type and produce outputs of more than one type.
| Type: | Proceedings paper |
|---|---|
| Title: | PolyGP: a polymorphic genetic programming system in Haskell |
| Event: | Genetic Programming |
| Dates: | 22 July 1998 - 25 July 1998 |
| Open access status: | An open access version is available from UCL Discovery |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10087119 |
Archive Staff Only
 |
View Item |
