Shape fitting with outliers
Explore this paper's citation graph
Summary
This work proposes the first algorithms to handle outliers efficiently for the shape fitting problems considered, and relies on computing a subset of H of size of size O(k/e d-1) in near linear time.
- Type
- article
- Published
- 2003-06-08
- Cited by
- 69
- References
- 29
- OpenAlex
- https://openalex.org/W2074131282
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:7748348
Keywords
Outlier, Hyperplane, Algorithm, Approximation algorithm, Set (abstract data type)
References
- Pattern Classification
- Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
- Optimal outlier removal in high-dimensional spaces
- New lower bounds for convex hull problems in odd dimensions
- On geometric optimization with few violated constraints
- Approximating extent measures of points
- Algorithms for facility location problems with outliers
- Iterated nearest neighbors and finding minimal polytopes
- Maintaining approximate extent measures of moving points
- Support vector machines
- On Constants for Cuttings in the Plane
- Optimal outlier removal in high-dimensional
- Applications of random sampling in computational geometry, II
- Static and Dynamic Algorithms for k-Point Clustering Problems
- New applications of random sampling in computational geometry
- On Enclosing k Points by a Circle
- Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
- Approximation and exact algorithms for minimum-width annuli and shells
- On levels in arrangements and voronoi diagrams
- Low-dimensional linear programming with violations
Cited by
- Outlier Detection for DNA Fragment Assembly
- Linear Time Algorithm for Projective Clustering
- Data Imprecision in Computational Geometry
- Algorithms - ESA 2003
- epsilon-Kernel Coresets for Stochastic Points
- Approximating extent measures of points
- How to get close to the median shape
- Sub-linear Time Hybrid Approximations for Least Trimmed Squares Estimator and Related Problems
- On the Least Median Square Problem
- Order-k α-hulls and α-shapes
- Fast Algorithms for Computing the Smallest k-Enclosing Circle
- Extremal point queries with lines and line segments and related problems
- A space-optimal data-stream algorithm for coresets in the plane
- Robust Shape Fitting via Peeling and Grating Coresets
- On approximating the depth and related problems
- Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
- Faster core-set constructions and data stream algorithms in fixed dimensions
- Streaming 1-Center with Outliers in High Dimensions
- The weighted-volume derivative of a space-filling diagram
- Generalized Core Vector Machines
Related papers
- ИСПОЛЬЗОВAНИЕ ПОТЕНЦИAЛA СОЦИAЛЬНЫХ ПAРТНЕРОВ В ПОДГОТОВКЕ БУДУЩИХ ПЕДAГОГОВ
- Parallel Free Arrangements
- The hyperplanes of DH(5, q 2)
- Finding little hyperplanes in bigger ones
- The Hyperplanes of DW(5, 2)
- A characterization of the SDPS-hyperplanes of dual polar spaces
- On the partition of R^n by hyperplanes
- Covering the permutohedron by affine hyperplanes