Analytické Programování - Symbolická regrese s využitím jakéhokoli evolučního algoritmu

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28110%2F05%3A63504197" target="_blank" >RIV/70883521:28110/05:63504197 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Analytic Programming - Symbolic Regression by Means of Arbitrary Evolutionary Algorithms

Popis výsledku v původním jazyce

This contribution introduces analytical programming, a novel method that allows solving various problems from the symbolic regression domain. Symbolic regression was first proposed by J. R. Koza in his genetic programming and by C. Ryan in grammatical evolution. This contribution explains the main principles of analytic programming, and demonstrates its ability to synthesize suitable solutions, called programs. It is then compared in its structure with genetic programming and grammatical evolution. After theoretical part, a comparative study concerned with Boolean k-symmetry and k-even problems from Koza's genetic programming domain is done with analytical programming. Here, two evolutionary algorithms are used with analytical programming: differentialevolution and self-organizing migrating algorithm. Boolean k-symmetry and k-even problems comparative study here are continuation of previous comparative studies done by analytic programming in the past.

Název v anglickém jazyce

Analytic Programming - Symbolic Regression by Means of Arbitrary Evolutionary Algorithms

Popis výsledku anglicky

This contribution introduces analytical programming, a novel method that allows solving various problems from the symbolic regression domain. Symbolic regression was first proposed by J. R. Koza in his genetic programming and by C. Ryan in grammatical evolution. This contribution explains the main principles of analytic programming, and demonstrates its ability to synthesize suitable solutions, called programs. It is then compared in its structure with genetic programming and grammatical evolution. After theoretical part, a comparative study concerned with Boolean k-symmetry and k-even problems from Koza's genetic programming domain is done with analytical programming. Here, two evolutionary algorithms are used with analytical programming: differentialevolution and self-organizing migrating algorithm. Boolean k-symmetry and k-even problems comparative study here are continuation of previous comparative studies done by analytic programming in the past.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JD - Využití počítačů, robotika a její aplikace

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2005

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

International Journal of Simulation, Systems, Science and Technology

ISSN

1473-8031

e-ISSN

—

Svazek periodika

6

Číslo periodika v rámci svazku

9

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

13

Strana od-do

44-56

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—