Jump to Main Content
PubAg
Main content area
A practical approximation algorithm for the LTS estimator
 Author:
 Mount, David M., Netanyahu, Nathan S., Piatko, Christine D., Wu, Angela Y., Silverman, Ruth
 Source:
 Computational statistics & data analysis 2016 v.99 pp. 148170
 ISSN:
 01679473
 Subject:
 algorithms, data collection, linear models, probability analysis
 Abstract:
 The linear least trimmed squares (LTS) estimator is a statistical technique for fitting a linear model to a set of points. It was proposed by Rousseeuw as a robust alternative to the classical least squares estimator. Given a set of n points in Rd, the objective is to minimize the sum of the smallest 50% squared residuals (or more generally any given fraction). There exist practical heuristics for computing the linear LTS estimator, but they provide no guarantees on the accuracy of the final result. Two results are presented. First, a measure of the numerical condition of a set of points is introduced. Based on this measure, a probabilistic analysis of the accuracy of the best LTS fit resulting from a set of random elemental fits is presented. This analysis shows that as the condition of the point set improves, the accuracy of the resulting fit also increases. Second, a new approximation algorithm for LTS, called AdaptiveLTS, is described. Given bounds on the minimum and maximum slope coefficients, this algorithm returns an approximation to the optimal LTS fit whose slope coefficients lie within the given bounds. Empirical evidence of this algorithmâ€™s efficiency and effectiveness is provided for a variety of data sets.
 Agid:
 6075524

http://dx.doi.org/10.1016/j.csda.2016.01.016