A practical approximation algorithm for the LMS line estimator
From MaRDI portal
Publication:1019876
DOI10.1016/j.csda.2006.08.033zbMath1161.62388OpenAlexW2117499877MaRDI QIDQ1019876
David M. Mount, Ruth Silverman, Kathleen Romanik, Angela Y. Wu, Nathan S. Netanyahu
Publication date: 29 May 2009
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2006.08.033
line arrangementsapproximation algorithmsrandomized algorithmsrobust estimationline fittingleast median-of-squares regression
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Robust ridge estimator in restricted semiparametric regression models ⋮ FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES ⋮ SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression ⋮ A practical approximation algorithm for the LTS estimator ⋮ Least-trimmed squares: asymptotic normality of robust estimator in semiparametric regression models ⋮ Feasible robust estimator in restricted semiparametric regression models based on the LTS approach ⋮ On the least trimmed squares estimator ⋮ FITTING FLATS TO POINTS WITH OUTLIERS ⋮ Least quantile regression via modern optimization ⋮ On the implementation of LIR: the case of simple linear regression with interval data ⋮ Extended least trimmed squares estimator in semiparametric regression models with correlated errors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The feasible set algorithm for least median of squares regression
- An approximation algorithm for least median of squares regression
- High breakdown-point and high efficiency robust estimates for regression
- A guided tour of Chernoff bounds
- Topologically sweeping an arrangement
- Cutting hyperplane arrangements
- Randomized optimal algorithm for slope selection
- Efficient partition trees
- Efficient randomized algorithms for the repeated median line estimator
- QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS
- Least Median of Squares Regression
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Computing Least Median of Squares Regression Lines and Guided Topological Sweep
- Time- and Space-Efficient Algorithms for Least Median of Squares Regression
- An Optimal-Time Algorithm for Slope Selection
- Computing the Exact Least Median of Squares Estimate and Stability Diagnostics in Multiple Linear Regression
- A practical approach for computing the diameter of a point set
- Shape fitting with outliers
- On the least median square problem
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
This page was built for publication: A practical approximation algorithm for the LMS line estimator