Title
An Active Learning Based on Uncertainty and Density Method for Positive and Unlabeled Data.
Abstract
Active learning can select most informative unlabeled samples to manually annotate to enlarge the training set. Many active learning methods have been proposed so far, most of them work for these data that have all classes of tagged data. A few methods work for positive and unlabeled data and the computational complexity of existing methods is particularly high and they can’t work well for big data. In this paper, we proposed an active learning approach that works well when only small number positive data are available in big data. We utilize data preprocessing to remove most of the outliers, so the density calculation is simplified relative to KNN algorithm, and our proposed sample selection strategy Min-Uncertainty Density (MDD) can help select more uncertain and higher density unlabeled samples with less computation. A combined semi-supervised learning active learning technique (MDD-SSAL) automatically annotating some confident unlabeled samples in the each iteration is proposed to reduce the number of manually annotated samples. Experimental results indicate that our proposed method is competitive with other similar methods.
Year
Venue
Field
2018
ICA3PP
k-nearest neighbors algorithm,Active learning,Semi-supervised learning,Computer science,Parallel computing,Outlier,Data pre-processing,Artificial intelligence,Big data,Machine learning,Computational complexity theory,Computation
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
15
3
Name
Order
Citations
PageRank
Jun Luo113917.61
Wenan Zhou25019.20
Yu Du36510.11