By Topic

Performance improvement of machine learning via automatic discovery of facilitating functions as applied to a problem of symbolic system identification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
J. Koza ; Dept. of Comput. Sci., Stanford Univ., CA, USA ; M. A. Keane ; J. P. Rice

The recently developed genetic programming paradigm provides a way to genetically breed a population of computer programs to solve problems. The technique of automatic function definition enables genetic programming to define potentially useful functions dynamically during a run, much as a human programmer writing a computer program creates subroutines to perform certain groups of steps which must be performed in more than one place in the main program. An approximation is found to the impulse response function, in symbolic form, for a linear time-invariant system. The value of automatic function definition in enabling genetic programming to accelerate the solution to this illustrative problem is demonstrated

Published in:

Neural Networks, 1993., IEEE International Conference on

Date of Conference: