Support vector machines in the Hilbert geometry
From MaRDI portal
Cites work
- A combinatorial bound for linear programming and related problems
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
- Clustering in Hilbert's projective geometry: the case studies of the probability simplex and the elliptope of correlation matrices
- Computer vision. Algorithms and applications
- Convex approximation and the Hilbert geometry
- Delaunay triangulations in the Hilbert metric
- Economical convex coverings and applications
- Economical Delone sets for approximating convex bodies
- Handbook of Hilbert geometry
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- Kernel methods in machine learning
- Las Vegas algorithms for linear and integer programming when the dimension is small
- On a class of pattern recognition learning algorithms
- On balls in a Hilbert polygonal geometry
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- Scattered Data Approximation
- Small-dimensional linear programming and convex hulls made easy
- Support vector machine active learning with applications to text classification
- Support Vector Machines
- Support-vector networks
- Training invariant support vector machines
- Ueber die gerade Linie als kürzestes Verbindung zweier Punkte.
- Voronoi diagrams in the Hilbert metric
This page was built for publication: Support vector machines in the Hilbert geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312549)
