Answers are grounded in this paper and cite their sources.
Experimental evaluation demonstrates superior text classification using biased support vector machines without negative examples, highlighting improved accuracy for partially labeled data.
We study the problem of building text classifiers using positive and unlabeled examples. The key feature of this problem is that there is no negative example for learning. Recently, a few techniques for solving this problem were proposed in the literature. These techniques are based on the same idea, which builds a classifier in two steps. Each existing technique uses a different method for each step. We first introduce some new methods for the two steps, and perform a comprehensive evaluation of all possible combinations of methods of the two steps. We then propose a more principled approach to solving the problem based on a biased formulation of SVM, and show experimentally that it is more accurate than the existing techniques.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2004) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: