Method of Binary Analytic Programming to Look for Optimal Mathematical Expression

Created by W.Langdon from gp-bibliography.bib Revision:1.8010

@Article{Diveev:2017:PCS,

• author = "A. I. Diveev and N. B. Konyrbaev and E. A. Sofronova",
• title = "Method of Binary Analytic Programming to Look for Optimal Mathematical Expression",
• journal = "Procedia Computer Science",
• volume = "103",
• pages = "597--604",
• year = "2017",
• note = "\{XII\} International Symposium Intelligent Systems 2016, \{INTELS\} 2016, 5-7 October 2016, Moscow, Russia",
• ISSN = "1877-0509",
• DOI = "doi:10.1016/j.procs.2017.01.073",
• URL = "http://www.sciencedirect.com/science/article/pii/S1877050917300741",
• 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 certain points. 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 = "genetic algorithms, genetic programming, symbolic regression, analytic programming",

}

Genetic Programming entries for Askhat Diveev Ibraghimovich N B Konyrbaev Elena A Sofronova

Citations