Abstract

Text classification based on graph neural networks (GNNs) has been widely studied by virtue of its potential to capture complex and across-granularity relations among texts of different types from learning on a text graph. Existing methods typically construct text graphs based on words-documents to capture relevant intra-class document representations among the same documents via words-words and words-documents propagation. However, a natural problem is that polysemy words in documents may become an information medium between documents of different categories, promoting heterophily information propagation. The performance of text classification will be somewhat constrained by this issue. This paper proposes a novel text classification method based on GNN from multi-granular topic-aware perspective, referred to as Text-MGNN. Specifically, topic nodes are introduced to build a triple node set of “word, document, topic,” and multi-granularity relations are modeled on a text graph for this triple node set. The introduction of topic nodes has three significant advantages. The first is to strengthen the propagation of topics, words, and documents. The second is to enhance class-aware representation learning. The final is to mitigate the effect of heterophily information caused by polysemy words. Extensive experiments are conducted on three real-world datasets. Results validate that our proposed method outperforms 11 baselines methods.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.