Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  systems identification
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
There are several methods that are frequently used for solving data based system identification problems; genetic programming (GP) has already been used successfully for solving data mining problems in the context of several scientific domains. Extended functional bases, additional optimization phases and further developed selection mechanisms essentially contribute to the method's ability to generate high quality results for various kinds of data based identification scenarios. Even though there has already been a lot of investigation regarding the optimization of the method and its parameter settings, there is still rather little systematic analysis of internal processes regarding genetic dynamics and the progress of genetic diversity during the execution of genetic programming based identification using these algorithmic extensions. In this paper, we report on results of investigations regarding exactly these aspects: We have developed methods and statistical features that are able to describe genetic diversity and dynamics of GP-based structure identification algorithms; here, we introduce statistic analysis of genetic diversity regarding variables and time offset settings within GP populations. Genetic diversity is (amongst other aspects) characterized by the occurrence of variables for the models in which they are used; statistical methods for estimating respective impact features are also presented here. Data sets representing two different kinds of systems (complex mechatronical systems as well as medical benchmark data) have been used for empirical tests; furthermore, standard implementations of genetic programming are compared to extended techniques including offspring selection as well as sliding window techniques.
EN
This paper reports a system based on the recently proposed evolutionary paradigm of gene expression programming (GEP). This enhanced system, called EGIPSYS, has features specially suited to deal with symbolic regression problems. Amongst the new features implemented in EGIPSYS are: new selection methods, chromosomes of variable length, a new approach to manipulating constants, new genetic operators and an adaptable fitness function. All the proposed improvements were tested separately, and proved to be advantageous over the basic GEP. EGIPSYS was also applied to four difficult identification problems and its performance was compared with a traditional implementation of genetic programming (LilGP). Overall, EGIPSYS was able to obtain consistently better results than the system using genetic programming, finding less complex solutions with less computational effort. The success obtained suggests the adaptation and extension of the system to other classes of problems.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.