Efficient algorithms for maximum regression depth
From MaRDI portal
Publication:938312
DOI10.1007/s00454-007-9046-6zbMath1161.62043WikidataQ56970327 ScholiaQ56970327MaRDI QIDQ938312
Jack Scott Snoeyink, Peter J. Rousseeuw, Joseph S. B. Mitchell, Bettina Speckmann, Micha Sharir, Marc J. van Kreveld
Publication date: 19 August 2008
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-007-9046-6
62K05: Optimal statistical designs
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
62K25: Robust parameter designs
Related Items
Online signal extraction by robust linear regression, The complexity of hyperplane depth in the plane, Robust regression quantiles.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal slope selection via expanders
- Halfspace range search: An algorithmic application of k-sets
- On `\(k\)-sets' in the plane
- A simple algorithm for determining the envelope of a set of lines
- Randomized optimal algorithm for slope selection
- Cutting hyperplanes for divide-and-conquer
- The catline for deep regression
- Halfspace depth and regression depth characterize the empirical distribution
- Depth in an arrangement of hyperplanes
- \(k\)-sets and random hulls
- Computing depth contours of bivariate point clouds
- Improved bounds for planar \(k\)-sets and related problems
- Optimal slope selection via cuttings
- The complexity of hyperplane depth in the plane
- Robustness of deepest regression
- High-dimensional computation of the deepest location.
- The deepest regression method
- The exact fitting problem in higher dimensions
- Regression depth and center points.
- Dynamic planar convex hull operations in near-logarithmic amortized time
- Constructing Arrangements of Lines and Hyperplanes with Applications
- An Optimal-Time Algorithm for Slope Selection
- On the Zone Theorem for Hyperplane Arrangements
- Regression Depth
- On Envelopes of Arrangements of Lines
- Point sets with many \(k\)-sets
- A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
