4.3 Article

On the Least Trimmed Squares Estimator

期刊

ALGORITHMICA
卷 69, 期 1, 页码 148-183

出版社

SPRINGER
DOI: 10.1007/s00453-012-9721-8

关键词

Robust estimation; Linear estimation; Least trimmed squares estimator; Approximation algorithms; Lower bounds

资金

  1. NSF [CCF-1117259]
  2. ONR [N00014-08-1-1015]
  3. Division of Computing and Communication Foundations
  4. Direct For Computer & Info Scie & Enginr [1117259] Funding Source: National Science Foundation

向作者/读者索取更多资源

The linear least trimmed squares (LTS) estimator is a statistical technique for fitting a linear model to a set of points. Given a set of n points in ae (d) and given an integer trimming parameter ha parts per thousand currency signn, LTS involves computing the (d-1)-dimensional hyperplane that minimizes the sum of the smallest h squared residuals. LTS is a robust estimator with a 50 %-breakdown point, which means that the estimator is insensitive to corruption due to outliers, provided that the outliers constitute less than 50 % of the set. LTS is closely related to the well known LMS estimator, in which the objective is to minimize the median squared residual, and LTA, in which the objective is to minimize the sum of the smallest 50 % absolute residuals. LTS has the advantage of being statistically more efficient than LMS. Unfortunately, the computational complexity of LTS is less understood than LMS. In this paper we present new algorithms, both exact and approximate, for computing the LTS estimator. We also present hardness results for exact and approximate LTS. A number of our results apply to the LTA estimator as well.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据