2023
DOI: 10.1016/j.knosys.2023.110285
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchically stacked graph convolution for emotion recognition in conversation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 17 publications
(7 citation statements)
references
References 28 publications
0
4
0
Order By: Relevance
“…• HSGCF [34]: It introduces a hierarchical structure that leverages five graph convolution layers to extract discriminative emotional features. It integrates Transformer structures to mitigate the over-smoothing problem associated with deeper networks.…”
Section: ) Baseline Methodsmentioning
confidence: 99%
“…• HSGCF [34]: It introduces a hierarchical structure that leverages five graph convolution layers to extract discriminative emotional features. It integrates Transformer structures to mitigate the over-smoothing problem associated with deeper networks.…”
Section: ) Baseline Methodsmentioning
confidence: 99%
“…A multitude of techniques have been proposed for emotion recognition [40,41]. In the realm of dialogue emotion recognition, Wang [42] introduced the hierarchically stacked graph convolution framework. This framework aims to improve the extraction of discriminative information from the emotional graph it constructs.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Numerous studies have harnessed polarity-based sentiment deep learning techniques for analyzing tweets [38,39]. A multitude of techniques have been proposed for emotion recognition [40][41][42]. In the realm of dialogue emotion recognition, Wang [43] introduced the hierarchically stacked graph convolution framework.…”
Section: Literature Reviewmentioning
confidence: 99%