Internal reinforcement in a connectionist genetic programming approach

@article{Teller2000InternalRI,
  title={Internal reinforcement in a connectionist genetic programming approach},
  author={Astro Teller and Manuela M. Veloso},
  journal={Artif. Intell.},
  year={2000},
  volume={120},
  pages={165-198}
}
Abstract Genetic programming (GP) can learn complex concepts by searching for the target concept through evolution of a population of candidate hypothesis programs. However, unlike some learning techniques, such as Artificial Neural Networks (ANNs), GP does not have a principled procedure for changing parts of a learned structure based on that structure's performance on the training data. GP is missing a clear, locally optimal update procedure, the equivalent of gradient-descent backpropagation… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

An Indexed Bibliography of Genetic Programming

VIEW 25 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Applications of artificial intelligence technologies in credit scoring: A survey of literature

  • 2014 10th International Conference on Natural Computation (ICNC)
  • 2014
VIEW 1 EXCERPT

Credit Scoring, Statistical Techniques and Evaluation Criteria: A Review of the Literature

  • Int. Syst. in Accounting, Finance and Management
  • 2011
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.

Automatically de ned features : The simultaneous evolution of 2 - dimensional featuredetectors and an algorithm for using them

David Andre
  • Advances In Genetic Programming
  • 1994