返回
Recursive Maximum Margin Active Learning
DOI:10.1109/ACCESS.2019.2915334.png)
摘要
En 中文
Active learning is an important technique to alleviate the problem when there is abundant unlabeled data but scarce labeled data. It aims to choose the most valuable samples to label in order to build powerful predictive models with minimal supervision. However, under the setup of active learning, when the data are characterized by high-dimensional features, it will be difficult to get a reliable estimate on the model parameters, as the labeled data are limited. Most existing works tackle this problem by learning a low-dimensional representation of data before active learning, but it cannot guarantee to obtain promising results, as traditional feature extraction techniques and active learning algorithms are designed independently. In this paper, we propose an efficient hybrid active learning algorithm, called Recursive Maximum Margin Active Learning. We optimize the active learning and semi-supervised feature extraction under a unified framework to tackle the high-dimensional features' problems and select the most representative samples in the low-dimensional space. By introducing the semi-supervised maximum margin criterion into active learning, we can conduct sample selection and feature extraction recursively at each iteration of active learning to learn more accurate models. The extensive experimental results show that the proposed method outperforms several state-of-the-art active learning methods on publicly available datasets.
Keyword:
Active learning
feature extraction
representative sampling
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Performance of Selected Herbaceous Annual Ornamentals Grown at Decreasing Levels of Irrigation在灌溉水平降低的情况下生长的某些草本一年生观赏植物的性能
HortScience
IF0
Economic benefit evaluation method for the micro-grid renewable energy system operation微网可再生能源系统运行经济效益评价方法

