Fakulta elektrotechniky a informatiky / Faculty of Electrical Engineering and Informatics
Stálý URI pro tuto komunituhttps://hdl.handle.net/10195/3847
Práce obhájené před rokem 2008 jsou uloženy pouze v kolekci Vysokoškolské kvalifikační práce
Procházet
2 výsledky
Search Results
Článekpeer-reviewedpublished Otevřený přístup Two-layer genetic programming(2022) Merta, Jan; Brandejský, Tomáš; Bouchner, PetrThis paper focuses on a two-layer approach to genetic programming algorithm and the improvement of the training process using ensemble learning. Inspired by the performance leap of deep neural networks, the idea of a multilayered approach to genetic programming is proposed to start with two-layered genetic programming. The goal of the paper was to design and implement a twolayer genetic programming algorithm, test its behaviour in the context of symbolic regression on several basic test cases, to reveal the potential to improve the learning process of genetic programming and increase the accuracy of the resulting models. The algorithm works in two layers. In the first layer, it searches for appropriate sub-models describing each segment of the data. In the second layer, it searches for the final model as a non-linear combination of these sub-models. Two-layer genetic programming coupled with ensemble learning techniques on the experiments performed showed the potential for improving the performance of genetic programming.Článekpeer-reviewedpublished version Otevřený přístup Dependency of GPA-ES Algorithm Efficiency on ES Parameters Optimization Strength(Ton Duc Thang University, 2019) Brandejský, TomášIn herein presented work, the relation between number of ES iterations and convergence of the whole GPA-ES hybrid algorithm will be studied due to increasing needs to analyze and model large data sets. Evolutionary algorithms are applicable in the areas which are not covered by other artificial intelligence or soft computing techniques like neural networks and deep learning like search of algebraic model of data. The difference between time and algorithmic complexity will be also mentioned as well as the problems of multitasking implementation of GPA, where external influences complicate increasing of GPA efficiency via Pseudo Random Number Generator (PRNG) choice optimization. Hybrid evolutionary algorithms like GPA-ES uses GPA for solution structure development and Evolutionary Strategy (ES) for parameters identification are controlled by many parameters. The most significant are sizes of GPA population and sizes of ES populations related to each particular individual in GPA population. There is also limit of ES algorithm evolutionary cycles. This limit plays two contradictory roles. On one side bigger number of ES iterations means less chance to omit good solution for wrongly identified parameters, on the opposite side large number of ES iterations significantly increases computational time and thus limits application domain of GPA-ES algorithm.