arXiv:2412.12754cs.IR2024-12中稿 · the 47th European …

用预训练模型的词元构建图,提升短文本分类效果

Token-Level Graphs for Short Text Classification

  • 基于PLM生成的词元构建文本图,捕捉上下文语义
  • 少样本下性能优于或持平现有方法,参数更少
  • 适合资源受限场景,代码开源可复现

短文本分类是信息检索中的常见子任务。近年来图机器学习的发展推动了图方法在低资源场景中的应用,但现有方法存在未考虑同一词语不同含义、受归纳式方法限制等问题。本文提出一种完全基于预训练语言模型(PLM)获取的词元构建文本图的方法。通过在建图时使用PLM对文本进行分词和嵌入,该方法能捕捉上下文与语义信息,克服词汇约束,并支持上下文相关的词义表达。相比传统PLM微调,本方法参数更少,训练更鲁棒,尤其适用于少量样本场景。实验表明,该方法在多个数据集上持续取得更高或相当的性能,推动了图方法在文本分类中的发展。为确保可复现性,所有代码已公开于GitHub。

原文摘要 · Abstract (English)

The classification of short texts is a common subtask in Information Retrieval (IR). Recent advances in graph machine learning have led to interest in graph-based approaches for low resource scenarios, showing promise in such settings. However, existing methods face limitations such as not accounting for different meanings of the same words or constraints from transductive approaches. We propose an approach which constructs text graphs entirely based on tokens obtained through pre-trained language models (PLMs). By applying a PLM to tokenize and embed the texts when creating the graph(-nodes), our method captures contextual and semantic information, overcomes vocabulary constraints, and allows for context-dependent word meanings. Our approach also makes classification more efficient with reduced parameters compared to classical PLM fine-tuning, resulting in more robust training with few samples. Experimental results demonstrate how our method consistently achieves higher scores or on-par performance with existing methods, presenting an advancement in graph-based text classification techniques. To support reproducibility of our work we make all implementations publicly available to the community\footnote{\url{https://github.com/doGregor/TokenGraph}}.

短文本分类图神经网络预训练模型少样本学习

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。