Design of the best linear classifier for box-constrained data sets
From MaRDI portal
Publication:2091432
DOI10.1007/978-3-030-87809-2_9OpenAlexW4295788408MaRDI QIDQ2091432
Publication date: 1 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-87809-2_9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear separability criterion for sets of Euclidean space
- A theorem on strict separability of convex polyhedra and its applications in optimization
- Method of successive projections for finding a common point of sets in metric spaces
- Adaptive conditional gradient method
- Necessary and sufficient conditions for emptiness of the cones of generalized support vectors
- The problem of projecting the origin of Euclidean space onto the convex polyhedron
- Robust Data Mining
- Finding the nearest point in A polytope
- Finding the Point of a Polyhedron Closest to the Origin
- A Unified Classification Model Based on Robust Optimization
This page was built for publication: Design of the best linear classifier for box-constrained data sets
