Online Multi-label Passive Aggressive Active Learning Algorithm Based on Binary Relevance

Online multi-label learning is an efficient classification paradigm in machine learning. However, traditional online multi-label methods often need requesting all class labels of each incoming sample, which is often human cost and time-consuming in labeling classification problem. In order to tackle these problems, in this paper, we present online multi-label passive aggressive active (MLPAA) learning algorithm by combining binary relevance (BR) decomposition strategy with online passive aggressive active (PAA) method. The proposed MLPAA algorithm not only uses the misclassified labels to update the classifier, but also exploits correctly classified examples with low prediction confidence. We perform extensive experimental comparison for our algorithm and the other methods using nine benchmark data sets. The encouraging results of our experiments validate the effectiveness of our proposed method.