Verification of thightness of approximation by new algorithms for LMS and LTS
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F01%3A00105710" target="_blank" >RIV/00216208:11320/01:00105710 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Verification of thightness of approximation by new algorithms for LMS and LTS
Original language description
In this article we discuss two robust estimators - the Least Median of Squares (LMS) and the Least Trimmed Squares (LTS). For each of these estimators we mention several algorithms for their evaluation.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
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
WDS01 Proceedings of contibuted papers
ISBN
80-85863-73-1
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
21-25
Publisher name
Matfyzpress
Place of publication
Praha
Event location
Praha
Event date
Jan 1, 2001
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—