<!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>Fusing Stylistic Features with Deep-learning Methods for Profiling Fake News Spreaders</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Roberto Labadie-Tamayo, Daniel Castro-Castro</institution>
          ,
          <addr-line>and Reynier Ortega-Bueno</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Universidad de Oriente</institution>
          ,
          <addr-line>Santiago de Cuba</addr-line>
          ,
          <country country="CU">Cuba</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <abstract>
        <p>False or unverified information spreads just like accurate information on social media platforms, thus possibly going viral and influencing the public opinion and its decisions. Fake news represents one of the most popular forms of false and unverified information, and should be identified as soon as possible for minimizing their dramatic effects. In order to face this challenge, in this paper we describe our system developed for participating in the Author Profiling task: “Profiling Fake News Spreaders on Twitter” proposed at the PAN 2020 Forum. Our proposal learns two representations for each tweet in an account's profile. The first one is based on CNN and LSTM nets analyzing the tweets at word level, the second one is learned by using the same architecture without sharing the weights, but at this time, the tweets are analyzed at character-level. These representations are used for modeling the accounts' profiles. Also is conceived for the whole account's profile a general representation based on stylistic features, which contains information about the writing style. Finally, the profiles' representations are given as inputs to our classification model which is based on LSTM neural nets with attention mechanism. Experimental results show that our model achieves encourage results.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>In this actual modern society, a big part of the communication between peoples is
established by digital information, using videos, photos, texts, among others. Everyday
the amount of digital information generated by each person is growing very fast and the
analysis of these data to satisfy the users’ needs is also a challenging task. Specifically
the analysis of textual data introduces several challenges because texts are unstructured
information written in Natural Language (NL), also there are a lot of textual genre and
diversity of languages.</p>
      <p>Computational applications for e-marketing and Forensic Analysis based on textual
information deal with the mentioned diversity of challenges, but also it is important for
them to known social demographic characteristics of author’s texts in order to direct
the extraction of valuable information from textual sources. Author Profiling (AP) task
aims at discovering different marks or patterns (linguistic or not) from texts, that allows
to identify some characteristics of the authors, e.g. age, sexual gender, personality, etc.</p>
      <p>One of the most important evaluation forums to share recent research and ideas
for tasks such as Author Profiling and Authorship Detection (AD), can be found in
the platform PAN 1. Specifically, AP task has focused in the last editions on analyzing
micro-blogging textual genre due to the importance to known what and how information
is spread among users and communities, and which are the profile characteristics of
such users.</p>
      <p>PAN 2016 profiling task [24] addressed the prediction of age and gender from a
cross-genre perspective, using tweets as training samples and a different textual genre
for evaluation. The main goal of PAN 2017 profiling [23] was to identify the gender and
language variety from Twitter messages. In PAN 2018 profiling task [22] the goal was
to address gender identification from a multi-modal perspective considering text and
images. The last edition PAN 2019 profiling task [19] focused on determining whether
the author of a Twitter feed is a bot or human and to profile the gender for human
authors.</p>
      <p>
        There are others efforts in the research community for AP analysis, such as profiling
authors from Arabic [21][20][28], Russian [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] and the Mexican variant of the Spanish
language [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Generally, the most studied languages had been English and Spanish,
whereas gender and age are the social demographic characteristics most explored. In
addition, Twitter has raising as the most salience textual genre, due to its popularity as
social platform.
      </p>
      <p>A bad phenomenon that is not new, but in last years have gained special significance
is the spreading of Fake News, due to its dramatic growing in social media and news
sources. That is the reason why a lot of recent works try to discover when a text is
fake or at least it contains false or unverified information. However, as important as
knowing when a text is fake or not, is to verify when a source generates and spreads
fake information or misinformation, for example, a company that promotes its product
without the quality promoted, false data published in an election campaign, etc. These
last scenarios could be analyzed with the use of Author Profiling technique.</p>
      <p>
        In this direction, the PAN Profiling task of this year “Profiling Fake News Spreaders
on Twitter”, focus on “Given a Twitter feed, determine whether its author is keen to be
a spreader of fake news” [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
      </p>
      <p>The working note is organized as follow: in the next section a brief description about
the main aspects of the related works presented in the last three profiling evaluation
forum. Next, we present our proposal. Specifically, we describe the data preprocessing
as well as the deep-learning method used as classification model. Finally, we describe
the experimental setting, the experiments conducted and the results achieved.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Works</title>
      <p>
        Different aspects would be considered as part of the AP algorithms presented by the
research community and highlighted in the overviews published by the organizers on
1 https://pan.webis.de/
different PAN profiling editions. An important issue is the preprocessing step applied
to the texts, considering that genre dependent characteristics can be eliminated or
homogenized, such as in tweets, the use of hashtag, mentions, URL, etc. Generally,
previous approaches have used content and style-based features and in recent years words
and characters embeddings [23][22][19]. Regarding the machine learning algorithms,
the most of studied works have employed traditional methods like Logistic Regression
(LR) [31], Support Vector Machine (SVM) [26] and Random Forest (RF) [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], among
others.
      </p>
      <p>
        The textual information has been represented through lexical and character features,
by using of n-gram models and bag of words (BoW) representation [26][31]. Several
approaches have employed style features like the analysis of capital letters, function
words, punctuation marks, etc. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ][
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In recent PAN profiling task, words and
documents embedding was introduced [23][22][19][
        <xref ref-type="bibr" rid="ref15">15</xref>
        ][
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
      <p>
        Shallow machine learning methods are the most employed ones, and among these,
the most used are SVM, RF, LR and distance-based approaches. Generally, since PAN
2017, deep-learning techniques were introduced. Particularlly, the methods have
focused on the use of Convolutional Neural Nets (CNN) and Recurrent Neural Nets
(RNN) [25][
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>The goal of our approach is to fuse general stylistic features with deep
learningbased representations. The stylistic feature vector will be used as an input representation
to be part of the learning process in our deep-learning architecture.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Our Proposal</title>
      <p>The motivation of our approach is twofold: firstly the ability of deep-learning methods
to learn feature representations that are omitted in hand-craft features engine, also the
dexterity of these methods for modeling abstraction levels beyond of human bounds.
Secondly, author profiling task based on stylistic and linguistic features combined with
shallow supervised learning methods have been well studied in previous research works.
These features have proved to be adequate descriptors to determine some author
characteristics such as: age, sexual gender, language variety, personality, etc. Keeping this in
mind, our proposal learn two representations for each tweet in an account profile, which
are combined with a whole account’s profile representation based on stylistic features
as can be shown in Figure. 1.</p>
      <p>The first representation is based on Convolutional and Long Short Term Memory
networks analyzing the tweets at word level (encoder word-level, R1), the second
representation is learned by using the same architecture without sharing the weights of the
network, but at this time the tweets are analyzed at character level (encoder
characterlevel, R2). Finally, the last representation is based on stylistic features (R3), which
contain relationships between the use of grammatical structures like nouns, adjectives,
lengths of words, function words, etc.</p>
      <p>Our overall classification model is based on LSTM neural nets with attention
mechanism (LSTM-Att). It receives as input the sequence of tweets in a Twitter’s feed.
Firstly, each tweet in the sequence is encoded by a dense vector which is composed by
the representations obtained by the encoder at word-level and character-level
respectively. Later, the output vector learned by our LSTM-Att is combined with the stylistic
features and fed into a dense layer to classify the account as fake spreader or not.</p>
      <p>Details about our proposal are presented in the next subsections. Particularly,
Section 3.1 introduces the preprocessing phase carried out on the tweets. Following, in
Section 3.2 the stylistic features used in this work for modeling the Twitter’s feeds are
described. Later, Section 3.3 presents the architecture of the encoder models at word
and character levels for obtaining the deep learning-based representation of the
messages. Finally, Section 3.4 describes our overall classification model (LSTM-Att) and
explains how the representations are fused to classify the Twitter’s feed as fake spreader
or not.
3.1</p>
      <sec id="sec-3-1">
        <title>Preprocessing</title>
        <p>
          In the preprocessing step, the tweets are cleaned. Firstly, the numbers and dates are
recognized and replaced by a corresponding wildcard which encodes the meaning of
these special tokens. Afterwards, tweets are tokenised and morphologically analyzed
by means of FreeLing[
          <xref ref-type="bibr" rid="ref3">3</xref>
          ][
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. Also, we deal with the problem of character flooding.
To this end, all repetitions of three or more contiguous characters are normalized to
only two characters. Notice that, this normalization is applied when the messages are
processing at word level, in case of character level we do not apply the normalization
step.
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Stylistic Feature</title>
        <p>A key aspect of our proposal is the input representation based on statistical style features
that capture information from distinct lexical and syntactical linguistic layers. For the
representation of a text, it was defined 177 features for capturing relevant
characteristics of the writing style of the author. Features were structured in six subsets considering
different textual layers. These layers are boolean, character, sentence, paragraph,
syntactic and the document.</p>
        <p>Examples for each of the layers subset of features:
1. Boolean layer: Uses the same word to finish a sentence and to begin the next
sentence.</p>
        <p>Our stylistic feature-based representation are completely independent of the textual
genre, and in our proposal, the representation was build for each profile, see Figure. 2.,
for that reason several features can appear as duplicated value because it is considered
that the tweet is a document which contains only one paragraph, and this paragraph is
formed by one sentence.</p>
        <p>Notice that in the representation were involved different data structure values, since
are computed boolean stylistic features as float data features.
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>CNN+LSTM Encoder Architecture</title>
        <p>This section introduces the architecture of our CNN+LSTM encoder model shown on
Figure. 3.which can be divided in two parallel sub-architectures which do not share
weights but have the same structure. One of the encoder’s sub-architecture processes
the tweets at word-level whereas the another at character-level. This model aims at
encoding syntactic and semantic properties of the tweets which could be correlated
with the usage of fake and unverified content in the messages.</p>
        <p>
          CNN Layers Our encoder model receives as input a tweet as a zero padded sequence,
in order of having the same length ls. This sequence is passed into an embedding layer.
Notice that, at word-level this layer is set up with fixed weights from Google’s Word2Vec
pre-trained embedding [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], whereas at character-level its weights are initialized
randomly and set up as trainable.
        </p>
        <p>As output of the embedding layer a matrix of real values E^ls d is obtained, where
each row is a dense vector that represents an element in the tweet sequence. Later, over
that matrix E^ls d is applied convolutional operations (conv-op) through a CNN layer
composed by filters Fk 2 &lt;hk ls with different window sizes hk to learn and capture
short-term spacial relationships between the elements of the sequence. The conv-op
for each set of filters with the same windows size, transforms its input into a matrix
C 2 &lt;ls nf , with nf the number of filters used for current window size, on which is
applied the non-linearity function ReLU.</p>
        <p>For every filter k at position p of the sequence matrix the convolution operation is
defined as:</p>
        <p>hk ls
Cp;k = X X E^p+i;j Fki;j
i=0 j=0
(1)</p>
        <p>In order to preserve the output dimensions, the convolutional layer uses same padding
before the conv-op. For every set of filters also was applied dropout [30] to reduce
overfitting. Later, the outputs of each set of filters is passed through a maxpooling layer to
keep relevant information, the windows size for maxpooling is the same as its
corresponding filter. Therefore, these representations are again zero padded to be
concatenated.</p>
        <p>Self-Attention Layer Each element in the new sequence obtained from the CNN, as
features map, provides relevant or not information about the message. In order to
highlight the most important elements for encoding the message instead making the network
pays attention to all elements alike, they are scored by its relative importance over the
other elements on its context, with a self-attention layer [32].</p>
        <p>gt;t0 = tanh(Wxxt + Wxt0 xt0 + bg)
Where Wx; Wxt0 2 &lt;nu d are weight matrices which encode the representation of xt
and xt0 , to compute their compatibility as at;t0 :
at;t0 = (Wagt;t0 + ba)
x^t =</p>
        <p>X at;t0 xt0
i=0
With Wa a weight matrix to give them a non-linearity combination, ba their respective
bias term, and the sigmoid function. Then the final representation of xt is the weighted
sum of all elements in sequence (4).</p>
        <p>
          LSTM Layer The output of the attention layer is fed into a (LSTM) layer [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. LSTM
networks are a special kind of RNNs, which are specialized on analyzing sequential
data. RNNs have a main cell unit (the recurrent unit) which explores the data sequence
one element in each time step (left to right order). This network shares the information
captured in the previous step, for computing the new hidden state at the current time
step.
        </p>
        <p>Let ht 1 the last computed hidden state, xt 2 &lt;1 d, the tth element in the input
sequence and f a non-linearity function. The current hidden state ht is defined as:</p>
        <p>Let xt a dense vector that represents the tth element in the sequence, self-attention
layer learns how important it is and provides as output a new dense vector x^t, that
capture the relations of xt with the other elements xt0 in the sequence as gt;t0 :
it = (Wixt + Uiht 1 + bi)
ot = (Woxt + Uoht 1 + bo)
ft = (Wf xt + Uf ht 1 + bf )
ht = f (Wxxt + Whht 1 + bh)</p>
        <p>Where Wx 2 &lt;nu d and Wh 2 &lt;nu nu are the weights matrices and bh 2 &lt;1 nu
the bias term.</p>
        <p>
          RNNs suffer from the problems of vanishing and exploding gradients [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], which
hamper learning of long term dependencies among the elements in the input sequence.
This limitation is what the more complex structure of LTSM tries to solve, with gates
which learn to decide what information to preserve or forget from the previous time
step.
        </p>
        <p>Let Wf ; Wi; Wo 2 &lt;nu d and Uf ; Ui; Uo 2 &lt;nu nu the weights matrices of
forget, input and output gates respectively and bf ; bi; bo 2 &lt;1 nu their bias terms
respectively.
(2)
(3)
(4)
(5)
(6)
(7)
A potential output c^t is computed considering the previous hidden state ht 1 and the
current element of the sequence xt.</p>
        <p>c^t = (Wcxt + Ucht 1 + bc)
(9)
Where Uc 2 &lt;nu d and Uc 2 &lt;nu nu are weights matrices and bc 2 &lt;1 nu is a bias
term. This potential output is combined with the vector computed by the input gate and
added up to the output preserved from the previous time step as:
(10)
(11)
ct = ftct 1 + it tanh(c^t)</p>
        <p>ht = ot tanh(ct)
Finally, the hidden state ht at current position t is defined as:
The LSTM layer used by our encoder was set up with 64 units, using dropout to prevent
over-fitting.</p>
        <p>From the set of hidden states of the LSTM layer’s outputs is taken the last one,
which has encoded all information of relationships among the elements in the input
sequence and is fed into a fully connected layer with 32 units. Then the encoded
representation obtained by both layers, at word and character levels, is concatenated and fed
into another dense layer with 32 units.</p>
        <p>
          As output of this encoder we get a fused feature representation learned from
wordlevel and character-level over the message. Our encoder model was trained with a
supervised learning task above the provided data for “Profiling Fake News Spreaders on
Twitter” task[
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], where we used as target for each tweet, whether it belongs to a fake
new spreader account or not, which implied adding an extra fully connected layer with
one neuron for making the prediction.
3.4
        </p>
      </sec>
      <sec id="sec-3-4">
        <title>LSTM-Att Classifier model</title>
        <p>Our final classifier model has two inputs for an account profile. Firstly, it receives the
sequence of tweets, previously encoded by our CNN+LSTM encoder. Notice that, for
each tweet in the account profile we obtain a dense vector that encodes its content. The
set of vectors corresponding to each account’s tweet are interpreted as sequential data,
even when do not necessarily exist temporal relationships among them.</p>
        <p>The second input is a fixed length vector of stylistic features extracted from the
account profile. The architecture of our classification model (LSTM-Att) can be observed
in Figure. 4.</p>
        <p>The input sequence of vectors is fed into a Bidirectional-LSTM (BiLSTM) [29]
layer, which consists in a 64 units LSTM cell, that returns two concatenated hidden
states per each element in the sequence, one corresponding to a forward pass trough the
sequence and another to the backward pass.</p>
        <p>BiLSTM layer detects not just relations of an element with the previous ones, but
also with the elements that appear after it. The hidden state in the time step t is ht =
!
h t h t. Also, on this layer we applied dropout to prevent over-fitting. After that, the
BiLSTM output is passed into a self-attention layer, where they are weighted by its
relevance. Then, the output of the attention layer is passed into a simple LSTM layer,
where we only keep the last hidden state as the profile’s deep representation.</p>
        <p>The profile’s style-based representation is fed into a fully connected layer with 32
unit, to synthesize its information, using the sigmoid as activation function. Then, both
representation are concatenated and fed into a new fully connected layer whit 32 units,
with ReLU as the activation function. The output of the previous layer is passed into
the last dense layer, which give us a real number between 0 and 1, representing the
probability that the profile be a fake news spreader.</p>
        <p>The final decision of our model is binary, if the output of our model is equal or
greater than 0.5, the account profile is considered as a fake news spreader, in other case,
it is considered as no fake news spreader.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experiments and Results</title>
      <p>
        For training and developing our model we used Keras [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] framework with Tensorflow[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
backend on a GTX1050 with 4GB. The datasets used in this work are balanced.
Nevertheless the data provided for the task “Profiling Fake News Spreaders on Twitter”
is relatively small, since we have just 300 examples between fake news spreader and
not fake news spreader profiles for English and Spanish, which may difficult the
deeplearning models’ training phase. The CNN+LSTM encoders and the LSTM-Att
classifier models were trained using the Adam Optimizer [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], and the loss function was
binary cross-entropy.
      </p>
      <p>During the training phase carried out on the CNN+LSTM encoder the 90% of the
dataset provided by the organizers was used for training whereas the 10% remaining
was used as validation dataset. Firstly, the number of filters for each window size and
the learning rate (lr) used by the Adam optimizer method were tuned. In the Figure.
5 we shown the hyper-parameter settings which produce better reductions of the loss
curve. Particularly, fixing the learning rate lr = 0:003 and using 32 filters per windows
size (3, 4, 5) achieved the best performance and produced the best trade-off respect to
validation-training loss. We hypothesize that this setting has better performance w.r.t
ones with more filters as result of the number of parameters which need to be learned
by more complex model from a relative small dataset. It is worth to remark that we
applied an early stopping strategy to prevent the over-fitting, we consider a patience
value equal to 10 epochs.</p>
      <p>Spanish language
(a) lr: 2e-3, conv. filters per win- (b) lr: 3e-3, conv. filters per win- (c) lr: 3e-3, conv. filters per
window size: 32 dow size: 32 dow size: 100</p>
      <p>English language
(d) lr: 2e-3, conv. filters per win- (e) lr: 3e-3 conv. filters per window (f) lr: 3e-3, conv. filters per
window size: 32 size: 32 dow size: 100</p>
      <p>Considering that, the profiling task proposed by PAN’ 2019: Bots and Gender
Profiling 2019 [19] is closed-related with the current profiling task, we hypothesize that,
performing transfer-learning from the weights learned on the dataset and the task
introduced in 2019, would improve the effectiveness of our model. For that, we evaluated
two distinct strategies. In first one (Fine-tuning), we train our model LSTM-Att on the
PAN’ 2019 dataset and later retrain the model on the dataset provided for the fake news
spreader detection task. The second one (Fixed-weights), is based on the idea of training
the model on the PAN’ 2019 dataset and fixing all weights except those from the last two
dense layers. Later, is retrained using the dataset provided for the fake news spreader
detection task to learn the new weights of these two layers. As can be observed in Table.
1, applying transfer-learning improved the performance of our LSTM-Att model,
particularly for the English language. Regarding the both strategies, we can observe that
the Fine-tuning outperform the Fixed-weights in both languages.</p>
      <p>During training phase carried out on the LSTM-Att model was used a cross-validation
method to obtain a more realistic an unbiased performance evaluation. On each
crossvalidation step, the dataset was split in 10 % for validation and 90% for training. Also
as we mentioned above, the tweets which compose the accounts’ sequence have no
necessary temporal relationships among them. Keeping this in mind, on every epoch the
order of the elements in the sequence was random shuffled to prevent learning some
kind of wrong patterns.</p>
      <p>For training our model we tuned the learning parameter used by the Adam method,
choosing the one with higher accuracy average among the validation subsets used in
the cross-validation method. As we showed in Table. 2 the setting which obtained the
better performance was with lr = 0:001.</p>
      <p>Also we tried to exclude the profile’s style-based features vector in order to avoid
introducing hand-crafted features, but as we can see in Table. 3 this representation helps
our model to improve its accuracy.</p>
      <p>Regarding official evaluation and results, our system’s submission for facing the
task “Profiling Fake News Spreaders on Twitter” used the same architecture for the
CNN+LSTM encoders and the LSTM-Att classifier. Also we considered the same
values for the hyper-parameters for both languages, English and Spanish, on the training
phase. Moreover, taking into account the positive impact of the style-based features in
our model we introduced this representation in the final submission. After the
evaluation on the test dataset proposed by the organizers by means of the accuracy measure,
our model obtained an acc=0.705 and acc=0.720 for English and Spanish languages
respectively. Regarding the official ranking, a first glance at Table. 4 allows to observe
that our submission was ranked as 26th from a total of 66 teams and several baselines.
Notice that, our system outperforms the LSTM baseline which is based on deep-leaning
method.
In this paper we described our system for participating in the PAN 2020 Author
Profiling task: “Profiling Fake News Spreaders on Twitter”. Our proposal is based on LSTM
neural nets with attention mechanism (LSTM-Att). It receives as input the sequence of
tweets in a Twitter’s feed. Firstly, each tweet in the sequence is encoded by a dense
vector which is composed by the fusion of the representations obtained by the encoder
at word-level and character-level respectively. Later, the output vector learned by our
LSTM-Att is combined with the stylistic features and fed into dense layers to classify
the account as fake spreader or not. The results shown that considering both the stylistic
representation and the deep representations learned at word-level and character-level by
our encoder CNN+LSTM obtains the best effectiveness based on the accuracy measure.
Due to encouraging results of our approach, we think that including other linguistic
features, mainly those related with affective information and personality traits could be a
way to increase the effectiveness. Also, we plan to consider other deep representation
methods based on unsupervised deep language modeling. We would like to explore
these ideas in the future work.
19. Pardo, F.M.R., Rosso, P.: Overview of the 7th author profiling task at pan 2019: Bots and
gender profiling in twitter. In: Proceedings of the CEUR Workshop, Lugano, Switzerland.
pp. 1–36 (2019)
20. Pardo, F.M.R., Rosso, P., Charfi, A., Zaghouani, W., Ghanem, B., Sánchez-Junquera, J.: On
the author profiling and deception detection in arabic shared task at FIRE. In: Majumder, P.,
Mitra, M., Gangopadhyay, S., Mehta, P. (eds.) FIRE ’19: Forum for Information Retrieval
Evaluation, Kolkata, India, December, 2019. pp. 7–9. ACM (2019),
https://doi.org/10.1145/3368567.3368586
21. Pardo, F.M.R., Rosso, P., Charfi, A., Zaghouani, W., Ghanem, B., Sánchez-Junquera, J.:
Overview of the track on author profiling and deception detection in arabic. In: Mehta, P.,
Rosso, P., Majumder, P., Mitra, M. (eds.) Working Notes of FIRE 2019 - Forum for
Information Retrieval Evaluation, Kolkata, India, December 12-15, 2019. CEUR Workshop
Proceedings, vol. 2517, pp. 70–83. CEUR-WS.org (2019),
http://ceur-ws.org/Vol-2517/T2-1.pdf
22. Pardo, F.M.R., Rosso, P., Montes-y-Gómez, M., Potthast, M., Stein, B.: Overview of the 6th
author profiling task at PAN 2018: Multimodal gender identification in twitter. In:
Cappellato, L., Ferro, N., Nie, J., Soulier, L. (eds.) Working Notes of CLEF 2018
Conference and Labs of the Evaluation Forum, Avignon, France, September 10-14, 2018.
CEUR Workshop Proceedings, vol. 2125. CEUR-WS.org (2018),
http://ceur-ws.org/Vol-2125/invited_paper_15.pdf
23. Pardo, F.M.R., Rosso, P., Potthast, M., Stein, B.: Overview of the 5th author profiling task
at PAN 2017: Gender and language variety identification in twitter. In: Cappellato, L.,
Ferro, N., Goeuriot, L., Mandl, T. (eds.) Working Notes of CLEF 2017 - Conference and
Labs of the Evaluation Forum, Dublin, Ireland, September 11-14, 2017. CEUR Workshop
Proceedings, vol. 1866. CEUR-WS.org (2017),
http://ceur-ws.org/Vol-1866/invited_paper_11.pdf
24. Pardo, F.M.R., Rosso, P., Verhoeven, B., Daelemans, W., Potthast, M., Stein, B.: Overview
of the 4th author profiling task at PAN 2016: Cross-genre evaluations. In: Balog, K.,
Cappellato, L., Ferro, N., Macdonald, C. (eds.) Working Notes of CLEF 2016 - Conference
and Labs of the Evaluation forum, Évora, Portugal, 5-8 September, 2016. CEUR Workshop
Proceedings, vol. 1609, pp. 750–784. CEUR-WS.org (2016),
http://ceur-ws.org/Vol-1609/16090750.pdf
25. Petrík, J., Chudá, D.: Bots and gender profiling with convolutional hierarchical recurrent
neural network. In: Cappellato, L., Ferro, N., Losada, D.E., Müller, H. (eds.) Working Notes
of CLEF 2019 - Conference and Labs of the Evaluation Forum, Lugano, Switzerland,
September 9-12, 2019. CEUR Workshop Proceedings, vol. 2380. CEUR-WS.org (2019),
http://ceur-ws.org/Vol-2380/paper_214.pdf
26. Pizarro, J.: Using n-grams to detect bots on twitter. In: Cappellato, L., Ferro, N., Losada,
D.E., Müller, H. (eds.) Working Notes of CLEF 2019 - Conference and Labs of the
Evaluation Forum, Lugano, Switzerland, September 9-12, 2019. CEUR Workshop
Proceedings, vol. 2380. CEUR-WS.org (2019),
http://ceur-ws.org/Vol-2380/paper_183.pdf
27. Rangel, F., Franco-Salvador, M., Rosso, P.: A Low Dimensionality Representation for
Language Variety Identification. In: International Conference on Intelligent Text Processing
and Computational Linguistics. pp. 156–169. Springer (2016)
28. Rosso, P., Pardo, F.M.R., Hernandez-Farias, I., Cagnina, L.C., Zaghouani, W., Charfi, A.: A
survey on author profiling, deception, and irony detection for the arabic language. Lang.</p>
      <p>Linguistics Compass 12(4) (2018), https://doi.org/10.1111/lnc3.12275
29. Schuster, M., Paliwal, K.K.: Bidirectional recurrent neural networks. IEEE Trans. Signal</p>
      <p>Process. 45(11), 2673–2681 (1997), https://doi.org/10.1109/78.650093
30. Srivastava, N., Hinton, G.E., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.: Dropout: a
simple way to prevent neural networks from overfitting. J. Mach. Learn. Res. 15(1),
1929–1958 (2014), http://dl.acm.org/citation.cfm?id=2670313
31. Valencia-Valencia, A.I., Gómez-Adorno, H., Rhodes, C.S., Pineda, G.F.: Bots and gender
identification based on stylometry of tweet minimal structure and n-grams model. In:
Cappellato, L., Ferro, N., Losada, D.E., Müller, H. (eds.) Working Notes of CLEF 2019
Conference and Labs of the Evaluation Forum, Lugano, Switzerland, September 9-12,
2019. CEUR Workshop Proceedings, vol. 2380. CEUR-WS.org (2019),
http://ceur-ws.org/Vol-2380/paper_216.pdf
32. Zheng, G., Mukherjee, S., Dong, X.L., Li, F.: Opentag: Open attribute value extraction from
product profiles. In: Guo, Y., Farooq, F. (eds.) Proceedings of the 24th ACM SIGKDD
International Conference on Knowledge Discovery &amp; Data Mining, KDD 2018, London,
UK, August 19-23, 2018. pp. 1049–1058. ACM (2018),
https://doi.org/10.1145/3219819.3219839</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Abadi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Agarwal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barham</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brevdo</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Citro</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Davis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Devin</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghemawat</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goodfellow</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harp</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Irving</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Isard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jia</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jozefowicz</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaiser</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kudlur</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levenberg</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mané</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Monga</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moore</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Murray</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olah</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schuster</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shlens</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Steiner</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Talwar</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tucker</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vanhoucke</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vasudevan</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Viégas</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vinyals</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Warden</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wattenberg</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wicke</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zheng</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>TensorFlow: Large-scale machine learning on heterogeneous systems (</article-title>
          <year>2015</year>
          ), http://tensorflow.org/, software available from tensorflow.org
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Aragon</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carmona</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Montes</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Escalante</surname>
            ,
            <given-names>H.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Villaseñor</surname>
            <given-names>Pineda</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Moctezuma</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          :
          <article-title>Overview of mex-a3t at iberlef 2019: Authorship and aggressiveness analysis in mexican spanish tweets (08</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Atserias</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Casas</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Comelles</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>González</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Padró</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Padró</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Freeling 1.3: Syntactic and semantic services in an open-source NLP library</article-title>
          . In: Calzolari,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Choukri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Gangemi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Maegaard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Mariani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Odijk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Tapias</surname>
          </string-name>
          ,
          <string-name>
            <surname>D</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the Fifth International Conference on Language Resources and Evaluation</source>
          ,
          <string-name>
            <surname>LREC</surname>
          </string-name>
          <year>2006</year>
          , Genoa, Italy, May
          <volume>22</volume>
          -28,
          <year>2006</year>
          . pp.
          <fpage>2281</fpage>
          -
          <lpage>2286</lpage>
          . European Language Resources Association (ELRA) (
          <year>2006</year>
          ), http: //www.lrec-conf.org/proceedings/lrec2006/summaries/198.html
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Chollet</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          , et al.: Keras. https://keras.io (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Dias</surname>
            ,
            <given-names>R.F.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paraboni</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Combined</surname>
            <given-names>CNN</given-names>
          </string-name>
          +
          <article-title>RNN bot and gender profiling</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.E.</given-names>
            ,
            <surname>Müller</surname>
          </string-name>
          , H. (eds.) Working Notes of CLEF 2019 -
          <article-title>Conference and Labs of the Evaluation Forum</article-title>
          , Lugano, Switzerland, September 9-
          <issue>12</issue>
          ,
          <year>2019</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>2380</volume>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2019</year>
          ), http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2380</volume>
          /paper_61.pdf
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Fontcuberta</surname>
            ,
            <given-names>J.R.P.</given-names>
          </string-name>
          , la Peña Sarracén,
          <string-name>
            <surname>G.L.D.</surname>
          </string-name>
          :
          <article-title>Bots and gender profiling using a deep learning approach</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.E.</given-names>
            ,
            <surname>Müller</surname>
          </string-name>
          , H. (eds.) Working Notes of CLEF 2019 -
          <article-title>Conference and Labs of the Evaluation Forum</article-title>
          , Lugano, Switzerland, September 9-
          <issue>12</issue>
          ,
          <year>2019</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>2380</volume>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2019</year>
          ), http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2380</volume>
          /paper_221.pdf
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Ghanem</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rangel</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>An Emotional Analysis of False Information in Social Media and News Articles</article-title>
          .
          <source>ACM Transactions on Internet Technology (TOIT) 20(2)</source>
          ,
          <fpage>1</fpage>
          -
          <lpage>18</lpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Giachanou</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghanem</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Bot and gender detection using textual and stylistic information</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.E.</given-names>
            ,
            <surname>Müller</surname>
          </string-name>
          , H. (eds.) Working Notes of CLEF 2019 -
          <article-title>Conference and Labs of the Evaluation Forum</article-title>
          , Lugano, Switzerland, September 9-
          <issue>12</issue>
          ,
          <year>2019</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>2380</volume>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2019</year>
          ), http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2380</volume>
          /paper_169.pdf
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Hochreiter</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frasconi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidhuber</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , et al.:
          <article-title>Gradient flow in recurrent nets: the difficulty of learning long-term dependencies (</article-title>
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Hochreiter</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidhuber</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>Long short-term memory</article-title>
          .
          <source>Neural Computation</source>
          <volume>9</volume>
          (
          <issue>8</issue>
          ),
          <fpage>1735</fpage>
          -
          <lpage>1780</lpage>
          (
          <year>1997</year>
          ), https://doi.org/10.1162/neco.
          <year>1997</year>
          .
          <volume>9</volume>
          .8.
          <fpage>1735</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Johansson</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Supervised classification of twitter accounts based on textual content of tweets</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.E.</given-names>
            ,
            <surname>Müller</surname>
          </string-name>
          , H. (eds.) Working Notes of CLEF 2019 -
          <article-title>Conference and Labs of the Evaluation Forum</article-title>
          , Lugano, Switzerland, September 9-
          <issue>12</issue>
          ,
          <year>2019</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>2380</volume>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2019</year>
          ), http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2380</volume>
          /paper_154.pdf
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Joo</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hwang</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Author profiling on social media: An ensemble learning approach using various features</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.E.</given-names>
            ,
            <surname>Müller</surname>
          </string-name>
          , H. (eds.) Working Notes of CLEF 2019 -
          <article-title>Conference and Labs of the Evaluation Forum</article-title>
          , Lugano, Switzerland, September 9-
          <issue>12</issue>
          ,
          <year>2019</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>2380</volume>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2019</year>
          ), http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2380</volume>
          /paper_174.pdf
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Kingma</surname>
            ,
            <given-names>D.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ba</surname>
          </string-name>
          , J.:
          <article-title>Adam: A method for stochastic optimization</article-title>
          . In: Bengio,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>LeCun</surname>
          </string-name>
          , Y. (eds.) 3rd
          <source>International Conference on Learning Representations, ICLR</source>
          <year>2015</year>
          , San Diego, CA, USA, May 7-
          <issue>9</issue>
          ,
          <year>2015</year>
          , Conference Track Proceedings (
          <year>2015</year>
          ), http://arxiv.org/abs/1412.6980
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Litvinova</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pardo</surname>
            ,
            <given-names>F.M.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seredin</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Litvinova</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Overview of the rusprofiling PAN at FIRE track on cross-genre gender identification in russian</article-title>
          . In: Majumder,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Mitra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Mehta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Sankhavara</surname>
          </string-name>
          ,
          <string-name>
            <surname>J</surname>
          </string-name>
          . (eds.) Working notes of FIRE 2017 -
          <article-title>Forum for Information Retrieval Evaluation, Bangalore</article-title>
          , India, December 8-
          <issue>10</issue>
          ,
          <year>2017</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <year>2036</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          . CEUR-WS.org (
          <year>2017</year>
          ), http://ceur-ws.
          <source>org/</source>
          Vol-2036/T1-1.pdf
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>López-Santillán</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>González-Gurrola</surname>
            ,
            <given-names>L.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Montes-</surname>
            y-Gómez,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alonso</surname>
            ,
            <given-names>G.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prieto-Ordaz</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>An evolutionary approach to build user representations for profiling of bots and humans in twitter</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.E.</given-names>
            ,
            <surname>Müller</surname>
          </string-name>
          , H. (eds.) Working Notes of CLEF 2019 -
          <article-title>Conference and Labs of the Evaluation Forum</article-title>
          , Lugano, Switzerland, September 9-
          <issue>12</issue>
          ,
          <year>2019</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>2380</volume>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2019</year>
          ), http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2380</volume>
          /paper_176.pdf
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Distributed representations of words and phrases and their compositionality</article-title>
          . In: Burges,
          <string-name>
            <given-names>C.J.C.</given-names>
            ,
            <surname>Bottou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ghahramani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Weinberger</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.Q</surname>
          </string-name>
          . (eds.)
          <source>Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8</source>
          ,
          <year>2013</year>
          ,
          <string-name>
            <given-names>Lake</given-names>
            <surname>Tahoe</surname>
          </string-name>
          , Nevada, United States. pp.
          <fpage>3111</fpage>
          -
          <lpage>3119</lpage>
          (
          <year>2013</year>
          ), http://papers.nips.cc/paper/ 5021-distributed
          <article-title>-representations-of-words-and-phrases-and-their-compositionality</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Padró</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stanilovsky</surname>
          </string-name>
          , E.:
          <article-title>Freeling 3.0: Towards wider multilinguality</article-title>
          . In: Calzolari,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Choukri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Declerck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Dogan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.U.</given-names>
            ,
            <surname>Maegaard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Mariani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Odijk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Piperidis</surname>
          </string-name>
          , S. (eds.)
          <source>Proceedings of the Eighth International Conference on Language Resources and Evaluation</source>
          ,
          <string-name>
            <surname>LREC</surname>
          </string-name>
          <year>2012</year>
          , Istanbul, Turkey, May
          <volume>23</volume>
          -25,
          <year>2012</year>
          . pp.
          <fpage>2473</fpage>
          -
          <lpage>2479</lpage>
          . European Language Resources Association (ELRA) (
          <year>2012</year>
          ), http: //www.lrec-conf.org/proceedings/lrec2012/summaries/430.html
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Pardo</surname>
            ,
            <given-names>F.M.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giachanou</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghanem</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Overview of the 8th Author Profiling Task at PAN 2020: Profiling Fake News Spreaders on Twitter</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Eickhoff</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Névéol</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <article-title>CLEF 2020 Labs and Workshops, Notebook Papers</article-title>
          .
          <source>CEUR Workshop Proceedings (Sep</source>
          <year>2020</year>
          ),
          <article-title>CEUR-WS</article-title>
          .org
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>