Benchmark testing of algorithms for very robust regression: FS, LMS and LTS

Francesca Torti, Domenico Perrotta, Anthony C. Atkinson and Marco Riani

Computational Statistics & Data Analysis, 2012, vol. 56, issue 8, 2501-2512

Abstract: The methods of very robust regression resist up to 50% of outliers. The algorithms for very robust regression rely on selecting numerous subsamples of the data. New algorithms for LMS and LTS estimators that have increased computational efficiency due to improved combinatorial sampling are proposed. These and other publicly available algorithms are compared for outlier detection. Timings and estimator quality are also considered. An algorithm using the forward search (FS) has the best properties for both size and power of the outlier tests.

Keywords: Combinatorial search; Concentration step; Forward search; Least median of squares; Least trimmed squares; Logistic plots of power; Masking; Outlier detection (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167947312000680
Full text for ScienceDirect subscribers only.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:csdana:v:56:y:2012:i:8:p:2501-2512

DOI: 10.1016/j.csda.2012.02.003

Access Statistics for this article

Computational Statistics & Data Analysis is currently edited by S.P. Azen

More articles in Computational Statistics & Data Analysis from Elsevier
Bibliographic data for series maintained by Catherine Liu ().