Elliptical and Archimedean Copulas in Estimation of Distribution Algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F15%3APU117069" target="_blank" >RIV/00216305:26230/15:PU117069 - isvavai.cz</a>
Result on the web
<a href="https://www.fit.vut.cz/research/publication/11012/" target="_blank" >https://www.fit.vut.cz/research/publication/11012/</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Elliptical and Archimedean Copulas in Estimation of Distribution Algorithm
Original language description
Estimation of distribution algorithm (EDA) is a variant of evolution algorithms, which is based on construction and sampling of probability model. Nowadays the copula theory is often utilized for the probability model estimation to simplify this process. We made comparison of two classes of copulas - elliptical and Archimedean ones - for the set of standard optimization benchmarks. The experimental results con firm our assumption that the elliptical copulas outperform the Archimedean ones namely in the case of the complex optimization problems.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
MENDEL 2015 21st International Conference on Soft Computing
ISBN
978-80-214-4984-8
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
19-26
Publisher name
Faculty of Mechanical Engineering BUT
Place of publication
Brno
Event location
Brno
Event date
Jun 23, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—