构建仅含词节点的判别性图,用路径分类提升文本分类效果
Graph Neural Networks on Discriminative Graphs of Words
- 基于标签划分语料,仅用词节点构造判别性图,边权由词共现信息确定
- 在7个基准数据集上性能略逊于先进基线模型,但理论机制清晰
- 适合研究图结构与文本分类关系、追求可解释性的学者
鉴于图神经网络(GNN)在复杂数据结构上推理的成功,许多研究将其应用于文本分类任务。以往方法通常构建包含词节点和文档节点的异质图,利用GNN对文档节点进行分类。本文提出一种新的判别性词图图神经网络(DGoW-GNN),包含创新的图构建方式与模型设计。在图构建中,仅使用词节点,将训练语料按标签划分为互不连通的子图,并以点互信息(PMI)为边权重。该构建方法具有理论依据,可将文本分类任务转化为路径分类任务。同时提出结合GNN与序列模型的新分类框架。在7个基准数据集上的实验表明,其性能低于多个先进基线模型。通过分析差异原因,推测在特定条件下性能可能改善。
原文摘要 · Abstract (English)
In light of the recent success of Graph Neural Networks (GNNs) and their ability to perform inference on complex data structures, many studies apply GNNs to the task of text classification. In most previous methods, a heterogeneous graph, containing both word and document nodes, is constructed using the entire corpus and a GNN is used to classify document nodes. In this work, we explore a new Discriminative Graph of Words Graph Neural Network (DGoW-GNN) approach encapsulating both a novel discriminative graph construction and model to classify text. In our graph construction, containing only word nodes and no document nodes, we split the training corpus into disconnected subgraphs according to their labels and weight edges by the pointwise mutual information of the represented words. Our graph construction, for which we provide theoretical motivation, allows us to reformulate the task of text classification as the task of walk classification. We also propose a new model for the graph-based classification of text, which combines a GNN and a sequence model. We evaluate our approach on seven benchmark datasets and find that it is outperformed by several state-of-the-art baseline models. We analyse reasons for this performance difference and hypothesise under which conditions it is likely to change.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。