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

基于关键词图的弱监督文本分类

Weakly-supervised Text Classification Based on Keyword Graph

Fudan University(复旦大学);Alibaba Group(阿里巴巴集团)

Lu Zhang, Jiandong Ding, Yi Xu, Yingyao Liu, Shuigeng Zhou

摘要:

弱监督文本分类由于可以减轻标注海量数据的沉重负担,近年来受到广泛关注。其中,关键词驱动的方法是主流,利用用户提供的关键词来生成伪标签的未标记的文本。然而,现有的方法单独对待关键字,从而忽略了它们之间的相关性,这应该是有用的,如果适当利用。在本文中,我们提出了一个新的框架,称为ClassKG探索关键字关键字图的GNN关键字相关性。我们的框架是一个迭代过程。在每次迭代中,我们首先构造一个关键字图,因此分配伪标签的任务转化为注释关键字子图。为了提高标注质量,我们引入了一个自监督任务来预训练子图标注器,并对其进行微调,然后利用子图标注器生成的伪标签,训练文本分类器对未标注的文本进行分类.最后,我们从分类文本中重新提取关键词。在长文本和短文本数据集上的大量实验表明,我们的方法大大优于现有的方法

英文摘要:

Weakly-supervised text classification has received much attention in recent years for it can alleviate the heavy burden of annotating massive data. Among them, keyword-driven methods are the mainstream where user-provided keywords are exploited to generate pseudo-labels for unlabeled texts. However, existing methods treat keywords independently, thus ignore the correlation among them, which should be useful if properly exploited. In this paper, we propose a novel framework called ClassKG to explore keyword-keyword correlation on keyword graph by GNN. Our framework is an iterative process. In each iteration, we first construct a keyword graph, so the task of assigning pseudo labels is transformed to annotating keyword subgraphs. To improve the annotation quality, we introduce a self-supervised task to pretrain a subgraph annotator, and then finetune it. With the pseudo labels generated by the subgraph annotator, we then train a text classifier to classify the unlabeled texts. Finally, we re-extract keywords from the classified texts. Extensive experiments on both long-text and short-text datasets show that our method substantially outperforms the existing ones

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

↑