<!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>Comparing Different Supervised Approaches to Hate Speech Detection</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Michele Corazzay</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Stefano Meniniz</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pinar Arslany</string-name>
          <email>pinar.arslang@inria.fr</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Rachele Sprugnoliz Elena Cabrioy</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sara Tonelliz</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Serena Villatay</string-name>
          <email>serena.villatag@unice.fr</email>
        </contrib>
      </contrib-group>
      <abstract>
        <p>English. This paper reports on the systems the InriaFBK Team submitted to the EVALITA 2018 - Shared Task on Hate Speech Detection in Italian Twitter and Facebook posts (HaSpeeDe). Our submissions were based on three separate classes of models: a model using a recurrent layer, an ngram-based neural network and a LinearSVC. For the Facebook task and the two cross-domain tasks we used the recurrent model and obtained promising results, especially in the cross-domain setting. For Twitter, we used an ngram-based neural network and the LinearSVC-based model.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Italiano. Questo articolo descrive i
modelli del team InriaFBK per lo Shared
Task on Hate Speech Detection in Italian
Twitter and Facebook posts (HaSpeeDe)
di EVALITA 2018. Tre classi di modelli
differenti sono state utilizzate: un
modello che usa un livello ricorrente, una rete
neurale basata su ngrammi e un
modello basato su LinearSVC. Per Facebook e
i due task cross-domain, si e` scelto un
modello ricorrente che ha ottenuto buoni
risultati, specialmente per quanto riguarda
i task cross-domain. Per Twitter, sono stati
utilizzati la rete neurale basata su
ngrammi e il modello basato su LinearSVC.</p>
    </sec>
    <sec id="sec-2">
      <title>1 Introduction</title>
      <p>
        In this paper, we describe the submitted systems
for each of the four subtasks organized within
the HaSpeeDe evaluation exercise at EVALITA
2018
        <xref ref-type="bibr" rid="ref4">(Bosco et al., 2018)</xref>
        : Hate speech
detection on Facebook comments (Task 1:
HaSpeeDeFB), Hate speech detection on tweets (Task 2:
HaSpeeDe-TW), Cross-domain task hate speech
detection from Facebook to Twitter posts (Task
3.1: Cross-HaSpeeDe FB) and Cross-domain task
hate speech detection from Twitter to Facebook
posts (Task 3.2: Cross-HaSpeeDe TW). We build
our models for these binary classification
subtasks testing recurrent neural networks,
ngrambased neural networks1 and a LinearSVC (Support
Vector Machine) approach2. In HaSpeeDe-TW,
which has comparatively short sequences with
respect to HaSpeeDe-FB, an ngram-based neural
network and a LinearSVC model were used, while
for HaSpeeDe-FB and the two cross-domain tasks
recurrent models were used.
2
      </p>
    </sec>
    <sec id="sec-3">
      <title>System Description</title>
      <p>
        We adopt a supervised approach and, to select the
best model for each task, we perform grid search
over different machine learning classifiers such
as Neural Networks (NN), Support Vector
Machines (SVM) and Logistic Regression (LR). Both
ngram-based (unigram and bigram) and recurrent
models using embeddings were tested, but only
the ones that were submitted for the tasks will be
described. A LinearSVC model from scikit-learn
        <xref ref-type="bibr" rid="ref12 ref13">(Pedregosa et al., 2011a)</xref>
        was also tested, and it
showed good performance on the Twitter dataset.
In order to perform a grid search over the
parameters and models, the training set released by the
task organisers was partitioned in three: 60% of it
was used for training, 20% for validation and 20%
for testing.3
2.1
      </p>
      <sec id="sec-3-1">
        <title>Preprocessing</title>
        <p>Since misspellings, neologisms, acronyms and
jargon are common in social media interactions, it
was necessary to carefully preprocess the data, in
1https://gitlab.com/ashmikuz/
creep-cyberbullying-classifier</p>
        <p>2https://github.com/0707pinar/
Hate-Speech-Detection/</p>
        <p>3To split the data we use the scikit-learn
train test split function, using 42 as seed value.
order to normalize it without losing information.
For this reason, we first replace URLs with the
word “url” and “@” user mentions with
“username” by using regular expressions.</p>
        <p>
          Since hashtags often provide important
semantic content, they are normalized by splitting them
into the words composing them. To this end,
we adapted to Italian the Ekphrasis tool
          <xref ref-type="bibr" rid="ref1">(Baziotis et al., 2017)</xref>
          , using as ngram model the Italian
Google ngrams starting from year 2000. In
addition to the aforementioned normalizations, for the
LinearSVC model we also stemmed Italian words
via the Snowball Stemmer
          <xref ref-type="bibr" rid="ref2">(Bird and Loper, 2004)</xref>
          and we removed stopwords.
2.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Feature Description</title>
        <p>
          We used the following text-derived features:
Word Embeddings: Italian fastText
embeddings
          <xref ref-type="bibr" rid="ref3">(Bojanowski et al., 2016)</xref>
          4 employed in
the recurrent models (Section 2.3);
Ngrams: unigrams and bigrams, used for
the ngram-based neural network and the
linearSVC (Sections 2.4, 2.5);
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Social-network specific features: the num</title>
        <p>ber of hashtags and mentions, the number of
exclamation and question marks, the number
of emojis, the number of words that are
written in uppercase.</p>
      </sec>
      <sec id="sec-3-4">
        <title>Sentiment and Emotion features: the word</title>
        <p>
          level emotion and sentiment tags for Italian
words extracted from the EmoLex
          <xref ref-type="bibr" rid="ref10 ref11">(Mohammad and Turney, 2013; Mohammad and
Turney, 2010)</xref>
          resource.
2.3
        </p>
      </sec>
      <sec id="sec-3-5">
        <title>Recurrent Neural Network Model</title>
        <p>In order to classify hate speech in social media
interactions, we believe that recurrent neural
networks are a useful tool, given their ability to
remember the sequence of inputs while considering
their order, differently from the feed-forward
models. In the context of our classifier, this allows the
model to remember the whole sequence of words
in the order they appear in.</p>
        <p>
          More specifically, our recurrent models,
implemented using Keras
          <xref ref-type="bibr" rid="ref6">(Chollet and others, 2015)</xref>
          ,
combine both sequences of word embeddings and
social media features. In order to achieve that, an
4https://github.com/facebookresearch/
fastText
asymmetric topology is used for the neural
network: the sequences of word embeddings are fed
to a recurrent layer, whose output is then
concatenated with the social features. The concatenated
vector is then fed to one or two feed forward fully
connected layers that use the Rectified Linear Unit
(ReLU) as their activation function. The output
layer is a single neuron with a sigmoid activation,
while binary cross-entropy is used as the loss
function for the model.
        </p>
        <p>
          Batch normalization and various kinds of
dropout have been tested to reduce the variance of
the models. Experimental results suggested that
applying the former to the output of the
recurrent layer had a negative effect on performance.
For this reason, batch normalization was applied
only to the output of the hidden layers. As for
dropout, we tried three different mechanisms. A
simple dropout layer
          <xref ref-type="bibr" rid="ref14">(Srivastava et al., 2014)</xref>
          is
applied to the output of the hidden layers, as
applying dropout to the output of the recurrent layer
introduces too much noise and does not improve
performance. We also tested a dropout on the
embeddings
          <xref ref-type="bibr" rid="ref3 ref8">(Gal and Ghahramani, 2016)</xref>
          that
effectively skips some of the word embeddings in the
sequence, as dropping part of the embedding
vector causes a loss of information, while dropping
entire words can help reduce overfitting. In
addition, a recurrent dropout
          <xref ref-type="bibr" rid="ref3 ref8">(Gal and Ghahramani,
2016)</xref>
          was also tested. While evaluating the
models, we tested both a Long Short Term
Memory (LSTM)
          <xref ref-type="bibr" rid="ref9">(Gers et al., 1999)</xref>
          and a Gated
Recurrent Unit (GRU)
          <xref ref-type="bibr" rid="ref5">(Cho et al., 2014)</xref>
          as recurrent
layers. The latter is functionally very similar to
an LSTM but by using less weights it can
sometimes reduce the variance of the model, improving
its performance.
2.4
        </p>
      </sec>
      <sec id="sec-3-6">
        <title>Ngram-based Neural Networks</title>
        <p>
          Ngram-based neural networks are structurally
similar to the recurrent models. We first
compute the unigrams and bigrams over the
lemmatized social media posts. The resulting vector is
then normalized by using tf-idf from scikit-learn
and concatenated to the social-specific features.
One or two hidden feed-forward layers are then
used, and the same output layer as in the recurrent
models is used. The same dropout and batch
normalization techniques used in the recurrent models
have been tested for the ngram-based neural
networks as well. For the first submitted run of Task
2: HaSpeeDe-TW, we used unigrams and bigrams
along with the required preprocessing steps based
on tf-idf model.
We implemented a Linear Support Vector
Classification system (i.e., LinearSVC)
          <xref ref-type="bibr" rid="ref7">(Fan et al.,
2008)</xref>
          based on bag-of-words (i.e., unigrams),
using scikit-learn
          <xref ref-type="bibr" rid="ref12 ref13">(Pedregosa et al., 2011b)</xref>
          for the
first submitted run in Task 2: HaSpeeDe-TW. We
chose this system as it scales well for large-scale
samples, and it is efficient to solve text
classification problems. To deal with imbalanced labels, we
set the class weight parameter as “balanced”.
To mitigate overfitting, penalty parameter C was
scaled as 0.7.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Submitted Runs and Results</title>
      <p>In this Section we describe the single runs
submitted for each task and we present the results. The
official ranking reported for each run is given in
terms of macro-average F-score.
3.1</p>
      <sec id="sec-4-1">
        <title>Task 1: HaSpeeDe-FB</title>
        <p>For Task 1: HaSpeeDe-FB, two recurrent models
were used. The first submitted run used a single
fully connected layer of size 200 and a GRU of
size 100 as the recurrent layer. Recurrent dropout
was applied to the GRU with value 0.2. The
second submitted run used two fully connected layers
of size 500 and a GRU of size 300 as the recurrent
layer. Simple dropout was applied to the output of
the feed-forward layers with value 0.5. The first
run ranked third and the second ranked fourth out
of 18 submissions (Table 1). As shown in Table
1, both runs yield a better performance on the hate
speech class.</p>
        <p>Category
Non Hate</p>
        <p>Hate
Macro AVG
Non Hate</p>
        <p>Hate
Macro AVG</p>
        <p>First Run</p>
        <p>P R
0.763 0.687
0.858 0.898
0.810 0.793</p>
        <p>Second Run
0.716 0.703
0.859 0.867
0.788 0.785</p>
        <p>F1
0.723
0.877
0.800
0.709
0.863
0.786
scribed in subsection 2.5. This run was ranked
sixth out of 19 submissions. As our second run on
the Task 2: HaSpeeDe-TW, an ngram-based
neural network was used having a single fully
connected hidden layer with size 200. Simple dropout
was applied to the hidden layer with value 0.5.
This run ranked fourth. Both runs show better
performance when classifying the non hate speech
class as displayed in Table 2.
For Task 3.1: Cross-HaSpeeDe FB two recurrent
models were used. In the first submitted run, two
hidden layers of size 500 were used. An LSTM of
size 200 was adopted as the recurrent layer.
Embeddings dropout was applied with value 0.5 and
a simple dropout was applied to the output of the
feed-forward layers with value 0.5. The recurrent
model for the second run had one hidden layer of
size 500. A GRU of size 200 was used as the
recurrent layer and no dropout was applied. The first
run ranked second out of 17 submissions while the
second run registered the best score in the Task
3.1: Cross-HaSpeeDe FB. In both runs, the
models showed good performance over the non hate
speech class, whereas the precision on the hate
speech class does not exceed 0.5 (see Table 3).</p>
        <p>Category
Non Hate</p>
        <p>Hate
Macro AVG
Non Hate</p>
        <p>Hate
Macro AVG</p>
        <p>First Run</p>
        <p>P R
0.810 0.675
0.497 0.670
0.653 0.672</p>
        <p>Second Run
0.818 0.660
0.494 0.694
0.656 0.677
In the first submitted run for Task 2:
HaSpeeDeTW, we used the LinearSVC-based model
deFor Task 3.2: Cross-HaSpeeDe TW two recurrent
models were used. In the first submitted run, two
hidden layers of size 500 were used together with
a GRU of size 200 as the recurrent layer.
Simple dropout was applied to the output of the
feedforward layers with value 0.2, whereas the
recurrent dropout has value 0.2. In the second
submitted run, one hidden layer of size 200 was used
adopting an LSTM of size 200 as the recurrent
layer. Embeddings dropout was applied with value
0.5. The first run ranked fourth out of 17
submissions, while the other run ranked second. Table 4
shows that in both cases the system showed good
performance over the hate speech class, while
detecting negative instances proved difficult, in
particular in terms of precision over the non hate
speech class.</p>
        <p>Category
Non Hate</p>
        <p>Hate
Macro AVG
Non Hate</p>
        <p>Hate
Macro AVG
Although all our runs obtained satisfactory
results in each task, there is still room for
improvement. In particular, we noticed that our models
have problems in classifying social media
messages containing the following specific
phenomena: (i) dialects (e.g. “un se ponno sent`ı...ma come
se fa`...”) or bad orthography (e.g. “Io no nesdune
delle due.....momti pesanti”); (ii) sarcasm, “Dopo
i campi rom via pure i centri sociali. L’unico
problema sara` distinguere gli uni dagli altri”; (iii)
references to world knowledge, typically used for
an indirect attack not containing an explicit insult
(e.g. “un certo Adolf sarebbe utile ancora oggi
con certi soggetti”); (iv) metaphorical expressions,
usually referring to ways to physically eliminate
the targets of hate speech messages (e.g.
“Ruspali”).</p>
        <p>As for false positives, some errors come from
the misclassification of messages containing the
lemmas “terrorista”, “terrorismo”, “immigrato”
that are extremely frequent in particular in the
Twitter dataset. These lemmas are associated to
the hate speech class even when they appear in
messages reporting the title of a news, eg. “Il
Giappone senza immigrati a corto di forza lavoro”.</p>
        <p>In Task 2: HaSpeeDe-TW, when the classifier
relies on sentiment and emotion features, we
registered several misclassified instances containing
relevant content words not covered by EmoLex.
This is due to the fact that for every English word,
EmoLex provides only one translated entry, thus
limiting the overall coverage. For instance, “to
kill” is translated in Italian with “uccidere” not
considering synonyms such as “ammazzare” often
used in the dataset.</p>
        <p>Finally, we noticed some inconsistencies in the
gold standard. For example, the message “Al solo
vederle danno il voltastomaco!” is annotated as
hate speech while, the almost equivalent, “Appena
le ho viste ho vomitato” is considered a non hate
speech instance while our models identify it as
hate speech. Similarly, an insult like “ridicoli”
is annotated as non hate speech in “CERTO CHE
GLI ONOREVOLI DEL PD SI RICONOSCONO
A KILOMETRI ... RIDICOLI” but as hate speech
in “Ci vorrebbe anche qua Putin, invece di quei
RIDICOLI...PAROLACCE PAROLACCE”.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>In this paper we presented an overview of the
runs submitted for the four subtasks of HaSpeeDe
evaluation exercise. We implemented a number
of different models, comparing recurrent neural
networks, ngram-based neural networks and
linear SVC. While RNNs perform better in three of
four tasks, classification on Twitter data achieves
a better ranking using the ngram based neural
network. Our system was ranked first among all
the teams in one of the cross-domain task, i.e.
Cross-HaSpeeDe FB. This is probably due to the
fact that considering the whole sequence of inputs
with a recurrent neural networks and using a
prelearned representation by using word embeddings
help the model to learn some common traits of
hate speech across different social media.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>Part of this work was funded by the CREEP
project (http://creep-project.eu/), a
Digital Wellbeing Activity supported by EIT
Digital in 2018. This research was also
supported by the HATEMETER project (http://
hatemeter.eu/) within the EU Rights,
Equality and Citizenship Programme 2014-2020.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Christos</given-names>
            <surname>Baziotis</surname>
          </string-name>
          , Nikos Pelekis, and
          <string-name>
            <given-names>Christos</given-names>
            <surname>Doulkeridis</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>DataStories at SemEval-2017 Task 4: Deep LSTM with Attention for Message-level and Topic-based Sentiment Analysis</article-title>
          .
          <source>In Proceedings of the 11th International Workshop on Semantic Evaluation (SemEval-2017)</source>
          , pages
          <fpage>747</fpage>
          -
          <lpage>754</lpage>
          , Vancouver, Canada, August. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Steven</given-names>
            <surname>Bird</surname>
          </string-name>
          and
          <string-name>
            <given-names>Edward</given-names>
            <surname>Loper</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>Nltk: the natural language toolkit</article-title>
          .
          <source>In Proceedings of the ACL 2004 on Interactive poster and demonstration sessions, page 31</source>
          .
          <article-title>Association for Computational Linguistics</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Piotr</given-names>
            <surname>Bojanowski</surname>
          </string-name>
          , Edouard Grave, Armand Joulin, and
          <string-name>
            <given-names>Tomas</given-names>
            <surname>Mikolov</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Enriching Word Vectors with Subword Information</article-title>
          . arXiv preprint arXiv:
          <volume>1607</volume>
          .
          <fpage>04606</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Cristina</given-names>
            <surname>Bosco</surname>
          </string-name>
          , Felice Dell'Orletta, Fabio Poletto, Manuela Sanguinetti, and
          <string-name>
            <given-names>Maurizio</given-names>
            <surname>Tesconi</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Overview of the EVALITA 2018 HaSpeeDe Hate Speech Detection (HaSpeeDe) Task</article-title>
          . In Tommaso Caselli, Nicole Novielli, Viviana Patti, and Paolo Rosso, editors,
          <source>Proceedings of the 6th evaluation campaign of Natural Language Processing</source>
          and
          <article-title>Speech tools for Italian (EVALITA18), Turin</article-title>
          , Italy, December. CEUR.org.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Kyunghyun</given-names>
            <surname>Cho</surname>
          </string-name>
          , Bart Van Merrie¨nboer, Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and
          <string-name>
            <given-names>Yoshua</given-names>
            <surname>Bengio</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Learning phrase representations using RNN encoder-decoder for statistical machine translation</article-title>
          .
          <source>arXiv preprint arXiv:1406</source>
          .
          <fpage>1078</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Franc¸ois Chollet</surname>
          </string-name>
          et al.
          <year>2015</year>
          . Keras. https:// keras.io.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Rong-En</surname>
            <given-names>Fan</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kai-Wei</surname>
            <given-names>Chang</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cho-Jui</surname>
            <given-names>Hsieh</given-names>
          </string-name>
          , XiangRui Wang, and
          <string-name>
            <surname>Chih-Jen Lin</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Liblinear: A library for large linear classification</article-title>
          .
          <source>Journal of machine learning research</source>
          ,
          <volume>9</volume>
          (Aug):
          <fpage>1871</fpage>
          -
          <lpage>1874</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Yarin</given-names>
            <surname>Gal</surname>
          </string-name>
          and
          <string-name>
            <given-names>Zoubin</given-names>
            <surname>Ghahramani</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>A theoretically grounded application of dropout in recurrent neural networks</article-title>
          .
          <source>In Advances in neural information processing systems</source>
          , pages
          <fpage>1019</fpage>
          -
          <lpage>1027</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Felix A Gers</surname>
          </string-name>
          ,
          <article-title>Ju¨rgen Schmidhuber, and</article-title>
          <string-name>
            <given-names>Fred</given-names>
            <surname>Cummins</surname>
          </string-name>
          .
          <year>1999</year>
          .
          <article-title>Learning to forget: Continual prediction with LSTM</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Saif M Mohammad and Peter D Turney</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Emotions evoked by common words and phrases: Using mechanical turk to create an emotion lexicon</article-title>
          .
          <source>In Proceedings of the NAACL HLT</source>
          <year>2010</year>
          <article-title>workshop on computational approaches to analysis and generation of emotion in text</article-title>
          , pages
          <fpage>26</fpage>
          -
          <lpage>34</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Saif M Mohammad and Peter D Turney</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Crowdsourcing a word-emotion association lexicon</article-title>
          .
          <source>Computational Intelligence</source>
          ,
          <volume>29</volume>
          (
          <issue>3</issue>
          ):
          <fpage>436</fpage>
          -
          <lpage>465</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>F.</given-names>
            <surname>Pedregosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Varoquaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gramfort</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Michel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thirion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Grisel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Blondel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Prettenhofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Weiss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dubourg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vanderplas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Passos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cournapeau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Perrot</surname>
          </string-name>
          , and
          <string-name>
            <surname>E. Duchesnay.</surname>
          </string-name>
          2011a.
          <article-title>Scikit-learn: Machine learning in Python</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          ,
          <volume>12</volume>
          :
          <fpage>2825</fpage>
          -
          <lpage>2830</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Fabian</given-names>
            <surname>Pedregosa</surname>
          </string-name>
          , Gae¨l Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel,
          <string-name>
            <given-names>Peter</given-names>
            <surname>Prettenhofer</surname>
          </string-name>
          , Ron Weiss,
          <string-name>
            <surname>Vincent Dubourg</surname>
          </string-name>
          , et al. 2011b.
          <article-title>Scikit-learn: Machine learning in python</article-title>
          .
          <source>Journal of machine learning research</source>
          ,
          <volume>12</volume>
          (Oct):
          <fpage>2825</fpage>
          -
          <lpage>2830</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>Nitish</given-names>
            <surname>Srivastava</surname>
          </string-name>
          , Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and
          <string-name>
            <given-names>Ruslan</given-names>
            <surname>Salakhutdinov</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Dropout: a simple way to prevent neural networks from overfitting</article-title>
          .
          <source>The Journal of Machine Learning Research</source>
          ,
          <volume>15</volume>
          (
          <issue>1</issue>
          ):
          <fpage>1929</fpage>
          -
          <lpage>1958</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>