无监督标签细化改进无数据文本分类
Unsupervised Label Refinement Improves Dataless Text Classification
摘要:
无数据文本分类能够通过为任何与标签描述配对的文档分配分数来将文档分类为以前看不见的标签。虽然很有前途,但它关键依赖于每个下游任务的标签集的准确描述。这种依赖导致无数据分类器对标签描述的选择高度敏感,阻碍了无数据分类在实践中的广泛应用。在本文中,我们提出了以下问题:如何使用下游任务数据集的输入来改进无数据文本分类?我们的主要解决方案是基于聚类的方法。给定一个无数据分类器,我们的方法使用k-means聚类改进其预测集。我们证明了我们的方法的广泛适用性,通过提高性能的两个广泛使用的分类器架构,一个编码文本类别对两个独立的编码器和一个单一的联合编码器。实验表明,我们的方法一致地提高了跨不同数据集的无数据分类,并使分类器对标签描述的选择更具鲁棒性。
英文摘要:
Dataless text classification is capable of classifying documents into previously unseen labels by assigning a score to any document paired with a label description. While promising, it crucially relies on accurate descriptions of the label set for each downstream task. This reliance causes dataless classifiers to be highly sensitive to the choice of label descriptions and hinders the broader application of dataless classification in practice. In this paper, we ask the following question: how can we improve dataless text classification using the inputs of the downstream task dataset? Our primary solution is a clustering based approach. Given a dataless classifier, our approach refines its set of predictions using k-means clustering. We demonstrate the broad applicability of our approach by improving the performance of two widely used classifier architectures, one that encodes text-category pairs with two independent encoders and one with a single joint encoder. Experiments show that our approach consistently improves dataless classification across different datasets and makes the classifier more robust to the choice of label descriptions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。