METHOD OF BINARY ANALYTIC PROGRAMMING TO LOOK FOR OPTIMAL MATHEMATICAL EXPRESSION
| Autor: | Askhat I Diveev, Evgenia M Lomakova |
|---|---|
| Jazyk: | English<br />Russian |
| Rok vydání: | 2017 |
| Předmět: | |
| Zdroj: | RUDN Journal of Engineering Research, Vol 18, Iss 1, Pp 125-134 (2017) |
| Druh dokumentu: | article |
| ISSN: | 2312-8143 2312-8151 |
| DOI: | 10.22363/2312-8143-2017-18-1-125-134 |
| Popis: | 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. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|