Evolutionary Algorithms with Competing Heuristics in Computational Statistics
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F02%3A00000022" target="_blank" >RIV/61988987:17310/02:00000022 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Evolutionary Algorithms with Competing Heuristics in Computational Statistics
Original language description
The paper presents a new class of evolutionary algorithms based on the competition of different heuristics. The algorithm was applied to solving some optimization problems of computational statistics, namely to estimating the parameters of non-l inear regression models, constrained M-estimates and optimizing the smoothing constants in the Winters exponential smoothing. The results showed that the evolutionary algorithm with competing heuristics can be successfully used in solving some glob al optimization problems of computational statistics.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA402%2F00%2F1165" target="_blank" >GA402/00/1165: Modelling of the Regional Labour Market Development</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
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
COMPSTAT 2002, Proceedings in Computatonal Statistics, ed. by W. Haerdle and B. Roenz
ISBN
3-7908-1517-9
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
349-354
Publisher name
Physica Verlag
Place of publication
Heildelberg
Event location
Berlin
Event date
Aug 24, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—