Cause I'm a genial imprecise point: outlier detection for uncertain data
From MaRDI portal
Publication:831712
DOI10.1007/978-3-030-67899-9_13OpenAlexW3126691718MaRDI QIDQ831712
Ali Mohades, Hamidreza Keikha, Vahideh Keikha
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_13
Cites Work
- Covering points by disjoint boxes with outliers
- Algorithms for optimal outlier removal
- Iterated nearest neighbors and finding minimal polytopes
- Computing the smallest \(k\)-enclosing circle and related problems
- Computing a minimum-width square or rectangular annulus with outliers
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- On geometric optimization with few violated constraints
- Smallest \(k\)-enclosing rectangle revisited
- Largest bounding box, smallest diameter, and related problems on imprecise points
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
- Sorting and Selection in Posets
- Finding k points with minimum diameter and related problems
- The problem of a minimal ball enclosing k points
This page was built for publication: Cause I'm a genial imprecise point: outlier detection for uncertain data
