. We make a connection between classical polytopes called
|
5044
|
Statistical Learning Theory
– Vapnik
- 1998
|
|
1240
|
A tutorial on support vector machines for pattern recognition
– Burges
- 1998
|
|
1091
|
Support-vector network
– Cortes, Vapnik
- 1995
|
|
986
|
Theory of Linear and Integer Programming
– Schrijver
- 1986
|
|
602
|
Algorithms in Combinatorial Geometry
– Edelsbrunner
- 1987
|
|
544
|
Fast training of support vector machines using sequential minimal optimization. Advances in kernel methods – support vector learning
– Platt
- 1998
|
|
173
|
New support vector algorithms
– Scholkopf, Smola, et al.
- 2000
|
|
126
|
A subexponential bound for linear programming
– Matousek, Sharir, et al.
- 1992
|
|
86
|
Input space vs. feature space in kernel-based methods
– Scholkopf, Mika, et al.
- 1999
|
|
48
|
A fast iterative nearest point algorithm for support vector machine classifier design
– Keerthi, Shevade, et al.
- 2000
|
|
47
|
The colored Tverberg’s problem and complexes of injective functions
– Živaljević, Vrećica
- 1992
|
|
33
|
A subexponential algorithm for abstract optimization problems
– Gärtner
- 1995
|
|
30
|
Duality and geometry in SVM classifiers
– Bennett, Bredensteiner
- 2000
|
|
30
|
sets with many k-sets
– Point
- 2000
|
|
20
|
Polynomial solvability of convex quadratic programming
– Kozlov, Tarasov, et al.
- 1979
|
|
12
|
The centroid of points with approximate weights
– Bern, Eppstein, et al.
- 1995
|
|
11
|
A geometric interpretation of ν-SVM classifiers
– Crisp, Burges
- 2000
|
|
5
|
A geometric interpretation of -SVM classi
– Crisp, Burges
- 2000
|
|
2
|
Duality, and Geometry in SVM Classi
– Bennett
- 2000
|
|
1
|
Support Vector Machines. Cambridge U
– Cristianini, Shawe-Taylor
|