The relaxed online maximum margin algorithm
From MaRDI portal
Publication:5959967
DOI10.1023/A:1012435301888zbMath0998.68110MaRDI QIDQ5959967
Publication date: 11 April 2002
Published in: Machine Learning (Search for Journal in Brave)
Related Items (11)
An online AUC formulation for binary classification ⋮ PAMR: passive aggressive mean reversion strategy for portfolio selection ⋮ Online multiple kernel classification ⋮ Online Learning Based on Online DCA and Application to Online Classification ⋮ On-line SVM learning via an incremental primal–dual technique ⋮ Online chaotic time series prediction using unbiased composite kernel machine via Cholesky factorization ⋮ Tracking the best hyperplane with a simple budget perceptron ⋮ A primal-dual perspective of online learning algorithms ⋮ Online training on a budget of support vector machines using twin prototypes ⋮ On handling negative transfer and imbalanced distributions in multiple source transfer learning ⋮ The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers
Uses Software
This page was built for publication: The relaxed online maximum margin algorithm
