A new samples selecting method based on K nearest neighbors

Short text classification uses a supervised learning process, and it needs a huge amount of labeled data for training. This process consumes a lot of human resources. In traditional supervised learning problems, active learning can reduce the amount of samples that need to be labeled manually. It achieves this goal by selecting the most representative samples to represent the whole training set. Uncertainty sampling is the most popular way in active learning, but it has poor performance when it is affected by outliers. In our paper, we propose a new sampling method for training sets containing short text, which is denoted as Top-K Representative (TKR). However, the optimization process of TKR is a N-P hard problem. To solve this problem, a new algorithm, based on the greedy algorithm, is proposed to obtain the approximating results. The experiments show that our proposed sampling method performs better than the state-of-the-art methods.