METHOD OF BINARY ANALYTIC PROGRAMMING TO LOOK FOR OPTIMAL MATHEMATICAL EXPRESSION

Abstract

In the known methods of symbolical regression by search of the solution with the help of a genetic algorithm, there is a problem of crossover. Genetic programming performs a crossover only in certainpoints. Grammatical evolution often corrects a code after a crossover. Other methods of symbolical regression use excess elements in a code for elimination of this shortcoming. The work presents a new method of symbolic regression on base of binary computing trees. The method has no problems with a crossover. Method use a coding in the form of a set of integer numbers like analytic programming. The work describes the new method and some examples of codding for mathematical expressions.

Keywords

• символьная регрессия
• генетическое программирование
• генетический алгоритм