A space-efficient one-pass online SVM algorithm
From MaRDI portal
Cites work
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- Breaking the curse of kernelization: budgeted stochastic gradient descent for large-scale SVM training
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Fast kernel classifiers with online and active learning
- scientific article; zbMATH DE number 5957338 (Why is no real title available?)
- Incremental support vector learning: analysis, implementation and applications
- Sublinear optimization for machine learning
- Support-vector networks
This page was built for publication: A space-efficient one-pass online SVM algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6966334)