Pages that link to "Item:Q5959967"
From MaRDI portal
The following pages link to The relaxed online maximum margin algorithm (Q5959967):
Displaying 12 items.
- An online AUC formulation for binary classification (Q408053) (← links)
- PAMR: passive aggressive mean reversion strategy for portfolio selection (Q420935) (← links)
- Online chaotic time series prediction using unbiased composite kernel machine via Cholesky factorization (Q989674) (← links)
- Tracking the best hyperplane with a simple budget perceptron (Q1009215) (← links)
- A primal-dual perspective of online learning algorithms (Q1009218) (← links)
- Online multiple kernel classification (Q1945032) (← links)
- The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers (Q2830277) (← links)
- On-line SVM learning via an incremental primal–dual technique (Q4924114) (← links)
- Online training on a budget of support vector machines using twin prototypes (Q4969713) (← links)
- On handling negative transfer and imbalanced distributions in multiple source transfer learning (Q4969942) (← links)
- Online Learning Based on Online DCA and Application to Online Classification (Q5131197) (← links)
- A family of large margin linear classifiers and its application in dynamic environments (Q6641618) (← links)
