Theory of linear and integer programming
Theory of linear and integer programming
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
The colored Tverberg's problem and complexes of injective functions
Journal of Combinatorial Theory Series A
The nature of statistical learning theory
The nature of statistical learning theory
A Subexponential Algorithm for Abstract Optimization Problems
SIAM Journal on Computing
Machine Learning
Handbook of discrete and computational geometry
Fast training of support vector machines using sequential minimal optimization
Advances in kernel methods
Proceedings of the sixteenth annual symposium on Computational geometry
A Tutorial on Support Vector Machines for Pattern Recognition
Data Mining and Knowledge Discovery
Duality and Geometry in SVM Classifiers
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
The Centroid of Points with Approximate Weights
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Neural Computation
Input space versus feature space in kernel-based methods
IEEE Transactions on Neural Networks
A fast iterative nearest point algorithm for support vector machine classifier design
IEEE Transactions on Neural Networks
Zonotope/Hyperplane Intersection for Hybrid Systems Reachability Analysis
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Algorithms for the Computation of Reduced Convex Hulls
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
We make a connection between classical polytopes called zonotopes and Support Vector Machine (SVM) classifiers. We combine this connection with the ellipsoid method to give some new theoretical results on training SVMs. We also describe some special properties of C-SVMs for C → ∞.