.png){kind=icon}
返回
Online binary classification from similar and dissimilar data
.png){kind=icon}
PRE
AI
DOI：10.1007/s10994-023-06434-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Similar-dissimilar (SD) classification aims to train a binary classifier from only similar and dissimilar data pairs, which indicate whether two instances belong to the same class (similar) or not (dissimilar). Although effective learning methods have been proposed for SD classification, they cannot deal with online learning scenarios with sequential data that can be frequently encountered in real-world applications. In this paper, we provide the first attempt to investigate the online SD classification problem. Specifically, we first adapt the unbiased risk estimator of SD classification to online learning scenarios with a conservative regularization term, which could serve as a naive method to solve the online SD classification problem. Then, by further introducing a margin criterion for whether to update the classifier or not with the received cost, we propose two improvements (one with linearly scaled cost and the other with quadratically scaled cost) that result in two online SD classification methods. Theoretically, we derive the regret, mistake, and relative loss bounds for our proposed methods, which guarantee the performance on sequential data. Extensive experiments on various datasets validate the effectiveness of our proposed methods.
Keyword:
Similar-dissimilar classification
Unbiased risk estimator
Passive-aggressive method
Online learning
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
Streptozotocin-induced diabetes is associated with altered expression of peptide-encoding mRNAs in rat sensory neurons.png)
Peptides
PeptidesIF0
PREAI
分享收藏Thermal Phase Stability and Catalytic Properties of Nanostructured TiO2-MgO Sol–Gel Mixed Oxides
PREAI
分享收藏
分享收藏Gradient-based learning applied to document recognition基于梯度的学习在文档识别中的应用PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏分享收藏
查看更多内容