QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS
From MaRDI portal
Publication:2708040
DOI10.1142/S0218195900000334zbMath0969.68168MaRDI QIDQ2708040
David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
Publication date: 5 July 2001
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
robust estimation; minimum volume ellipsoid; LMS regression; minimum enclosing disk; minimum volume annulus estimator; minimum volume ball
62G08: Nonparametric regression and quantile regression
62G35: Nonparametric robustness
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES, On the least trimmed squares estimator, Least quantile regression via modern optimization, Minimum-volume enclosing ellipsoids and core sets, A practical approximation algorithm for the LMS line estimator
Cites Work
- The feasible set algorithm for least median of squares regression
- Enclosing \(k\) points in the smallest axis parallel rectangle
- High breakdown-point and high efficiency robust estimates for regression
- On enclosing k points by a circle
- A simple algorithm for computing the smallest enclosing circle
- Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden
- Efficient partition trees
- Fitting a set of points by a circle
- Iterated nearest neighbors and finding minimal polytopes
- A subexponential bound for linear programming
- Finding k points with minimum diameter and related problems
- Least Median of Squares Regression
- Finding minimal enclosing boxes
- An optimal algorithm for finding minimal enclosing triangles
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- Minimum Covering Ellipses
- Optimal design: Some geometrical aspects of D-optimality
- Applications of Parametric Searching in Geometric Optimization
