Combinatorial properties of support vectors of separating hyperplanes
From MaRDI portal
Publication:499715
DOI10.1007/s10472-014-9430-xzbMath1325.52006OpenAlexW2089939715MaRDI QIDQ499715
Publication date: 6 October 2015
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-014-9430-x
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other problems of combinatorial convexity (52A37)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Über diskrete und lineare Tschebyscheff-Approximationen
- Approximation in normed linear spaces
- Reliable and Efficient Computational Geometry Via Controlled Perturbation
- Hadwiger's Transversal Theorem In Higher Dimensions
- Lectures on Polytopes
- Finding the Point of a Polyhedron Closest to the Origin
- Separability and Tight Enclosure of Point Sets
- Fast Combinatorial Algorithm for Tightly Separating Hyperplanes
- Training a Support Vector Machine in the Primal
- On the Best Linear Chebyshev Approximation
This page was built for publication: Combinatorial properties of support vectors of separating hyperplanes