On the optimal separating hyperplane for arbitrary sets: a generalization of the SVM formulation and a convex hull approach
From MaRDI portal
Publication:5034937
DOI10.1080/02331934.2020.1830089zbMath1486.90192OpenAlexW3092385526MaRDI QIDQ5034937
Mael Sachine, Ademir Alves Ribeiro
Publication date: 21 February 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1830089
convex hullsupport vector machinesinfinite setslinear separabilityarbitrary setsoptimal separating hyperplane
Cites Work
- On efficiency in convex hull of DMUs
- Random convex hulls and extreme value statistics
- Convex-hull algorithms: implementation, testing, and experimentation
- On the combinatorics of the 2-class classification problem
- Convex Polyhedra
- Linear and Nonlinear Separation of Patterns by Linear Programming
- Nonlinear Programming
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item