Robust bichromatic classification using two lines
From MaRDI portal
Cites work
- Algorithms and Computation
- Computational geometry. Algorithms and applications.
- Dynamic minimum bichromatic separating circle
- Linear Programming in Linear Time When the Dimension Is Fixed
- Low-Dimensional Linear Programming with Violations
- Minimizing the error of linear separators on linearly inseparable data
- Optimal partition trees
- Quasi-optimal range searching in spaces of finite VC-dimension
- RED-BLUE SEPARABILITY PROBLEMS IN 3D
- Separability by two lines and by nearly straight polygonal chains
- Separability of point sets by \(k\)-level linear classification trees
- Separating bichromatic point sets in the plane by restricted orientation convex hulls
- Separating objects in the plane by wedges and strips
- SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
- The complexity and approximability of finding maximum feasible subsystems of linear relations
This page was built for publication: Robust bichromatic classification using two lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7260651)
