Scalable Gaussian kernel support vector machines with sublinear training time complexity
From MaRDI portal
(Redirected from Publication:780936)
Recommendations
- A comparative study on large scale kernelized support vector machines
- Core vector machines: fast SVM training on very large data sets
- Stochastic subgradient estimation training for support vector machines
- Scaling kernel-based systems to large data sets
- Fast training of support vector machines with Gaussian kernel
Cites work
- scientific article; zbMATH DE number 3174732 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- 10.1162/153244303321897690
- 10.1162/1532443041827925
- A matrix-free smoothing algorithm for large-scale support vector machines
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
- Adaptive sampling methods for scaling up knowledge discovery algorithms
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Granularity selection for cross-validation of SVM
- Hybrid MPI/OpenMP parallel linear support vector machine training
- LIBLINEAR: a library for large linear classification
- On Approximation Algorithms for Data Mining Applications
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- Optimal rates for the regularized least-squares algorithm
- Training and testing low-degree polynomial data mappings via linear SVM
Cited in
(3)
This page was built for publication: Scalable Gaussian kernel support vector machines with sublinear training time complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780936)