Emotion Classification With Visibility Graphs
Open accessAbstract
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.
Verifying this paper
8 of 9 steps done · this page updates itself — you can leave and come back
- Registry recordVerified
- Full textRead the full text
- Reference list48 references found
- Reference checkChecking each cited work — 54 of 54
- StatisticsRecomputed
- Claims28 claims anchored to a quote
- Cited sourcesChecked
- Self-checkChecked
- VerificationFindings verified
AI snapshot
Written from the paper’s full text.
TL;DR
EmoVis is a modular visibility-graph/GCN extension for transformer-based multi-label emotion classification that preserves sentence order via directed vector visibility graphs. It improves transformer models and reportedly outperforms state-of-the-art baselines on SemEval2018 English/Arabic/Spanish and GoEmotions.
Key findings
- EmoVis schemes consistently improve F1-Macro, F1-Micro, and Jaccard index (JS) for each tested transformer model on the SemEval2018 MLEC tasks; EmoVis_lin boosts vanilla models’ F1-Micro scores by up to 4.28%.
- The paper presents EmoVis as the first generic graph-based model using visibility graphs for MLEC across languages, and as a plug-in that can enhance any transformer-based model.
- SemEval2018 languages all have 11 emotion classes; GoEmotions has 28 emotion classes, and EmoVis_lin is reported to improve transformer performance on GoEmotions, with full details in the Supplementary Material.
- The abstract claims EmoVis enables transformer-based models to outperform state-of-the-art baselines across three diverse datasets in different languages in SemEval2018 and the GoEmotions dataset.
Methods
- Sentences are preprocessed/tokenized, passed through a transformer encoder (TwHIN-BERT-Base) to produce contextual embeddings \(X_{BERT} \in \mathbb{R}^{N \times M}\); each token vector becomes a node in a directed vector visibility graph (VVG) using projection-based visibility, then normalized node embeddings and adjacency matrices are fed to a GCN with SAGEConv, ReLU, batch normalization, global max pooling, dropout, and a linear layer.
- Three integration schemes—EmoVis_lin, EmoVis_nonlin, EmoVis_concat—combine graph and transformer outputs with interpolation coefficient \(\lambda\), apply sigmoid, and threshold at 0.5; training uses label-correlation aware (LCA) loss.
- Experiments use SemEval2018 English/Arabic/Spanish (11 emotion classes) and GoEmotions (28 classes); fine-tuned models include TwHIN-BERT-Base, BERT-Base variants, RoBERTa-Base (English only), and XLM-RoBERTa-Base; Adam optimizer with learning rate 1.421e-3, batch size 58, 20/18/16 epochs for English/Arabic/Spanish, dropout 0.1675, hidden channel size 128, context window 128; metrics are Micro F1, macro F1, and Jaccard index.
Limitations
- The paper does not include an explicit limitations section.
- The paper states the context window is set to 128 to balance performance with computational efficiency, which bounds the modeled context.
- Evident from the text: full analyses of standalone EmoVis, parameter counts, ablations with state-of-the-art plug-in models, interpolation coefficients, GoEmotions results, and comparisons of graph convolution layers are deferred to the Supplementary Material, so the main text does not provide those details; the provided text also references Table I but does not include the table itself, so exact per-model/per-language scores cannot be verified from the supplied text.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
20 of 26 cited sources checked · 8 supported · 0 flagged · accuracy not yet measured
- Premisecitation
Integrating external domain knowledge into emotion recognition models is usually a complex and time-consuming process.
“However, integrating external domain knowledge into emotion recognition models is usually a complex and timeconsuming process [19].”
Quote in the paperSubstantial claim1 of 1 sources checked- cites [19] source
The Introduction (‘Focus of the paper’; page not provided) describes increasing complexity in ways of incorporating domain knowledge, and ‘Challenges and concluding remarks’ identifies technical difficulties. The passages do not establish that integration is usually time-consuming or address emotion recognition models specifically. (LLM, conf=0.84)
Experimental — accuracy not yet measured
- Premisecitation
Visibility graphs offer an effective means of representing sequential signals by connecting data points according to their value-based visibility, thereby preserving the underlying temporal structure while introducing geometric relationships.
“To this end, visibility graphs offer an effective means of representing sequential signals by connecting data points according to their value-based visibility, thereby preserving the underlying temporal structure while introducing geometric relationships [22], [23].”
Quote in the paperSubstantial claim1 of 2 sources checked - Premisecitation
Incorporating a significant number of graph convolution layers in network architectures can result in over-smoothing of dataset features, thereby diminishing the performance of the training process.
“As for the GNN-based approaches, incorporating a significant number of graph convolution layers in network architectures can result in over-smoothing of dataset features, thereby diminishing the performance of the training process [20].”
Quote in the paperSubstantial claim1 of 1 sources checked- cites [20] source
- Interpretationcitation
EmoVis captures semantic relations previously not emphasized by existing sequential models.
“It also captures semantic relations previously not emphasized by existing sequential models [28], [29].”
Quote in the paperSubstantial claim1 of 2 sources checked- cites [28] source
The Introduction says GNNs capture relations between graph nodes, and Section 3.1 describes BertGCN using graph structure to update document representations. The paper does not assess EmoVis or establish that existing sequential models neglect the semantic relations claimed here. (LLM, conf=0.80)
Experimental — accuracy not yet measured - cites [29] Michel, 2019, Are sixteen heads really better than one? source
- Premisecitation
GCNs primarily focus on local graph structures, which restricts their ability to utilize global context within graphs fully.
“Furthermore, GCNs primarily focus on local graph structures, which restrict their ability to utilize global context within graphs fully [20].”
Quote in the paperSubstantial claim1 of 1 sources checked- cites [20] source
- Premisecitation
Regular graph-based methods ignore the sequential nature of underlying texts.
“However, regular graph-based methods ignore the sequential nature of underlying texts.”
- Also stated in: § Abstract · plain
“Furthermore, GCNs primarily focus on local graph structures, which restrict their ability to utilize global context within graphs fully [20].”
Quote in the paperSubstantial claim1 of 1 sources checked- cites [20] source
The Experimental Setup (p. 6) describes documents as bag-of-words vectors recording word presence or absence, which do not capture word order. The paper does not establish the broader claim that regular graph-based methods generally ignore the sequential nature of texts. (LLM, conf=0.82)
Experimental — accuracy not yet measured
- Also stated in: § Abstract · plain
- Findingcitation
Results on the GoEmotions dataset show improved performance of transformer-based models when integrated with EmoVis_lin.
“results on the GoEmotions dataset showing improved performance of transformer-based models when integrated with EmoVis lin [30], [49]”
Quote in the paperNot a substantial claim1 of 2 sources checked- cites [30] source
The paper introduces GoEmotions and reports that its BERT model outperforms a biLSTM model (Section 2.3, p. 2). It does not report integrating a transformer-based model with EmoVis_lin or attribute any performance improvement to that integration. (LLM, conf=0.88)
Experimental — accuracy not yet measured - cites [49] source
- Rests on an assumption: The SemEval2018 and GoEmotions datasets and their partitions are suitable and representative for evaluating multilingual multi-label emotion classification.
- Premisecitation
Most existing models for MLEC do not capture emotion-specific associations that can be useful for the classification of emotions.
“However, most existing models for MLEC do not capture emotion-specific associations that can be useful for the classification of emotions [7], [9], [10].”
Quote in the paperSubstantial claim3 of 3 sources checked- cites [7] source
Section 4.2 (page unavailable) says certain words are highly indicative of particular emotions in the multi-label classification task, supporting the usefulness of emotion-specific cues. It does not say that most existing MLEC models fail to capture those associations; it reports that a bag-of-words baseline performs slightly better than a neural bag-of-words baseline on that task. (LLM, conf=0.79)
Experimental — accuracy not yet measured - cites [9] source
Section 6.2 (page unavailable) says task-specific affect-lexicon features can improve emotion-related models. It does not say that most existing multi-label emotion classification models fail to capture emotion-specific associations; indeed, it reports that most top-performing systems used affect-lexicon features. (LLM, conf=0.78)
Experimental — accuracy not yet measured - cites [10] source
The Related Work sections describe approaches to emotion classification, and §4.3 compares models used by the authors. Neither passage says that most existing MLEC models fail to capture emotion-specific associations. Searches for that phrase and for associations between emotions found no passage addressing the claim. (LLM, conf=0.72)
Experimental — accuracy not yet measured
- Findingown data
EmoVis schemes consistently improve the F1-Macro, F1-Micro, and JS metrics for each model tested in the MLEC tasks.
“Specifically, the EmoVis schemes consistently improve the F1-Macro, F1-Micro, and JS metrics for each model tested, as demonstrated in the MLEC tasks.”
Quote in the paperSubstantial claim- Rests on an assumption: The SemEval2018 and GoEmotions datasets and their partitions are suitable and representative for evaluating multilingual multi-label emotion classification.
- Findingown data
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.
“We experimentally show that EmoVis enables transformerbased 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.”
- Also stated in: § B. Results and Discussions · boosted
“These results underscore the effectiveness of EmoVis in a multilingual setting and its superiority over the state-of-the-art models.”
Quote in the paperSubstantial claim- Rests on an assumption: The SemEval2018 and GoEmotions datasets and their partitions are suitable and representative for evaluating multilingual multi-label emotion classification.
- Rests on an assumption: The baseline performances taken from the literature are directly comparable to the paper's experimental setup and results.
- Also stated in: § B. Results and Discussions · boosted
- Interpretationnone given
EmoVis is the first generic graph-based neural network that utilizes visibility graphs, converting classical time-series information to graph representations, in the context of multi-label emotion classification in texts from various languages.
“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.”
- Also stated in: § Abstract · plain
“EmoVis is the first generic graph-based model that utilizes visibility graphs in the context of MLEC in texts from various languages.”
Quote in the paperNot a substantial claim - Also stated in: § Abstract · plain
- Interpretationreasoning
Unlike conventional methods that generate graphs using predefined metrics like point-wise mutual information or cosine similarities, EmoVis preserves the inherent sequential topology of sentences.
“Unlike conventional methods that generate graphs using predefined metrics like point-wise mutual information or cosine similarities, EmoVis preserves the inherent sequential topology of sentences.”
Quote in the paperNot a substantial claim- Rests on an assumption: The order of token embeddings in a transformer output can be treated as a time series whose visibility graph captures meaningful sequential and semantic relationships for emotion classification.
- Interpretationreasoning
EmoVis preserves the topology of the input sentence.
“EmoVis (Emotion Classification with Visibility Graphs), a novel, highly modular graph-based model that preserves the topology of the input sentence, is easy to construct, and, most importantly, improves the performance of any transformer-based model to which it is added.”
Quote in the paperNot a substantial claim- Rests on an assumption: The order of token embeddings in a transformer output can be treated as a time series whose visibility graph captures meaningful sequential and semantic relationships for emotion classification.
- Interpretationown data
EmoVis improves the performance of any transformer-based model to which it is added.
“EmoVis (Emotion Classification with Visibility Graphs), a novel, highly modular graph-based model that preserves the topology of the input sentence, is easy to construct, and, most importantly, improves the performance of any transformer-based model to which it is added.”
Quote in the paperSubstantial claim- Rests on an assumption: The SemEval2018 and GoEmotions datasets and their partitions are suitable and representative for evaluating multilingual multi-label emotion classification.
- Premisereasoning
Sequential models do not fully capture the inherent structural relationships and dependencies among emotions.
“Although some approaches utilize emotion-specific associations via treating the problem as a span-prediction problem [11], sequential models do not fully capture the inherent structural relationships and dependencies among emotions.”
Quote in the paperSubstantial claim
- Classified as probably not a substantial claim. 9
- May combine two claims. 7
Classified as probably not a substantial claim.
PremisecitationThe vector visibility graph (VVG) algorithm extends the univariate visibility graph concept to multivariate time series data.
“The vector visibility graph (VVG) algorithm [25] extends the univariate visibility graph [22], [24] concept to multivariate time series data”
Quote in the paperSubstantial claim2 of 3 sources checkedMay combine two claims.
PremisecitationTransformers process natural language as a sequence on finite context windows, and global relationships among words beyond these windows cannot be completely modeled via sequence processing only.
“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.”
- Also stated in: § Abstract · plain
“More specifically, sequential models process text as token sequences within fixed context windows, limiting their ability to capture word-level dependencies that span beyond those boundaries [12], [13].”
Quote in the paperSubstantial claim2 of 2 sources checked- cites [12] source
The Introduction says Transformer language models have maximum sequence lengths and that small context windows prevent models from using long-range discourse structure. The Conclusion reports that the two models studied rarely take advantage of long-range context. The paper does not establish the broader claim that sequence processing alone cannot completely model relationships beyond a window. (LLM, conf=0.85)
Experimental — accuracy not yet measured - cites [13] source
Section 5 (page not available in our copy) reports that the LSTM language model has a limited effective context and becomes less sensitive to word order farther back. The paper studies LSTMs, not Transformers, and does not establish that sequence processing cannot completely model relationships beyond a finite window. (LLM, conf=0.85)
Experimental — accuracy not yet measured
- Also stated in: § Abstract · plain
Probably not a substantial claim: may not pass S2 (checkable).
InterpretationcitationThe challenges in capturing relationships and dependencies among emotions indicate the necessity for an architecture that is both easy to construct and preserves the structure of the underlying signal in its topology to improve both performance and interpretability.
“The challenges in capturing relationships and dependencies among emotions indicate the necessity for an architecture that is both easy to construct and preserves the structure of the underlying signal in its topology to improve both performance and interpretability [21], [22].”
Quote in the paperNot a substantial claim2 of 2 sources checked- cites [21] Horn, 2022, Topological graph neural networks source
Split into 2 atoms — 0 confirmed, 2 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
Experimental — accuracy not yet measured - cites [22] source
Split into 2 atoms — 0 confirmed, 2 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
Experimental — accuracy not yet measured
Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
PremisecitationIn VVG, edge directionality stems from the projection-based asymmetry between multidimensional vectors; when M = 1, vectors reduce to scalars, eliminating projections and making visibility symmetric, resulting in an undirected graph.
“In VVG, edge directionality stems from the projection-based asymmetry between multidimensional vectors.When M = 1, vectors reduce to scalars, eliminating projections and making visibility symmetric, resulting in an undirected graph [22], [25].”
Quote in the paperNot a substantial claim1 of 2 sources checked- cites [22] source
The visibility-algorithm description (Resumen, p. 1) says that a graph built from scalar time-series values is undirected because its links have no defined direction. It does not discuss VVG, multidimensional vectors, M = 1, or projection-based asymmetry as the reason directionality disappears. Its discussion of a possible directed graph instead relates direction to the temporal axis (Resumen, p. 6). (LLM, conf=0.87)
Experimental — accuracy not yet measured - cites [25] source
Probably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationThe natural visibility graph (NVG) algorithm is a foundational method for mapping univariate (scalar) time series into graph networks.
“The natural visibility graph (NVG) algorithm [22] is a foundational method for mapping univariate (scalar) time series into graph networks.”
Quote in the paperNot a substantial claim1 of 1 sources checked- cites [22] source
Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
PremisecitationThe visibility graph transformation supports both scalar and vector representations, with applications spanning time series analysis and language processing.
“This simple yet versatile transformation supports both scalar [22], [24] and vector representations [25], with applications spanning time series analysis and language processing [26], [27].”
Quote in the paperNot a substantial claim2 of 3 sources checkedProbably not a substantial claim: may not pass S4 (based).
Interpretationnone givenThe model-agnostic and modular nature of EmoVis, with its low complexity and streamlined set of hyperparameters, facilitates easy integration with other models across various languages to increase their performance.
“Additionally, the model-agnostic and modular nature of the EmoVis, with its low complexity and streamlined set of hyperparameters, facilitates easy integration with other models across various languages to increase their performance.”
Quote in the paperNot a substantial claim- Rests on an assumption: The SemEval2018 and GoEmotions datasets and their partitions are suitable and representative for evaluating multilingual multi-label emotion classification.
May combine two claims.
InterpretationreasoningEmoVis implements an advanced pooling strategy involving graph-based message passing followed by maximum pooling for classification, offering a significant improvement over standard transformer models solely relying on [CLS] or pooled tokens.
“This approach allows EmoVis to implement an advanced pooling strategy involving graph-based message passing followed by maximum pooling for classification, offering a significant improvement over standard transformer models solely relying on [CLS] or pooled tokens.”
Quote in the paperSubstantial claim- Rests on an assumption: The order of token embeddings in a transformer output can be treated as a time series whose visibility graph captures meaningful sequential and semantic relationships for emotion classification.
May combine two claims.
Interpretationown dataEmoVis 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.
“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.”
- Also stated in: § IV. CONCLUSION · plain
“Additionally, the model-agnostic and modular nature of the EmoVis, with its low complexity and streamlined set of hyperparameters, facilitates easy integration with other models across various languages to increase their performance.”
Quote in the paperSubstantial claim- Rests on an assumption: The SemEval2018 and GoEmotions datasets and their partitions are suitable and representative for evaluating multilingual multi-label emotion classification.
- Also stated in: § IV. CONCLUSION · plain
Classified as probably not a substantial claim. May combine two claims.
PremisereasoningGNN-based models provide geometric extensions to neural networks, enabling models to learn associations within a text, and have been proposed to alleviate the problem of limited context modeling.
“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.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing), S4 (based).
Interpretationnone givenEmoVis is easy to construct.
“EmoVis (Emotion Classification with Visibility Graphs), a novel, highly modular graph-based model that preserves the topology of the input sentence, is easy to construct, and, most importantly, improves the performance of any transformer-based model to which it is added.”
Quote in the paperNot a substantial claimMay combine two claims.
InterpretationreasoningEmoVis effectively captures complex representations overlooked by traditional deep learning models by maintaining the temporal sequence of text and recognizing patterns through its directed node connections.
“EmoVis effectively captures complex representations overlooked by traditional deep learning models by maintaining the temporal sequence of text and recognizing patterns through its directed node connections.”
Quote in the paperSubstantial claim- Rests on an assumption: The order of token embeddings in a transformer output can be treated as a time series whose visibility graph captures meaningful sequential and semantic relationships for emotion classification.
Probably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductnone givenThe experiments used a fixed initialization seed.
“We used a fixed initialization seed.”
Quote in the paperNot a substantial claim
The paper relies on this without support.
The SemEval2018 and GoEmotions datasets and their partitions are suitable and representative for evaluating multilingual multi-label emotion classification.
“We primarily utilize the SemEval2018 Twitter multilingual multi-class multi-label dataset [9], the most common MLEC task benchmark.”
“We use the respective languages' same Train/Valid/Test partitions.”
The paper relies on this without support.
The baseline performances taken from the literature are directly comparable to the paper's experimental setup and results.
“The performances of these baselines on the SemEval2018 benchmark are taken directly from the corresponding literature.”
The paper relies on this without support.
The order of token embeddings in a transformer output can be treated as a time series whose visibility graph captures meaningful sequential and semantic relationships for emotion classification.
“EmoVis represents sentences as graph-based time series using high-dimensional embeddings on graph nodes.”
“each vector in the sequence X BERT ∈ R N ×M is treated as a node within the VVG structure”
Cites
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., & Polosukhin, I. (2017) · arXiv · doi:10.48550/arxiv.1706.03762 · Cited by 120,404 · cited 1× · see citing works
“Recently, deep learning architectures such as recurrent neural networks (RNN), convolutional neural networks (CNN), and transformers have become popular for MLEC-related problems as they can capture complex associations between emotions and data [6], [7], [8].”
Jakubův, J., Chvalovský, K., Goertzel, Z., et al. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itp.2023.19 · Cited by 76,648 · see citing works
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2019) · Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers) · doi:10.18653/v1/n19-1423 · Cited by 48,293 · see citing works
RoBERTa: A Robustly Optimized BERT Pretraining Approach
Liu, Y., Ott, M., Goyal, N., Du, J., Joshi, M., Chen, D., Levy, O., Lewis, M., Zettlemoyer, L., & Stoyanov, V. (2019) · arXiv · doi:10.48550/arxiv.1907.11692 · Cited by 16,515 · see citing works
Inductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639 · cited 2× · see citing works
“The GCN architecture of EmoVis consists of multiple layers of SAGEConv , as defined formally in [33], with ReLU activation function and batch normalization layer ( BN ), followed by a global max pooling ( GMP ) layer, a dropout layer, and a linear layer.”
Graph neural networks: A review of methods and applications
Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., & Sun, M. (2020) · AI Open · doi:10.1016/j.aiopen.2021.01.001 · Cited by 6,880 · cited 1× · see citing works
“Notably, the normalized adjacency matrix is defined as [32]: where I ∈ R N × N is the identity matrix, D out is the out-degree matrix with ( D out ) ii = (cid:2) j ( A + I ) ij , and D in is the in-degree matrix with ( D in ) ii = j ( A + I ) ji .”
Unsupervised Cross-lingual Representation Learning at Scale
Conneau, A., Khandelwal, K., Goyal, N., Chaudhary, V., Wenzek, G., Guzmán, F., Grave, E., Ott, M., Zettlemoyer, L., & Stoyanov, V. (2020) · Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/2020.acl-main.747 · Cited by 5,637 · cited 1× · see citing works
“For the transformer-based models, we fine-tuned four existing models for the English MLEC task: “TwHIN-BERT-Base” [31], “BERT-Base-Uncased” [42], “RoBERTa-Base” [43], and “XLM-RoBERTa-Base” [44].”
Deeper Insights Into Graph Convolutional Networks for Semi-Supervised Learning
Li, Q., Han, Z., & Wu, X.-M. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11604 · Cited by 2,872 · cited 2× · see citing works
“As for the GNN-based approaches, incorporating a significant number of graph convolution layers in network architectures can result in over-smoothing of dataset features, thereby diminishing the performance of the training process [20].”
From time series to complex networks: the visibility graph
Lacasa, L., Luque, B., Ballesteros, F., Luque, J., & Nuño, J. C. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0709247105 · Cited by 1,826 · cited 6× · see citing works
“The natural visibility graph (NVG) algorithm [22] is a foundational method for mapping univariate (scalar) time series into graph networks.”
InfluentialA review of affective computing: From unimodal analysis to multimodal fusion
Poria, S., Cambria, E., Bajpai, R., & Hussain, A. (2017) · Information Fusion · doi:10.1016/j.inffus.2017.02.003 · Cited by 1,644 · cited 1× · see citing works
“public opinion analysis [4], and language translation [5].”
GoEmotions: A Dataset of Fine-Grained Emotions
Demszky, D., Movshovitz-Attias, D., Ko, J., Cowen, A., Nemade, G., & Ravi, S. (2020) · Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/2020.acl-main.372 · Cited by 873 · see citing works
Horizontal visibility graphs: Exact results for random time series
Luque, B., Lacasa, L., Ballesteros, F., & Luque, J. (2009) · Physical Review E · doi:10.1103/physreve.80.046103 · Cited by 789 · cited 2× · see citing works
“This simple yet versatile transformation supports both scalar [22], [24] and vector representations [25], with applications spanning time series analysis and language processing [26], [27].”
SemEval-2018 Task 1: Affect in Tweets
Mohammad, S., Bravo-Marquez, F., Salameh, M., & Kiritchenko, S. (2018) · Proceedings of The 12th International Workshop on Semantic Evaluation · doi:10.18653/v1/s18-1001 · Cited by 746 · cited 4× · see citing works
“For the Spanish MLEC task, the baselines are Tw-StAR, ELiRF [40], MILAB [9], and SpanEmo.”
InfluentialAre Sixteen Heads Really Better than One?
Michel, P., Levy, O., & Neubig, G. (2019) · arXiv · doi:10.48550/arxiv.1905.10650 · Cited by 404 · cited 1× · see citing works
“It also captures semantic relations previously not emphasized by existing se-quentialmodels[28],[29].”
Natural language processing in mental health applications using non-clinical texts
Calvo, R. A., Milne, D., Hussain, M. S., & Christensen, H. M. (2017) · Natural Language Engineering · doi:10.1017/s1351324916000383 · Cited by 383 · see citing works
Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks
Zhang, Y., Yu, X., Cui, Z., Wu, S., Wen, Z., & Wang, L. (2020) · Annual Meeting of the Association for Computational Linguistics · doi:10.48550/arxiv.2004.13826 · Cited by 353
Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks
Zhang, Y., Yu, X., Cui, Z., Wu, S., Wen, Z., & Wang, L. (2020) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/2020.acl-main.31 · Cited by 344 · see citing works
Spanish Pre-trained BERT Model and Evaluation DataPreprint
Cañete, J., Chaperon, G., Fuentes, R., Ho, J.-H., Kang, H., & Pérez, J. E. P. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2308.02976 · Cited by 335 · see citing works
Sharp nearby, fuzzy far away: How neural language models use context
Khandelwal, U., He, H., Qi, P., & Jurafsky, D. (2018) · Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p18-1027 · Cited by 303 · cited 1× · see citing works
“More specifically, sequential models process text as token sequences within fixed context windows, limiting their ability to capture word-level dependencies that span beyond those boundaries [12], [13].”
BertGCN: Transductive Text Classification by Combining GNN and BERT
Lin, Y., Meng, Y., Sun, X., Han, Q., Kuang, K., Li, J., & Wu, F. (2021) · Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021 · doi:10.18653/v1/2021.findings-acl.126 · Cited by 228 · see citing works
The Interplay of Variant, Size, and Task Type in Arabic Pre-trained Language ModelsPreprint
Inoue, G., Alhafni, B., Baimukan, N., Bouamor, H., & Habash, N. Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.06678 · Cited by 200 · cited 1× · see citing works
“For the Arabic MLEC task, we fine-tuned “TwHIN-BERT-Base,” “BERT-Base-Arabic” by Inoue et al. [45], and “XLM-RoBERTa-Base.””
A review of some techniques for inclusion of domain-knowledge into deep neural networks
Dash, T., Chitlangia, S., Ahuja, A., & Srinivasan, A. (2022) · Scientific Reports · doi:10.1038/s41598-021-04590-0 · Cited by 196 · see citing works
Latent Emotion Memory for Multi-Label Emotion Classification
Fei, H., Zhang, Y., Ren, Y., & Ji, D. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i05.6271 · Cited by 144 · see citing works
Baziotis, C., Nikolaos, A., Chronopoulou, A., Kolovou, A., Paraskevopoulos, G., Ellinas, N., Narayanan, S., & Potamianos, A. (2018) · Proceedings of The 12th International Workshop on Semantic Evaluation · doi:10.18653/v1/s18-1037 · Cited by 142 · cited 3× · see citing works
“However, most existing models for MLEC do not capture emotion-specific associations that can be useful for the classification of emotions [7], [9], [10].”
Understanding Emotions: A Dataset of Tweets to Study Interactions between Affect Categories
Mohammad, S. M., & Kiritchenko, S. (2018) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/5or8sy3gqobf · Cited by 96 · see citing works
Zhang, X., Malkov, Y. A., Florez, O. U., Park, S., McWilliams, B., Han, J., & El-Kishky, A. (2023) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3580305.3599921 · Cited by 92 · cited 2× · see citing works
“The raw sentences are preprocessed and tokenized, then input into a transformer encoder, which utilizes the pre-trained TwHIN-BERT-Base model from Hugging Face [31] to generate contextual feature embeddings, enhancing the overall performance by capturing the nuanced essences of the sentences.”
Deng, J., & Ren, F. (2020) · IEEE Transactions on Affective Computing · doi:10.1109/taffc.2020.3034215 · Cited by 91 · cited 3× · see citing works
“As a fundamental task in EC and the most general field of sentiment analysis, multi-label EC (MLEC) aims to detect all the existing emotions in texts [6].”
SpanEmo: Casting Multi-label Emotion Classification as Span-prediction
Alhuzali, H., & Ananiadou, S. (2021) · Conference of the European Chapter of the Association for Computational Linguistics · doi:10.18653/v1/2021.eacl-main.135 · Cited by 87 · cited 4× · see citing works
“Additionally,wetrainedSpanEmofromscratchtodemonstrate theapplicabilityofEmoVis,usinghyperparametersfromthelit-erature[11].”
InfluentialA user-centric model of voting intention from Social Media
Lampos, V., PreoÅ£iuc-Pietro, D., & Cohn, T. (2013) · Cited by 79 · see citing works
Yu, J., Marujo, L., Jiang, J., Karuturi, P., & Brendel, W. (2018) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d18-1137 · Cited by 75 · see citing works
Fine-grained emotion classification of Chinese microblogs based on graph convolution networks
Lai, Y.-C., Zhang, L., Han, D., Zhou, R., & Wang, G.-R. (2019) · World wide web (Bussum) · doi:10.1007/s11280-020-00803-0 · Cited by 72 · cited 1× · see citing works
“To remedy, existing works either consider an additional domain knowledge [14], aim to capture relations through graph convolutional networks (GCNs) [15], [16], [17], or relational graph neural networks [18].”
InducT-GCN: Inductive Graph Convolutional Networks for Text Classification
Wang, K., Han, S. C., & Poon, J. (2022) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr56361.2022.9956075 · Cited by 68 · cited 1× · see citing works
“…EmoVis model and EmoVis lin , our best-performing variant, including parameter counts, ablation studies with state-of-the-art plug-in models [47], [48], interpolation coefficients of EmoVis lin , results on the GoEmotions dataset showing improved performance of transformer-based models when…”
Joint Binary Neural Network for Multi-label Learning with Applications to Emotion Classification
He, H., & Xia, R. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-99495-6_21 · Cited by 61 · cited 1× · see citing works
“For the English MLEC task, the English model state-of-the-art baselines are JBNN [34], DATN [36], NTUA [7], LEM [37], ReRc [35], and SpanEmo [11].”
EMA at SemEval-2018 Task 1: Emotion Mining for Arabic
Badaro, G., El Jundi, O., Khaddaj, A., Maarouf, A., Kain, R., Hajj, H., & El-Hajj, W. (2018) · Proceedings of The 12th International Workshop on Semantic Evaluation · doi:10.18653/v1/s18-1036 · Cited by 60 · cited 2× · see citing works
“For the Arabic MLEC task, we compare our method with EMA [10], Tw-StAR [38], HEF [39], and SpanEmo.”
Hybrid Feature Model for Emotion Recognition in Arabic Text
Alswaidan, N., & Menaï, M. E. B. (2020) · IEEE Access · doi:10.1109/access.2020.2975906 · Cited by 51 · cited 1× · see citing works
“For the Arabic MLEC task, we compare our method with EMA [10], Tw-StAR [38], HEF [39], and SpanEmo.”
BertGCN: Transductive Text Classification by Combining GCN and BERTPreprint
Lin, Y., Meng, Y., Sun, X., Han, Q., Kuang, K., Li, J., & Wu, F. Q. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.05727 · Cited by 51 · see citing works
Do Long-Range Language Models Actually Use Long-Range Context?
Sun, S., Krishna, K., Mattarella-Micke, A., & Iyyer, M. (2021) · Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2021.emnlp-main.62 · Cited by 43 · cited 1× · see citing works
“More specifically, sequential models process text as token sequences within fixed context windows, limiting their ability to capture word-level dependencies that span beyond those boundaries [12], [13].”
Tw-StAR at SemEval-2018 Task 1: Preprocessing Impact on Multi-label Emotion Classification
Mulki, H., Ali, C. B., Haddad, H., & Babaoglu, I. (2018) · International Workshop on Semantic Evaluation · doi:10.18653/v1/s18-1024 · Cited by 38 · cited 1× · see citing works
“For the Arabic MLEC task, we compare our method with EMA [10], Tw-StAR [38], HEF [39], and SpanEmo.”
Relevant Emotion Ranking from Text Constrained with Emotion Relationships
Zhou, D., Yang, Y., & He, Y. (2018) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/n18-1052 · Cited by 36 · cited 1× · see citing works
“For the English MLEC task, the English model state-of-the-art baselines are JBNN [34], DATN [36], NTUA [7], LEM [37], ReRc [35], and SpanEmo [11].”
Ying, W., Xiang, R., & Lu, Q. (2019) · Workshop on Noisy User-generated Text (W-NUT) · doi:10.18653/v1/d19-5541 · Cited by 33 · cited 1× · see citing works
“To remedy, existing works either consider an additional domain knowledge [14], aim to capture relations through graph convolutional networks (GCNs) [15], [16], [17], or relational graph neural networks [18].”
An Effective Deployment of Contrastive Learning in Multi-label Text Classification
Lin, N., Qin, G., Wang, G., Zhou, D., & Yang, A. (2023) · Findings of the Association for Computational Linguistics: ACL (Findings of ACL) · doi:10.18653/v1/2023.findings-acl.556 · Cited by 32 · cited 1× · see citing works
“We also use the Jaccard Similarity Contrastive Loss (JSCL), Jaccard Similarity Probability Contrastive Loss (JSPCL), Stepwise Label Contrastive Loss (SLCL), Intra-label ContrastiveLoss(ICL),andStrictlyContrastiveLoss(SCL) [41] with SpanEmo in our comparisons.”
Topological Graph Neural Networks
Horn, M., De Brouwer, E., Moor, M., Moreau, Y., Rieck, B., & Borgwardt, K. (2021) · arXiv · doi:10.48550/arxiv.2102.07835 · Cited by 31 · see citing works
Ren, W., & Jin, N. (2019) · Nonlinear Dynamics · doi:10.1007/s11071-019-05147-7 · Cited by 30 · see citing works
Graph Receptive Transformer Encoder for Text Classification
Aras, A. C., Alikaşifoğlu, T., & Koç, A. (2024) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2024.3380362 · Cited by 14 · see citing works
Self-citationTime Series Analysis Based on Visibility Graph Theory
Yan, S., & Wang, D. (2015) · International Conference on Intelligent Human-Machine Systems and Cybernetics · doi:10.1109/ihmsc.2015.238 · Cited by 10 · cited 1× · see citing works
“This simple yet versatile transformation supports both scalar [22], [24] and vector representations [25], with applications spanning time series analysis and language processing [26], [27].”
VISPool: Enhancing Transformer Encoders with Vector Visibility Graph Neural Networks
Alikaşifoğlu, T., Aras, A. C., & Koç, A. (2024) · doi:10.18653/v1/2024.findings-acl.149 · Cited by 9 · see citing works
Self-citationIllouz, E., & Alaluf, Y. B. (2019) · doi:10.1093/oxfordhb/9780190695583.013.10 · Cited by 5 · see citing works
Text-RGNNs: Relational Modeling for Heterogeneous Text Graphs
Aras, A. C., Alikaşifoğlu, T., & Koç, A. (2024) · IEEE Signal Processing Letters · doi:10.1109/lsp.2024.3433568 · Cited by 5 · cited 1× · see citing works
“To remedy, existing works either consider an additional domain knowledge [14], aim to capture relations through graph convolutional networks (GCNs) [15], [16], [17], or relational graph neural networks [18].”
Self-citationGonzález, J.-Á., Hurtado, L.-F., Segarra, E., et al. (2018) · International Workshop on Semantic Evaluation (SemEval) · doi:10.18653/v1/s18-1159 · Cited by 3 · cited 1× · see citing works
“For the Spanish MLEC task, the baselines are Tw-StAR, ELiRF [40], MILAB [9], and SpanEmo.”
A Simple and Interactive Transformer for Fine-Grained Emotion Detection
Sui, D., Li, B., Yang, H., Chen, Y., Liu, K., Chu, D., & Zhao, J. (2025) · IEEE Transactions on Audio, Speech and Language Processing · doi:10.1109/taslp.2024.3487418 · Cited by 2 · see citing works
Non-Negative Kernel Graphs for Time-Varying Signals Using Visibility Graphs
Bozkurt, E., & Ortega, A. (2022) · 2022 30th European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco55093.2022.9909594 · Cited by 1 · cited 1× · see citing works
“To this end, visibility graphs offer an effective means of representing sequential signals by connecting data points according to their value-based visibility, thereby preserving the underlying temporal structure while introducing geometric relationships [22], [23].”
RELATE: Generating a linguistically inspired Knowledge Graph for fine-grained emotion classification
Schoene, A. M., Dethlefs, N., & Ananiadou, S. (2022) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/2uz8zds4txxh
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2018) · arXiv · doi:10.48550/arxiv.1810.04805 · cited 1×
“For the transformer-based models, we fine-tuned four existing models for the English MLEC task: “TwHIN-BERT-Base” [31], “BERT-Base-Uncased” [42], “RoBERTa-Base” [43], and “XLM-RoBERTa-Base” [44].”
Unsupervised Cross-lingual Representation Learning at Scale
Conneau, A., Khandelwal, K., Goyal, N., et al. (2019) · arXiv · doi:10.48550/arxiv.1911.02116
Flagged first, then by citations
Cited by
Sorted by citations
GraphTeacher: Transductive Fine-Tuning of Encoders Through Graph Neural Networks
Koç, E., Aras, A. C., Alikaşifoğlu, T., & Koç, A. (2025) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2025.3627514 · Cited by 2 · see citing works
Self-citationFractional Fourier transform based visibility graphs
Şimşek, E., Özaktaş, H. M., & Koç, A. (2026) · Digital Signal Processing · doi:10.1016/j.dsp.2026.106350
Self-citation
- Authors
- Şimşek, E., Topcu, A., Koç, E., Saritas, E. U., & Koç, A.
- Affiliations
- Bilkent University (TR)
- Department of Electrical and Electronics Engineering, Bilkent University, Ankara, Türkiye
- Venue
- IEEE Signal Processing Letters
- Published
- 2025
- Volume
- 32
- Pages
- 2055-2059
- ISSN
- 1070-9908 (ISSN-L)
- 1558-2361
- OpenAlex
- W4410086475
- Cited by
- 2
- References
- 48
- Citations by year
- 2026: 1 · 2025: 1
- FWCI
- 0.82
- Type
- journal article
- Language
- en
- Open access
- green
- hdl.handle.net
- Licence
- Locations
- IEEE Signal Processing Letters (publishedVersion)
- Bilkent University Institutional Repository (Bilkent University) (submittedVersion, cc-by)
- Funders
- BAGEP Award of the Science Academy (124E179)
- Communication Technologies Authority
- Scientific and Technological Research Council (5249902)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Sentiment Analysis and Opinion Mining
- Social Sciences › Psychology › Experimental and Cognitive Psychology › Emotion and Mood Recognition
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Keywords
- emotion classification, visibility graph, graph neural networks, transformer models, text representation, GoEmotions
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-21.
Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-21.
Cited sources are checked by gpt-6-sol.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review