arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1910.04385cs.CLcs.LGstat.ML
收藏

仅从相关关键字和未标记文档中学习

Learning Only from Relevant Keywords and Unlabeled Documents

The University of Tokyo(东京大学);RIKEN Center for Advanced Intelligence Project(理化学研究所先进智能项目中心);Chulalongkorn University(朱拉隆功大学)

Nontawat Charoenphakdee, Jongyeong Lee, Yiping Jin, Dittaya Wanvarie, Masashi Sugiyama

摘要:

我们考虑一个文档分类问题,文档标签是缺席的,但只有相关的关键字的目标类和未标记的文件。虽然基于伪标记的探试法已经被考虑,但对这个问题的理论理解仍然有限。此外,以前的方法不能很容易地将发达的技术在监督文本分类。在本文中,我们提出了一个理论上有保证的学习框架,该框架易于实现,并且具有灵活的模型选择,例如,线性模型或神经网络。我们展示了如何有效地优化受试者工作特征曲线(AUC)下的面积,并讨论了如何调整它来优化其他众所周知的评估指标,如准确性和F1-措施。最后,我们使用基准数据集显示我们的框架的有效性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑