Online Adaptive Asymmetric Active Learning With Limited Budgets
- 22 November 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 33 (6) , 2680-2692
Abstract
Online Active Learning (OAL) aims to manage unlabeled datastream by selectively querying the label of data. OAL is applicable to many real-world problems, such as anomaly detection in health-care and finance. In these problems, there are two key challenges: the query budget is often limited; the ratio between classes is highly imbalanced. In practice, it is quite difficult to handle imbalanced unlabeled datastream when only a limited budget of labels can be queried for training. To solve this, previous OAL studies adopt either asymmetric losses or queries (an isolated asymmetric strategy) to tackle the imbalance, and use first-order methods to optimize the cost-sensitive measure. However, the isolated strategy limits their performance in class imbalance, while first-order methods restrict their optimization performance. In this article, we propose a novel Online Adaptive Asymmetric Active learning algorithm, based on a new asymmetric strategy (merging both asymmetric losses and queries strategies), and second-order optimization. We theoretically analyze its mistake bound and cost-sensitive metric bounds. Moreover, to better balance performance and efficiency, we enhance our algorithm via a sketching technique, which significantly accelerates the computational speed with quite slight performance degradation. Promising results demonstrate the effectiveness and efficiency of the proposed methods.Keywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (61602185, 61502177, 61876208)
- NSFC (61836003)
- Guangdong Introducing Innovative and Enterpreneurial Teams (2017ZT07X183)
- Guangdong Provincial Scientific and Technological Funds (2018B010107001, 2017B090901008, 2017A010101011, 2017B090910005)
- T Nova Program of Guangzhou (201806010081)
- Tencent AI Lab Rhino-Bird Focused Research Program (JR201902)
- CCF-Tencent Open Research Fund (RAGR20170105)
This publication has 22 references indexed in Scilit:
- High-Dimensional Data Stream Classification via Sparse Online Learning2014
- Applying Cost-Sensitive Classification for Financial Fraud Detection under High Class-Imbalance2014
- Sketching as a Tool for Numerical Linear AlgebraFoundations and Trends® in Theoretical Computer Science, 2014
- Cost-sensitive online active learning with application to malicious URL detection2013
- Cost-Sensitive Double Updating Online Learning and Its Application to Online Anomaly Detection2013
- Why label when you can search?2010
- Batch mode active learning and its application to medical image classification2006
- A Second-Order Perceptron AlgorithmSIAM Journal on Computing, 2005
- On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrixJournal of Mathematical Analysis and Applications, 1985
- Simplified neuron model as a principal component analyzerJournal of Mathematical Biology, 1982