A random least-trimmed-squares identification algorithm (Q1400949)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1965021
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A random least-trimmed-squares identification algorithm |
scientific article; zbMATH DE number 1965021 |
Statements
A random least-trimmed-squares identification algorithm (English)
0 references
17 August 2003
0 references
The least-trimmed-squares (LTS) estimator is a robust estimator in terms of protecting the estimate from the outliers, but it possesses a high computational complexity. The author proposes a random LTS algorithm having a low computational complexity and that can be calculated a priori as a function of the required error bound and the confidence interval. If the number of data points goes to infinity then the algorithm becomes a deterministic one, converging to the true LTS in some probability sense.
0 references
least squares estimation
0 references
least trimmed squares estimation
0 references
random algorithms
0 references
system identification
0 references
parameter estimation
0 references
0 references
0 references
0.8807048797607422
0 references
0.8315234780311584
0 references
0.8092926740646362
0 references
0.8092926740646362
0 references
0.8003103137016296
0 references
