<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>with Graph Neural Network for Speech Emotion Recognition</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Eliton L. Scardin Perin</string-name>
          <email>elitonperin@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Edson Takashi Matsubara</string-name>
          <email>edsont@ufms.br</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Transductive Learning, Ensemble Learning, Graph Convolution Network</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University Federal of Mato Grosso do Sul (UFMS)</institution>
          ,
          <addr-line>Cidade Universitária, Av. Costa e Silva - Pioneiros, MS, 79070-900</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University Federal of Mato Grosso do Sul (UFMS)</institution>
          ,
          <addr-line>Cidade Universitária, Av. Costa e Silva - Pioneiros, MS, 79070-900</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <abstract>
        <p>In this paper, we jointly use a Transductive Ensemble Learning with a Graph Convolutional Network to perform a task of Speech Emotion Recognition (SER). Additionally, we propose solving this task using ensemble learning methods with simple base classifiers such as Multilayer Perceptrons and k-Nearest Neighborhood. We extracted features using Wav2Vec and prosodic. The performance reaches 0.5248 in The following sections describe the techniques of Ensemble Learning and Graph Neural Network.</p>
      </abstract>
      <kwd-group>
        <kwd>Recognition</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The speech can express more than words; it can express feelings. With this objective in mind,
we would like to identify sentiment, intention, opinion, genre, and humor using audio and
language features [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ].
      </p>
      <p>Discover the feeling present in the audio content is known as Speech Emotion Recognition
(SER). Among the most known dataset for this task, the Portuguese are not among them. For
this reason, the Internation Conference on the Computer Processing of Portuguese (PROPOR
2022) proposed a workshop to bring new researchers and enthusiasts to processing speech in
Portuguese. One of the challenges of this conference is the SER for Portuguese.</p>
      <p>
        Traditional methods of machine learning and deep learning techniques employ several
solutions for SER with strong performances [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Ensemble methods are applied to this task,
too, and improve the results for the base classifiers [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. We use a method with a transductive
ensemble learning to predict new labels with several outputs from base classifiers to capture the
best characteristic from each method. Our method shows competitive results when compared
with the baselines.
      </p>
    </sec>
    <sec id="sec-2">
      <title>Methodology</title>
      <p>All of them were inserted in our method Transductive Ensemble Learning with Graph Neural
Network. After these techniques section, we introduced our proposal.</p>
      <sec id="sec-2-1">
        <title>2.1. Ensemble Learning</title>
        <p>
          An ensemble combines multiple base classifiers to obtain final predictions. A simple ensemble
can be obtained performing majority voting or weighting the voting from base classifiers.
Another type of ensemble is the technique that includes label ranking in the process of voting
rules [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. More advanced techniques focus on training metamodels from the output of the
classifiers together with the training set.
        </p>
        <p>
          In general, the combination of the base classifiers is a crucial step and is a non-trivial process
in the presence of several base classifiers. It is common in the usage of ensemble methods to
perform neural machine translation (NMT) [
          <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Graph Neural Network</title>
        <p>
          Neural Networks with support for graph representation are known as Graph Neural Network
(GNN). Originally proposed by [
          <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
          ] in a recurrent neural network style. The insertion of
a graph is helpful in other types of Artificial Neural Networks to perform similar tasks. An
example of GCN usage for text classification tasks is the Text GCN; this method gets the corpus
and builds a graph with word co-occurrence and documents word relation to categorize them.
Besides, no word embeddings or external knowledge outperforms the state-of-the-art [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
        </p>
        <p>
          Node classification is another way to work with graphs and neural networks. This idea
introduced by [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] with DCNNs (Difusion-convolutional neural networks) shows interesting
results. The work of [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] uses GCN to realize node classification in the semi-supervised way
of training and outperforms several similar methods. A simplifying GCN (SGCN) published
by [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] explore the power of the GCN to scale and do not negatively impact the accuracy, and
SGCN was better 100 times against the FastGCN [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Transductive Ensemble Learning with Graph Convolution Netword</title>
        <p>In this work, we propose Ensemble Learning with Transductive Learning for SER problem.
Transductive learning [14] is similar to semi-supervised learning, but it considers a search space
of hypothesis where all testing data is known beforehand. Our proposal of ensemble learning
runs over a Graph Convolutional Network (GCN). We configure a graph with the training set
that carries the relation between samples, labels, and models.</p>
        <p>In a GCN, we build the graph that connects all data samples with all the labels for the
respective models of classifiers. Figure 1 shows the representation of this bipartite graph. One
set of bipartite nodes represents the samples. The  _0 is a node representing the first example
in the training dataset, and nodes below until  _ are the  − ℎ last one in the training set. These
nodes receive a label from training. The  _0 is a node for the first sample in the testing set. The
following nodes till  _ belong to the  − ℎ example in the test dataset. We set nodes from the
testing set with an invalid label not used in the training set.</p>
        <p>The model nodes are another set of bipartite nodes. The nodes 10 , 11 e 12 , represent
the model 1 for each valid label, and this setting repeat for the others model nodes 20 until
the 2 , the  − ℎ model. The edges between model and samples nodes are the probability of
the output from models to respective samples.</p>
        <p>
          The representation of the Graph Convolution Network is an adjacency matrix. Rows and
columns represent nodes of the graph. If a node has a connection, the value in the matrix cell
represents the probability that the node of instance belongs to the node class. The matrix of
adjacency is normalized and becomes a piece of the function of propagation of data [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]:
 [+1] =  (
[]  []  ∗)
(1)
where  [] is the vector of input features to layer  ,  is the weights of layer  of the GCN,
 is the activation function, and  ∗ is the normalized adjacency matrix. From the adjacency
matrix is extracted the identity matrix that is used as network input.
        </p>
        <p>The Figure 2 shows a diagram of a GCN with 4 layers, with respective sizes 512, 256, 128 and
 + 1 , where  is the number of classes. Note that the adjacency matrix is shared with all layers.
The network has  + 1 outputs,  are for the class of the problem, and one more for the nodes
that do not have a class. The proposal avoids examples without defined classes using masks to
not participate in the CNN backpropagation algorithm.</p>
        <p>The following steps of the algorithm are the same as the CNN. The problem is a classification
with the CNN, where it propagates labels from training set to unlabeled set. The training uses
the function and applies it to the backpropagation to adjust the weights with the respective
derivatives.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Results</title>
      <p>We used the dataset available by the competition for the SER task for the experiments. They
are audios from the dataset called CORAA (Corpus of Annotated Audios). The distribution of
examples and classes is shown in Table 1. We used two types of audio features as input to the
base models. Both types were made available by the competition. The first type is the Wav2Vec,
an unsupervised pre-training model for speech recognition [15]. The second is prosodic, which
extracts features from the intonations and energy curves of audios [16]. The base models chosen
for this task are:
• Multilayer Perceptron (MLP): is an artificial neural network with few layers. It is a
supervised learner, able to build a universal function to approximate [17, 18].
• k-Nearest Neighborhood (kNN): a classifier that performs the predictions based on
voting across the metric of distance between train and test samples [19].</p>
      <sec id="sec-3-1">
        <title>Classes</title>
        <p>neutral
non-neutral-female
non-neutral-male
Total</p>
      </sec>
      <sec id="sec-3-2">
        <title>Training set Testing set</title>
        <p>491
89
45
625 308
equal to 1000 steps, and layers with size 512, 256, 128 e 4 number of neurons from beginning to
the end of GCN. A graphical representation is shown in Figure 2.</p>
        <p>Method tSriazienoinfg set vSaizleidoaftion set vAaclciduaraticoynosnet oFn1-vscaolirdeamtioancrsoet
Transductive Ensemble Learning with GCN 615 10 0.8000 0.2962
Transductive Ensemble Learning with GCN 500 125 0.7952 0.4532
Transductive Ensemble Learning with GCN 625 0 -
Baseline Wav2Vec 625 0 -
Baseline prosodic 625 0 -
F1-score macro
on real test set
0.5248
0.5356
0.5335</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>The Transductive Ensemble Learning with GCN is a competitive method for the task of SER.
The results do not exceed baseline metrics of Wav2Vec or prosodic, but we do not use any
new feature for the network. We plan to use features from other models with fine-tuning for
this dataset for future works. Apply new features into nodes as a piece of the learning data
to improve the results of the method. We can combine other models of neural networks with
attention mechanism.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>This work has been supported by the following Brazilian research agencies: Coordenação de
Aperfeiçoamento de Pessoal de Nível Superior - Brasil (CAPES) and Fundação de Apoio ao
Desenvolvimento de Ensino, Ciência e Tecnologia do MS (FUNDECT).</p>
      <p>URL: https://openreview.net/forum?id=rytstxWAW.
[14] A. Gammerman, V. Vovk, V. Vapnik, Learning by transduction, in: Proceedings of the
Fourteenth Conference on Uncertainty in Artificial Intelligence, UAI’98, Morgan Kaufmann
Publishers Inc., San Francisco, CA, USA, 1998, p. 148–155.
[15] S. Schneider, A. Baevski, R. Collobert, M. Auli, wav2vec: Unsupervised pre-training for
speech recognition, arXiv preprint arXiv:1904.05862 (2019).
[16] I. Luengo, E. Navas, I. Hernáez, J. Sánchez, Automatic emotion recognition using prosodic
parameters, in: Ninth European conference on speech communication and technology,
Citeseer, 2005.
[17] G. E. Hinton, Connectionist learning procedures, in: Machine learning, Elsevier, 1990, pp.</p>
      <p>555–610.
[18] X. Glorot, Y. Bengio, Understanding the dificulty of training deep feedforward neural
networks, in: Proceedings of the thirteenth international conference on artificial intelligence
and statistics, JMLR Workshop and Conference Proceedings, 2010, pp. 249–256.
[19] E. Fix, J. L. Hodges, Discriminatory analysis. nonparametric discrimination: Consistency
properties, International Statistical Review/Revue Internationale de Statistique 57 (1989)
238–247.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Bertero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Fung</surname>
          </string-name>
          ,
          <article-title>Deep learning of audio and language features for humor prediction</article-title>
          ,
          <source>in: Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC'16)</source>
          ,
          <source>European Language Resources Association (ELRA)</source>
          , Portorož, Slovenia,
          <year>2016</year>
          , pp.
          <fpage>496</fpage>
          -
          <lpage>501</lpage>
          . URL: https://aclanthology.org/L16-1079.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Chathuranga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jayaratne</surname>
          </string-name>
          ,
          <article-title>Automatic music genre classification of audio signals with machine learning approaches</article-title>
          ,
          <source>GSTF Journal on Computing (JoC) 3</source>
          (
          <issue>2013</issue>
          )
          <fpage>1</fpage>
          -
          <lpage>12</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M. B.</given-names>
            <surname>Akçay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Oğuz</surname>
          </string-name>
          ,
          <article-title>Speech emotion recognition: Emotional models, databases, features, preprocessing methods, supporting modalities, and classifiers</article-title>
          ,
          <source>Speech Communication</source>
          <volume>116</volume>
          (
          <year>2020</year>
          )
          <fpage>56</fpage>
          -
          <lpage>76</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>H.</given-names>
            <surname>Werbin-Ofir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Dery</surname>
          </string-name>
          , E. Shmueli,
          <article-title>Beyond majority: Label ranking ensembles based on voting rules</article-title>
          ,
          <source>Expert Systems with Applications</source>
          <volume>136</volume>
          (
          <year>2019</year>
          )
          <fpage>50</fpage>
          -
          <lpage>61</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>E.</given-names>
            <surname>Garmash</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Monz</surname>
          </string-name>
          ,
          <article-title>Ensemble learning for multi-source neural machine translation</article-title>
          ,
          <source>in: Proceedings of COLING</source>
          <year>2016</year>
          ,
          <source>the 26th International Conference on Computational Linguistics: Technical Papers</source>
          ,
          <source>The COLING 2016 Organizing Committee</source>
          , Osaka, Japan,
          <year>2016</year>
          , pp.
          <fpage>1409</fpage>
          -
          <lpage>1418</lpage>
          . URL: https://aclanthology.org/C16-1133.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          , T.-Y. Liu,
          <article-title>Transductive ensemble learning for neural machine translation</article-title>
          ,
          <source>Proceedings of the AAAI Conference on Artificial Intelligence</source>
          <volume>34</volume>
          (
          <year>2020</year>
          )
          <fpage>6291</fpage>
          -
          <lpage>6298</lpage>
          . URL: https://ojs.aaai.org/index.php/AAAI/article/view/6097. doi:
          <volume>10</volume>
          . 1609/aaai.v34i04.
          <fpage>6097</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Gori</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Monfardini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Scarselli</surname>
          </string-name>
          ,
          <article-title>A new model for learning in graph domains</article-title>
          ,
          <source>in: Proceedings. 2005 IEEE International Joint Conference on Neural Networks</source>
          ,
          <year>2005</year>
          ., volume
          <volume>2</volume>
          ,
          <year>2005</year>
          , pp.
          <fpage>729</fpage>
          -
          <lpage>734</lpage>
          vol.
          <volume>2</volume>
          . doi:
          <volume>10</volume>
          .1109/IJCNN.
          <year>2005</year>
          .
          <volume>1555942</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>F.</given-names>
            <surname>Scarselli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gori</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Tsoi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hagenbuchner</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. Monfardini,</surname>
          </string-name>
          <article-title>The graph neural network model</article-title>
          ,
          <source>IEEE Transactions on Neural Networks</source>
          <volume>20</volume>
          (
          <year>2009</year>
          )
          <fpage>61</fpage>
          -
          <lpage>80</lpage>
          . doi:
          <volume>10</volume>
          .1109/ TNN.
          <year>2008</year>
          .
          <volume>2005605</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>L.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Mao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <article-title>Graph convolutional networks for text classification</article-title>
          ,
          <source>Proceedings of the AAAI Conference on Artificial Intelligence</source>
          <volume>33</volume>
          (
          <year>2019</year>
          )
          <fpage>7370</fpage>
          -
          <lpage>7377</lpage>
          . URL: https://ojs. aaai.org/index.php/AAAI/article/view/4725. doi:
          <volume>10</volume>
          .1609/aaai.v33i01.
          <fpage>33017370</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Atwood</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Towsley</surname>
          </string-name>
          ,
          <article-title>Difusion-convolutional neural networks</article-title>
          , in: D.
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Sugiyama</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          <string-name>
            <surname>Luxburg</surname>
            ,
            <given-names>I. Guyon</given-names>
          </string-name>
          , R. Garnett (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>29</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2016</year>
          . URL: https://proceedings.neurips.cc/ paper/2016/file/390e982518a50e280d8e2b535462ec1f-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T. N.</given-names>
            <surname>Kipf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Welling</surname>
          </string-name>
          ,
          <article-title>Semi-supervised classification with graph convolutional networks</article-title>
          ,
          <source>in: 5th International Conference on Learning Representations, ICLR</source>
          <year>2017</year>
          , Toulon, France,
          <source>April 24-26</source>
          ,
          <year>2017</year>
          , Conference Track Proceedings, OpenReview.net,
          <year>2017</year>
          . URL: https: //openreview.net/forum?id=
          <fpage>SJU4ayYgl</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>F.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Souza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , C. Fifty,
          <string-name>
            <given-names>T.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Weinberger</surname>
          </string-name>
          ,
          <article-title>Simplifying graph convolutional networks</article-title>
          , in: K. Chaudhuri, R. Salakhutdinov (Eds.),
          <source>Proceedings of the 36th International Conference on Machine Learning</source>
          , volume
          <volume>97</volume>
          <source>of Proceedings of Machine Learning Research, PMLR</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>6861</fpage>
          -
          <lpage>6871</lpage>
          . URL: https://proceedings.mlr.press/v97/wu19e.html.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          , T. Ma, C. Xiao,
          <article-title>FastGCN: Fast learning with graph convolutional networks via importance sampling</article-title>
          ,
          <source>in: International Conference on Learning Representations</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>