We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/Speech emotion recognition based on Graph-LSTM neural network
PeriodicalsMathematics

Speech emotion recognition based on Graph-LSTM neural network

Checking your access to this record.

Abstract & Overview

Abstract Currently, Graph Neural Networks have been extended to the field of speech signal processing. It is the more compact and flexible way to represent speech sequences by graphs. However, the structures of the relationships in recent studies are tend to be relatively uncomplicated. Moreover, the graph convolution module exhibits limitations that impede its adaptability to intricate application scenarios. In this study, we establish the speech-graph using feature similarity and introduce a novel architecture for graph neural network that leverages an LSTM aggregator and weighted pooling. The unweighted accuracy of 65.39% and the weighted accuracy of 71.83% are obtained on the IEMOCAP dataset, achieving the performance comparable to or better than existing graph baselines. This method can improve the interpretability of the model to some extent, and identify speech emotion features effectively.

Cite this record

Yan Li, Yapeng Wang, Xu Yang, Sio‐Kei Im (2023). Speech emotion recognition based on Graph-LSTM neural network. EURASIP Journal on Audio Speech and Music Processing, 2023(1). https://doi.org/10.1186/s13636-023-00303-9

Copy in another style

Li, Y., Wang, Y., Yang, X., & Im, S. (2023). Speech emotion recognition based on Graph-LSTM neural network. EURASIP Journal on Audio Speech and Music Processing, 2023(1). https://doi.org/10.1186/s13636-023-00303-9
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.