Word Grounded Graph Convolutional Network
Zhibin Lu, Qianqian Xie, Benyou Wang, Jian-yun Nie

TL;DR
This paper introduces a word-grounded graph convolutional network (WGCN) that leverages a word-level graph to improve text classification, especially for out-of-graph documents, by decoupling data samples from the model.
Contribution
The paper proposes transforming document graphs into word graphs to enable inductive learning and handle out-of-graph documents effectively.
Findings
WGCN outperforms existing methods in text classification tasks.
The model effectively incorporates global semantic dependencies.
WGCN demonstrates improved efficiency in learning representations.
Abstract
Graph Convolutional Networks (GCNs) have shown strong performance in learning text representations for various tasks such as text classification, due to its expressive power in modeling graph structure data (e.g., a literature citation network). Most existing GCNs are limited to deal with documents included in a pre-defined graph, i.e., it cannot be generalized to out-of-graph documents. To address this issue, we propose to transform the document graph into a word graph, to decouple data samples (i.e., documents in training and test sets) and a GCN model by using a document-independent graph. Such word-level GCN could therefore naturally inference out-of-graph documents in an inductive way. The proposed Word-level Graph (WGraph) can not only implicitly learning word presentation with commonly-used word co-occurrences in corpora, but also incorporate extra global semantic dependency…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Topic Modeling · Text and Document Classification Technologies
MethodsTest · Graph Convolutional Network
