Graph Convolutional Networks for Text Classification
Liang Yao, Chengsheng Mao, Yuan Luo

TL;DR
This paper introduces a novel graph convolutional network approach for text classification that constructs a text graph based on word co-occurrence and document relations, outperforming existing methods especially with limited training data.
Contribution
The paper proposes a new Text GCN model that learns embeddings for words and documents jointly without external embeddings, demonstrating superior performance on benchmark datasets.
Findings
Text GCN outperforms state-of-the-art methods.
Model is robust with less training data.
Learns meaningful word and document embeddings.
Abstract
Text classification is an important and classical problem in natural language processing. There have been a number of studies that applied convolutional neural networks (convolution on regular grid, e.g., sequence) to classification. However, only a limited number of studies have explored the more flexible graph convolutional neural networks (convolution on non-grid, e.g., arbitrary graph) for the task. In this work, we propose to use graph convolutional networks for text classification. We build a single text graph for a corpus based on word co-occurrence and document word relations, then learn a Text Graph Convolutional Network (Text GCN) for the corpus. Our Text GCN is initialized with one-hot representation for word and document, it then jointly learns the embeddings for both words and documents, as supervised by the known class labels for documents. Our experimental results on…
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
TopicsTopic Modeling · Advanced Graph Neural Networks · Text and Document Classification Technologies
MethodsGraph Convolutional Network
