Learning Only from Relevant Keywords and Unlabeled Documents
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1.
3 papers.
- 2021A Neural Few-Shot Text Classification Reality Checkcited by 6
- 2021A Symmetric Loss Perspective of Reliable Machine Learningcited by 0
- 2022Revealing Reliable Signatures by Learning Top-Rank Pairscited by 0
- 2022Revealing Reliable Signatures by Learning Top-Rank Pairs17 Mar 2022
- 2021A Neural Few-Shot Text Classification Reality Check28 Jan 2021
- 2021A Symmetric Loss Perspective of Reliable Machine Learning5 Jan 2021