Numerical recipes in C: the art of scientific computing
Numerical recipes in C: the art of scientific computing
An adaptive crossover distribution mechanism for genetic algorithms
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
Data-driven approaches to empirical discovery
Artificial Intelligence
Rapid construction of algebraic axioms from samples
Theoretical Computer Science - Images of programming dedicated to the memory of Andrei P. Ershov
Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Genetic programming using a minimum description length principle
Advances in genetic programming
Advances in genetic programming
Extending genetic programming with recombinative guidance
Advances in genetic programming
Self-Organizing Methods in Modeling: Gmdh Type Algorithms
Self-Organizing Methods in Modeling: Gmdh Type Algorithms
System Identification using Structured Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Generality and Difficulty in Genetic Programming: Evolving a Sort
Proceedings of the 5th International Conference on Genetic Algorithms
Temporal Data Processing Using Genetic Programming
Proceedings of the 6th International Conference on Genetic Algorithms
Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems
Balancing accuracy and parsimony in genetic programming
Evolutionary Computation
Evolutionary learning strategy using bug-based search
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 2
Systems Analysis Modelling Simulation - Special issue: Self-organising modelling and simulation
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
RETRACTED: Investigating the efficiency in oil futures market based on GMDH approach
Expert Systems with Applications: An International Journal
Engineering Applications of Artificial Intelligence
ICOSSE'06 Proceedings of the 5th WSEAS international conference on System science and simulation in engineering
Long memory time series forecasting by using genetic programming
Genetic Programming and Evolvable Machines
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
This paper introduces a new approach to genetic programming (GP), based on a numerical technique, which integrates a GP-based adaptive search of tree structures, and a local parameter tuning mechanism employing statistical search (a system identification technique). In traditional GP, recombination can cause frequent disruption of building blocks or mutation can cause abrupt changes in the semantics. To overcome these difficulties, we supplement traditional GP with a local hill-climbing search, using a parameter tuning procedure. More precisely, we integrate the structural search of traditional GP with a multiple regression analysis method and establish our adaptive program, called STROGANOFF (STructured Representation On Genetic Algorithms for NOn-linear Function Fitting). The fitness evaluation is based on a minimum description length (MDL) criterion, which effectively controls the tree growth in GP. We demonstrate its effectiveness by solving several system identification (numerical) problems and compare the performance of STROGANOFF with traditional GP and another standard technique (radial basis functions). We then extend STROGANOFF to symbolic (nonnumerical) reasoning by introducing multiple types of nodes, using a modified MDL-based selection criterion and a pruning of the resultant trees. The effectiveness of this numerical approach to GP is demonstrated by successful application to symbolic regression problems.