Training and testing low-degree polynomial data mappings via linear SVM
From MaRDI portal
Recommendations
- Approximation with polynomial kernels and SVM classifiers
- A note on support vector machines with polynomial kernels
- Classification with polynomial kernels and l^1-coefficient regularization
- Hierarchical learning in polynomial support vector machines
- A linear support vector machine solver for a large number of training examples
Cited in
(9)- Analysis of classifiers' robustness to adversarial perturbations
- Isolation kernel: the X factor in efficient and effective large scale online kernel learning
- Data-independent random projections from the feature-map of the homogeneous polynomial kernel of degree two
- Far-field compression for fast kernel summation methods in high dimensions
- A fast SVD-hidden-nodes based extreme learning machine for large-scale data analytics
- Learning Aerial Image Similarity Using Triplet Networks
- Deterministic statistical mapping of sentences to underspecified semantics
- Automatic deforestation detectors based on frequentist statistics and their extensions for other spatial objects
- Scalable Gaussian kernel support vector machines with sublinear training time complexity
This page was built for publication: Training and testing low-degree polynomial data mappings via linear SVM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896086)
