A fast algorithm for robust regression with penalised trimmed squares
From MaRDI portal
(Redirected from Publication:650724)
Abstract: The presence of groups containing high leverage outliers makes linear regression a difficult problem due to the masking effect. The available high breakdown estimators based on Least Trimmed Squares often do not succeed in detecting masked high leverage outliers in finite samples. An alternative to the LTS estimator, called Penalised Trimmed Squares (PTS) estimator, was introduced by the authors in cite{ZiouAv:05,ZiAvPi:07} and it appears to be less sensitive to the masking problem. This estimator is defined by a Quadratic Mixed Integer Programming (QMIP) problem, where in the objective function a penalty cost for each observation is included which serves as an upper bound on the residual error for any feasible regression line. Since the PTS does not require presetting the number of outliers to delete from the data set, it has better efficiency with respect to other estimators. However, due to the high computational complexity of the resulting QMIP problem, exact solutions for moderately large regression problems is infeasible. In this paper we further establish the theoretical properties of the PTS estimator, such as high breakdown and efficiency, and propose an approximate algorithm called Fast-PTS to compute the PTS estimator for large data sets efficiently. Extensive computational experiments on sets of benchmark instances with varying degrees of outlier contamination, indicate that the proposed algorithm performs well in identifying groups of high leverage outliers in reasonable computational time.
Recommendations
- Penalized trimmed squares and a modification of support vectors for unmasking outliers in linear regression
- New algorithms for computing the least trimmed squares regression estimator
- On the least trimmed squares estimator
- The feasible solution algorithm for least trimmed squares regression
- Quadratic mixed integer programming and support vectors for deleting outliers in robust regression
Cites work
- {{#invoke:WikidataIB|getLink|Q3673862}} scientific article; zbMATH DE number 3829050 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q4322326}} scientific article; zbMATH DE number 720678 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q4692741}} scientific article; zbMATH DE number 194744 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q3142129}} A Bounded Influence, High Breakdown, Efficient Regression Estimator
- {{#invoke:WikidataIB|getLink|Q3625277}} A Comparison of Multiple Outlier Detection Methods for Regression Data
- {{#invoke:WikidataIB|getLink|Q4541221}} A Fast Procedure for Outlier Diagnostics in Large Regression Problems
- {{#invoke:WikidataIB|getLink|Q2903217}} A Re-Weighted Least Squares Method for Robust Regression Estimation
- {{#invoke:WikidataIB|getLink|Q1848950}} A class of robust and fully efficient regression estimators
- {{#invoke:WikidataIB|getLink|Q1128901}} A clustering algorithm for identifying multiple outliers in linear regression.
- {{#invoke:WikidataIB|getLink|Q1387682}} A one-step robust estimator for regression based on the weighted likelihood reweighting scheme
- {{#invoke:WikidataIB|getLink|Q957150}} An algorithm for computing exact least-trimmed squares estimate of simple linear regression with constraints
- {{#invoke:WikidataIB|getLink|Q1583192}} BACON: blocked adaptive computationally efficient outlier nominators.
- {{#invoke:WikidataIB|getLink|Q2508026}} Deleting outliers in robust regression with mixed integer programming
- {{#invoke:WikidataIB|getLink|Q4085133}} Detecting Outliers. II. Supplementing the Direct Analysis of Residuals
- {{#invoke:WikidataIB|getLink|Q4323561}} Fast Very Robust Methods for the Detection of Multiple Outliers
- {{#invoke:WikidataIB|getLink|Q1804580}} Greedy randomized adaptive search procedures
- {{#invoke:WikidataIB|getLink|Q3793524}} High Breakdown-Point Estimates of Regression by Means of the Minimization of an Efficient Scale
- {{#invoke:WikidataIB|getLink|Q578791}} High breakdown-point and high efficiency robust estimates for regression
- {{#invoke:WikidataIB|getLink|Q1285475}} Improved feasible solution algorithms for high breakdown estimation.
- {{#invoke:WikidataIB|getLink|Q3339116}} Least Median of Squares Regression
- {{#invoke:WikidataIB|getLink|Q1876766}} Least trimmed squares regression, least median squares regression, and mathematical program\-ming
- {{#invoke:WikidataIB|getLink|Q5941333}} New algorithms for computing the least trimmed squares regression estimator
- {{#invoke:WikidataIB|getLink|Q5429819}} Penalized trimmed squares and a modification of support vectors for unmasking outliers in linear regression
- {{#invoke:WikidataIB|getLink|Q1361543}} The feasible solution algorithm for least trimmed squares regression
Cited in
(5)- Leveraged least trimmed absolute deviations
- Optimization techniques for robust multivariate location and scatter estimation
- A comparison of some quick algorithms for robust regression
- Penalized trimmed squares and a modification of support vectors for unmasking outliers in linear regression
- A robust regression based on weighted LSSVM and penalized trimmed squares
This page was built for publication: A fast algorithm for robust regression with penalised trimmed squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650724)
