Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/22645 
Year of Publication: 
2006
Series/Report no.: 
Technical Report No. 2005,52
Publisher: 
Universität Dortmund, Sonderforschungsbereich 475 - Komplexitätsreduktion in Multivariaten Datenstrukturen, Dortmund
Abstract: 
In modern statistics, the robust estimation of parameters of a regression hyperplane is a central problem. Robustness means that the estimation is not or only slightly affected by outliers in the data. In this paper, it is shown that the following robust estimators are hard to compute: LMS, LQS, LTS, LTA, MCD, MVE, Constrained M estimator, Projection Depth (PD) and Stahel-Donoho. In addition, a data set is presented such that the ltsReg-procedure of R has probability less than 0.0001 of finding a correct answer. Furthermore, it is described, how to design new robust estimators.
Subjects: 
Computational statistics
complexity theory
robust statistics
algorithms
search heuristics
Document Type: 
Working Paper

Files in This Item:
File
Size
300.96 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.