The Accuracy of Elemental Set Approximations for Regression

The elemental set algorithm involves performing many fits to a data set, each fit made to a subsample of size just large enough to estimate the parameters in the model. Elemental sets have been proposed as a computational device to approximate estimators in the areas of high breakdown regression and...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of the American Statistical Association Ročník 88; číslo 422; s. 580 - 589
Hlavní autor: Hawkins, Douglas M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Alexandria, VA Taylor & Francis Group 01.06.1993
American Statistical Association
Taylor & Francis Ltd
Témata:
ISSN:0162-1459, 1537-274X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The elemental set algorithm involves performing many fits to a data set, each fit made to a subsample of size just large enough to estimate the parameters in the model. Elemental sets have been proposed as a computational device to approximate estimators in the areas of high breakdown regression and multivariate location/scale estimation, where exact optimization of the criterion function is computationally intractable. Although elemental set algorithms are used widely and for a variety of problems, the quality of the approximation they give has not been studied. This article shows that they provide excellent approximations for the least median of squares, least trimmed squares, and ordinary least squares criteria. It is suggested that the approach likely will be equally effective in the other problem areas in which exact optimization of a criterion is difficult or impossible.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0162-1459
1537-274X
DOI:10.1080/01621459.1993.10476310