Feature uncertainty bounds for explicit feature maps and large robust nonlinear SVM classifiers
From MaRDI portal
Publication:2294606
Recommendations
- Uncertainty-safe large scale support vector machines
- Efficient methods for robust classification under uncertainty in kernel matrices
- SVM classification of uncertain data using robust multi-kernel methods
- Chance constrained uncertain classification via robust optimization
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
Cites work
- A distributional interpretation of robust optimization
- A Stochastic Approximation Method
- An introduction to support vector machines and other kernel-based learning methods.
- Approximate spectral learning using Nystrom method
- Asymptotic error bounds for kernel-based Nyström low-rank approximation matrices
- Chance constrained uncertain classification via robust optimization
- Efficient methods for robust classification under uncertainty in kernel matrices
- Fast spectral clustering via the Nyström method
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- Optimization methods for large-scale machine learning
- Revisiting the Nyström method for improved large-scale machine learning
- Robust classification and regression using support vector machines
- Robust optimization
- Robust support vector machines for classification and computational issues
- Second order cone programming approaches for handling missing and uncertain data
- Second-order cone programming
- Uncertainty-safe large scale support vector machines
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(3)
This page was built for publication: Feature uncertainty bounds for explicit feature maps and large robust nonlinear SVM classifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294606)
