Numeric Mutation Improves the Discovery of Numeric Constants in Genetic Programming
نویسندگان
چکیده
Genetic programming suffers difficulty in discovering useful numeric constants for the terminal nodes of its sexpression trees. In earlier work we postulated a solution to this problem called numeric mutation. Here, we provide empirical evidence to demonstrate that this method provides a statistically significant improvement in GP system performance on a variety of problems.
منابع مشابه
Numeric Mutation: Improved Search in Genetic Programming
Genetic programming is relatively poor at discovering useful numeric constants for the terminal nodes of its sexpression trees. In this paper we outline an adaptation to genetic programming, called numeric mutation. ~,Ve provide empirical evidence and analysis that demonstrate that numeric mutation makes a statistically significant increase in genetic programming’s performance for symbolic regr...
متن کاملDAMAGE AND PLASTICITY CONSTANTS OF CONVENTIONAL AND HIGH-STRENGTH CONCRETE PART II: STATISTICAL EQUATION DEVELOPMENT USING GENETIC PROGRAMMING
Several researchers have proved that the constitutive models of concrete based on combination of continuum damage and plasticity theories are able to reproduce the major aspects of concrete behavior. A problem of such damage-plasticity models is associated with the material constants which are needed to be determined before using the model. These constants are in fact the connectors of constitu...
متن کاملFaster Genetic Programming based on Local Gradient Search of Numeric Leaf Values
We examine the effectiveness of gradient search optimization of numeric leaf values for Genetic Programming. Genetic search for tree-like programs at the population level is complemented by the optimization of terminal values at the individual level. Local adaptation of individuals is made easier by algorithmic differentiation. We show how conventional random constants are tuned by gradient des...
متن کاملUsing Differential Evolution for GEP Constant Creation
Gene Expression Programming (GEP) is a new evolutionary algorithm that incorporates both the idea of simple, linear chromosome of fixed length used in Genetic Algorithms (GAs) and the ramified structure of different sizes and shapes used in Genetic Programming (GP). Same as other genetic programming algorithms, GEP has difficulty finding appropriate numeric constants for terminal nodes in the e...
متن کاملThe Introduction of a Heuristic Mutation Operator to Strengthen the Discovery Component of XCS
The extended classifier systems (XCS) by producing a set of rules is (classifier) trying to solve learning problems as online. XCS is a rather complex combination of genetic algorithm and reinforcement learning that using genetic algorithm tries to discover the encouraging rules and value them by reinforcement learning. Among the important factors in the performance of XCS is the possibility to...
متن کامل