Exploring Representativeness and Informativeness for Active Learning
How can we find a general way to choose the most suitable samples for training a classifier? Even with very limited prior information? Active learning, which can be regarded as an iterative optimization procedure, plays a key role to construct a refined training set to improve the classification performance in a variety of applications, such as text analysis, image recognition, social network modeling, etc. Although combining representativeness and informativeness of samples has been proven promising for active sampling, state-of-the-art methods perform well under certain data structures. Then can we find a way to fuse the two active sampling criteria without any assumption on data? This paper proposes a general active learning framework that effectively fuses the two criteria. Inspired by a two-sample discrepancy problem, triple measures are elaborately designed to guarantee that the query samples not only possess the representativeness of the unlabeled data but also reveal the diversity of the labeled data. Any appropriate similarity measure can be employed to construct the triple measures. Meanwhile, an uncertain measure is leveraged to generate the informativeness criterion, which can be carried out in different ways. Rooted in this framework, a practical active learning algorithm is proposed, which exploits a radial basis function together with the estimated probabilities to construct the triple measures and a modified Best-versus-Second-Best strategy to construct the uncertain measure, respectively. Experimental results on benchmark datasets demonstrate that our algorithm consistently achieves superior performance over the state-of-the-art active learning algorithms.
Code (0)
등록된 구현이 없습니다.
Tasks
Active LearningInformativenessSimilar Papers 제목 키워드 기반
Multi-class Active Learning: A Hybrid Informative and Representative Criterion Inspired Approach
Labeling each instance in a large dataset is extremely labor- and time- consuming . One way to alleviate this problem is active learning, which aims to which discover the most valuable instances for labeling to construct…
Active LearningInformativenessRobust Offline Active Learning on Graphs
We consider the problem of active learning on graphs, which has crucial applications in many real-world networks where labeling node responses is expensive. In this paper, we propose an offline active learning method tha…
Active LearningInformativenessIntegrating Informativeness, Representativeness and Diversity in Pool-Based Sequential Active Learning for Regression
In many real-world machine learning applications, unlabeled samples are easy to obtain, but it is expensive and/or time-consuming to label them. Active learning is a common approach for reducing this data labeling effort…
Active LearningBIG-bench Machine LearningDiversityInformativeness+1Multiple-criteria Based Active Learning with Fixed-size Determinantal Point Processes
Active learning aims to achieve greater accuracy with less training data by selecting the most useful data samples from which it learns. Single-criterion based methods (i.e., informativeness and representativeness based …
Active LearningDiversityInformativenessPoint ProcessesKnowledge Graph Enhanced Intelligent Tutoring System Based on Exercise Representativeness and Informativeness
Presently, knowledge graph-based recommendation algorithms have garnered considerable attention among researchers. However, these algorithms solely consider knowledge graphs with single relationships and do not effective…
cognitive diagnosisInformativenessKnowledge Graphs