Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Wierzchoń, T." wg kryterium: Autor


Wyświetlanie 1-2 z 2
Tytuł:
Function optimization by the immune metaphor
Autorzy:
Wierzchoń, S. T.
Powiązania:
https://bibliotekanauki.pl/articles/1986917.pdf
Data publikacji:
2002
Wydawca:
Politechnika Gdańska
Tematy:
artificial immune systems
multi-modal optimization
non-stationary functions optimization
immune memory
clonal selection
affinity maturation
Opis:
The main goal of the immune system is to protect an organism against pathogens. To be able to recognize unknown (i.e. never seen) pathogens, the immune system applies a number of methods allowing to maintain sufficient diversity of its receptors. The most important methods are clonal selection and suppression of ineffective receptors. In effect the immune system admits maturation affinity property: during its functioning it continuously improves its ability to recognize new types of pathogens. This idea had found many interesting computer-oriented applications. In this paper a simple and easy to implement algorithm for multi-modal as well as non-stationary functions optimization is proposed. It is based on clonal selection and cells suppression mechanisms. Empirical results confirming its usability for uni-, multi-modal and non-stationary functions optimization are presented, and a review of other immunity-based approaches is given.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2002, 6, 3; 493-508
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary algorithm for learning Bayesian structures from data
Autorzy:
Kozłowski, M.
Wierzchoń, S. T.
Powiązania:
https://bibliotekanauki.pl/articles/1986916.pdf
Data publikacji:
2002
Wydawca:
Politechnika Gdańska
Tematy:
Bayesian networks
structure learning
evolutionary algorithm
discrete optimization
Opis:
In this paper we report an evolutionary approach to learning Bayesian networks from data. We explain reasons, which advocate such a non-deterministic approach. We analyze weaknesses of previous works and come to conclusion that we should operate in the search space native for the problem i.e. in the space of directed acyclic graphs instead of standard space of binary strings. This requires adaptation of evolutionary methodology into very specific needs. We propose quite new data representation and implementation of generalized genetic operators and then we present an efficient algorithm capable of learning complex networks without additional assumptions. We discuss results obtained with this algorithm. The approach presented in this paper can be extended with the possibility to absorb some suggestions from experts or obtained by means of data preprocessing.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2002, 6, 3; 509-521
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies