Be More with Less: Hypergraph Attention Networks for Inductive Text Classification (2020.emnlp-main)
Copied to clipboard
| Challenge: | Text classification is a critical research topic with broad applications in natural language processing. graph neural networks (GNNs) have received increasing attention but their performance is jeopardized in practice. |
| Approach: | They propose a model which captures long-distance interactions between words and a graph-based model which can be used to perform text classification. |
| Outcome: | The proposed model can achieve more expressive power with less computational consumption on the text classification task. |
Similar Papers
Text Level Graph Neural Network for Text Classification (D19-1)
Copied to clipboard
| Challenge: | Recent researches have explored graph neural network (GNN) techniques on text classification, but they are faced with the problems of fixed corpus level graph structure which don’t support online testing and high memory consumption. |
| Approach: | They propose a graph neural network model that builds graphs for each input text with global parameters sharing instead of a single graph for the whole corpus. |
| Outcome: | The proposed model outperforms existing models on several text classification datasets even with consuming less memory. |
Connecting the Dots: What Graph-Based Text Representations Work Best for Text Classification using Graph Neural Networks? (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Graph Neural Networks have been used for text classification, but only in domains with limited data characteristics. |
| Approach: | They compare graph representation methods for text classification using different architectures and setups. |
| Outcome: | The proposed graph representation methods outperform other models in document comprehension tasks. |
Deep Attention Diffusion Graph Neural Networks for Text Classification (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for text classification based on graph neural networks (GNNs) consider only one-hop neighborhoods and low-frequency information within texts, which suffer from over-smoothing issues if many graph layers are stacked. |
| Approach: | They propose a deep attention diffusion Graph Neural Network model to learn text representations by bridging the chasm of interaction difficulties between a word and its distant neighbors. |
| Outcome: | The proposed model outperforms existing methods on standard benchmark datasets on a set of textual features. |
Heterogeneous Graph Attention Networks for Semi-supervised Short Text Classification (D19-1)
Copied to clipboard
| Challenge: | Existing studies on short text classification focus on long texts and achieve unsatisfactory performance due to the sparsity and limited labeled data. |
| Approach: | They propose a heterogeneous graph neural network based method for semi-supervised short text classification that leverages the full advantage of few labeled data and large unlabeled data through information propagation along the graph. |
| Outcome: | The proposed method outperforms state-of-the-art methods across six benchmark datasets significantly. |
HyperBERT: Mixing Hypergraph-Aware Layers with Language Models for Node Classification on Text-Attributed Hypergraphs (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to learn informative data representations on text-attributed hypergraphs struggle to capture full extent of hypergraph structural information and rich linguistic attributes inherent in the nodes attributes. |
| Approach: | They propose to augment a pre-trained BERT model with specialized hypergraph-aware layers for the task of node classification. |
| Outcome: | The proposed model outperforms existing methods on five challenging text-attributed hypergraph node classification benchmarks. |
Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks (2020.acl-main)
Copied to clipboard
| Challenge: | Existing graph-based methods for text classification cannot capture contextual word relationships within each document nor can they produce inductive learning of new words. |
| Approach: | They propose to use Graph Neural Networks to learn the local word representations and then aggregate the word nodes as the document embeddings. |
| Outcome: | The proposed method outperforms state-of-the-art methods on four benchmark datasets. |
Graph Enhanced Dual Attention Network for Document-Level Relation Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Document-level relation extraction requires inter-sentence reasoning capabilities to capture local and global contextual information for multiple relation facts. |
| Approach: | They propose to characterize the interaction between sentences and potential relation instances via a Graph Enhanced Dual Attention network (GEDA) . they also propose a simple yet effective regularizer based on the natural duality of the S2R and R2S attentions, whose weights are also supervised by the supporting evidence of relation instances during training. |
| Outcome: | The proposed model achieves competitive performance on an existing large-scale dataset while the predictions can be interpretable and easily observed. |
How to Make LMs Strong Node Classifiers? (2026.findings-eacl)
Copied to clipboard
Zhe Xu, Kaveh Hassani, Si Zhang, Hanqing Zeng, Michihiro Yasunaga, Limei Wang, Dongqi Fu, Ning Yao, Bo Long, Hanghang Tong
| Challenge: | Language Models (LMs) are increasingly challenging the dominance of domain-specific models, such as Graph Neural Networks (GNNs) and Graph Transformers (GTs). |
| Approach: | They propose a novel approach that empowers off-the-shelf LMs to achieve performance comparable to state-of-the art (SOTA) GNNs on node classification tasks without requiring any architectural modifications. |
| Outcome: | The proposed approach outperforms existing GNNs on node classification tasks and is open-source upon publication. |
Simplified Graph Learning for Inductive Short Text Classification (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for short text classification are limited and lack of labeled data is not enough. |
| Approach: | They propose a novel short text classification algorithm which leverages words to handle the lack of labeled data. |
| Outcome: | The proposed model performs better with lower memory consumption and faster inference speed than previous models. |
A Hierarchical Neural Attention-based Text Classifier (D18-1)
Copied to clipboard
| Challenge: | Existing hierarchical classification models are unable to handle large corpora and the number of categories increases with increasing corpus. |
| Approach: | They propose to use external knowledge to introduce a hierarchical neural attention-based classifier to help with the classification of documents. |
| Outcome: | The proposed model performs better than or comparable to state-of-the-art hierarchical models at significantly lower computational cost while maintaining high interpretability. |