Emotion Classification With Visibility Graphs
Description
Transformers have gained prominence in natural language processing due to their representational capabilities and performances. Transformers process natural language as a sequence on finite context windows; however, global relationships among words beyond these windows cannot be completely modeled via sequence processing only. Graph neural network (GNN) based models have been proposed to alleviate this problem, as they provide geometric extensions to neural networks, enabling models to learn associations within a text. However, regular graph-based methods ignore the sequential nature of underlying texts. In this paper, we propose EmoVis, the first generic graph-based neural network that utilizes visibility graphs, which converts classical time-series information to graph representations. We cast the problem as an emotion classification task, enabling the proposed model to learn associations between the labels and words in a sentence. Moreover, EmoVis can be used as a highly modular graph-based extension to any transformer-based model, significantly improving their performance and learning capabilities in various languages. We experimentally show that EmoVis enables transformer-based models to outperform the state-of-the-art baselines across three diverse datasets in different languages in the SemEval2018 competition datasets and the GoEmotions dataset.
Files
bib-90333b1d-613c-43c0-868a-71009768f7bb.txt
Files
(157 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:213787edad778d4d6609ab7cebf0c63d
|
157 Bytes | Preview Download |