Learning Only from Relevant Keywords and Unlabeled Documents
Preprint
Abstract
We consider a document classification problem where document labels are absent but only relevant keywords of a target class and unlabeled documents are given. Although heuristic methods based on pseudo-labeling have been considered, theoretical understanding of this problem has still been limited. Moreover, previous methods cannot easily incorporate well-developed techniques in supervised text classification. In this paper, we propose a theoretically guaranteed learning framework that is simple to implement and has flexible choices of models, e.g., linear models or neural networks. We demonstrate how to optimize the area under the receiver operating characteristic curve (AUC) effectively and also discuss how to adjust it to optimize other well-known evaluation metrics such as the accuracy and F1-measure. Finally, we show the effectiveness of our framework using benchmark datasets.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- A brief introduction to weakly supervised learningNational Science Review, 2017
- Dataless Text Classification with Descriptive LDAProceedings of the AAAI Conference on Artificial Intelligence, 2015
- On Dataless Hierarchical Text ClassificationProceedings of the AAAI Conference on Artificial Intelligence, 2014
- Mining and summarizing customer reviews2004
- Statistical behavior and consistency of classification methods based on convex risk minimizationThe Annals of Statistics, 2004
- Optimising area under the ROC curve using gradient descent2004
- On the difficulty of approximately maximizing agreementsJournal of Computer and System Sciences, 2003
- Machine learning in automated text categorizationACM Computing Surveys, 2002
- Text Classification from Labeled and Unlabeled Documents using EMMachine Learning, 2000
- NewsWeeder: Learning to Filter Netnews1995