The reviewed record of science sign in
Pith

arxiv: 2002.01771 · v1 · pith:VE4SJ4FH · submitted 2020-02-05 · stat.ML · cs.LG

Online Passive-Aggressive Total-Error-Rate Minimization

Reviewed by Pithpith:VE4SJ4FHopen to challenge →

classification stat.ML cs.LG
keywords learningonlinealgorithmdatapateralgorithmsclassificationminimization
0
0 comments X
read the original abstract

We provide a new online learning algorithm which utilizes online passive-aggressive learning (PA) and total-error-rate minimization (TER) for binary classification. The PA learning establishes not only large margin training but also the capacity to handle non-separable data. The TER learning on the other hand minimizes an approximated classification error based objective function. We propose an online PATER algorithm which combines those useful properties. In addition, we also present a weighted PATER algorithm to improve the ability to cope with data imbalance problems. Experimental results demonstrate that the proposed PATER algorithms achieves better performances in terms of efficiency and effectiveness than the existing state-of-the-art online learning algorithms in real-world data sets.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.