<!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>A Multi-Aspect Classification Ensemble Approach for Profiling Fake News Spreaders on Twitter</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science University of Innsbruck</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <abstract>
        <p>In this work, we attempt to differentiate authors of fake news and real news as part of the Profiling Fake News Spreaders on Twitter task at PAN. We propose a set of eight different language features to represent tweets. These representations are subsequently used in an ensemble classification model to identify fake news spreaders on Twitter. The approach is confined to the English language. Copyright c 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0). CLEF 2020, 22-25 September 2020, Thessaloniki, Greece.</p>
      </abstract>
      <kwd-group>
        <kwd>Stacking ensemble</kwd>
        <kwd>natural language processing</kwd>
        <kwd>ensemble pruning</kwd>
        <kwd>fake news detection</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        Threats like public deceit or deep fakes, i.e., the artificially created, realistic imitation of
an individual reasonably concern politicians, journalists, and sociologists [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. In online
social networks, fake messages and rumors are usually spread with the intention of
deceiving users and manifesting certain opinions. Fake news is not new, but social media
platforms have enabled the phenomenon to grow exponentially in recent years [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
      </p>
      <p>
        Therefore, technologies to detect intentionally spread fake messages are sought
after. At the CLEF 2020 conference, the Profiling Fake News Spreaders on Twitter task
at PAN addresses this matter [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. The objective of the task is to study whether it is
possible to distinguish authors who have disseminated fake news from those who, in
their good faith, have never done so. For this task, a collection of sample messages
from known fake news spreaders and truth-tellers was gathered from the Twitter
microblogging platform and provided to participants. By using the same data and
publishing the different approaches, the various teams can mutually inspire each other.
Consequently, this should foster mutual improvements to teams’ models and jointly advance
approaches for detecting fake news spreaders.
      </p>
      <p>
        According to [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], there are three different approaches to automatically determine
the credibility of a certain post, tweet, or article:
– Truth finding refers to the extraction of structured claims from a certain post, tweet,
or article and the comparison of those claims with trustworthy sources.
– Analysis of community behavior in social media aims to determine the credibility
of a text based on probabilistic graph models and social media analysis.
– Natural language claims try to determine the credibility of a text by recognizing
characterizing patterns in the writing style of fake news spreaders.
      </p>
      <p>
        The goal of this work is to contribute to the systematic detection of fake news in
social media networks. By applying the concepts of natural language claims, the approach
offers an executable decision model for computing the probability that the author is a
fake news spreader. The choice of which text properties are used to determine whether
a message is fake or not plays a crucial role. Hence, a central part of this work is
investigating which text features are suitable as indicators for fake news. In this context,
Ghanem et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] showed that the decomposition of a tweet, article, or post into
manifold emotional features can help to detect fake news. Similarly, [23] found that
positively associated words are relevant to identify sarcasm and negative words to identify
irony. Hence, besides conventional text features such as TF-IDF or POS-tags, we also
incorporate mood-related aspects for the detection of fake news. Given a set of eight
text features, we propose to utilize an ensemble classification approach for the task of
differentiating fake news spreaders and truth-tellers. The models of this approach are
constrained to the English language.
      </p>
      <p>The remainder of this paper is structured as follows. In Chapter 2, we describe the
used dataset, our approach for feature extraction, and the employed classification model.
In Chapter 3, we present the results obtained by applying the developed classification
model to the dataset and we conclude our work in Chapter 4.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Method</title>
      <p>In this section, we present the proposed features as well as the supervised learning
model employed to detect fake news spreaders. The objective of the machine learning
model is to assign tweets either to the class of tweets written by fake news spreaders or
to the class of tweets written by truth-tellers. Based on this classification of tweets, we
assign authors of these tweets either to the class of fake news spreaders or the class of
truth-tellers.</p>
      <p>In the following, we firstly introduce the dataset underlying our experiments,
before we describe the employed data preprocessing and the features used to characterize
tweets, before we elaborate on the ensemble classification approach utilized.
2.1</p>
      <sec id="sec-2-1">
        <title>Dataset</title>
        <p>
          The dataset used was provided by the PAN task committee of the “Profiling Fake News
Spreaders on Twitter” task [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. This dataset contains tweets of 300 Twitter users,
whereby users are labeled as either fake news spreaders or truth-tellers. For each user,
a rich collection of tweets was provided. Table 1 depicts an overview of the dataset.
Each tweet belongs to either an author who belongs to the class of fake news spreaders
or the class of truth-tellers. In a first step, we group tweets of fake news spreaders and
tweets of truth-tellers as we aim to generalize patterns that allow to distinguish these
two classes. Each tweet is then labeled with the respective class.
        </p>
        <p>Combining multiple tweets into a combined message taking into account the labels
provides a more comprehensive information base for pattern recognition. In preliminary
experiments, we observed that this concatenation has a positive effect on the accuracy
of the classification system. Therefore, for further processing, groups of four tweets of
the same author and annotated with the same label are joined together into one message,
which is then used as input for all further steps.
2.3</p>
      </sec>
      <sec id="sec-2-2">
        <title>Text Features</title>
        <p>Based on the input tweets (or rather, the concatenation of four tweets), we aim to extract
meaningful features for the classification of tweets and hence, authors. Our choice of
appropriate text features was motivated by multiple prior works regarding both general
text classification, as well as specifically existing work regarding the detection of fake
messages.</p>
        <p>
          The Bag of Words model (BOW) serves as a first initial basis for the representation
of tweets [24]. Furthermore, we add the features proposed by the winner of the 2018
PAN-Task for Style Change Detection [26]: N-Grams, Term Frequency–Inverse
Frequency, POS-Tags, Readability using Textstat and Named Entities (NER) using SpaCy5.
Ghanem et al. [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] showed that incorporating emotions can be crucial for the
recognition of fake news. Therefore, we also leverage the NRC emotional dictionary [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] to
incorporate emotional features in our approach. Furthermore, we used Vader (Valence
Aware Dictionary and sEntiment Reasoner) [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] to reflect the mood of a text (positive or
negative). The average word length of each tweet was also added as a further feature.
Moreover, we also utilized sentence embedding vectors for for each tweet to
incorporate semantic properties of the tweets. Figure 1 illustrates the features extracted from a
tweet in multiple strands. We detail the individual features in the following.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Term Frequency-Inverse Document Frequency (TF-IDF): In this strand, we extract</title>
        <p>basic text features: TF-IDF features and trigrams. Therefore, the texts are separated
into tokens (words) using spaces and punctuation marks. We then remove stop words
and transform words to their word stem. Based on this preprocessing, we extract word
trigrams. We compute TF-IDF scores to reflect their relevance in relation to the entire
text corpus for the individual word or trigram, respectively.</p>
        <p>Average Word Length (AWL): In this strand, the average word length of a text is
determined. The texts are separated into words using spaces. To determine the average
word length of a text, the total number of characters in the text excluding spaces is
divided by the total number of words in the text (also including stop words).
Word/Sentence Embeddings (WE): Here, we compute a sentence embedding for
each text. The resulting numeric vectors allow to semantically compare texts. The
NLPlibrary SpaCy1 is used for the conversion into sentence vectors.</p>
        <p>POS-Tags (POS): Part of Speech Tagging (POS-Tagging) is the classification of words
into their part of speech. The words get classified with one of the following word types:
Pronouns, prepositions, coordinating conjunctions, adjectives, adverbs, determinants,
interjections, modals, nouns, personal pronouns, or verbs. For our approach, the number
of occurrences of the different word types per text is added to the tweet representation.
The NLP-libraries SpaCy5 and NLTK2 were tested for POS-tagging. Our preliminary
experiments showed that NLTK contributes better to the accuracy of the overall system
and is therefore used for this approach.</p>
        <p>Named Entity Recognition (NER): Here, each proper name in the text is assigned to
a specific category, such as person, company name or currency. We add the number of
occurrences of each category as features to the tweet representation. The NLP-library
SpaCy5 is used for the extraction of the named entities.</p>
        <p>
          Sentiment Analysis (SA): Using sentiment analysis, we aim to determine the
sentiment of the text, whereby sentiment is measured by three dimensions:
– Positive (between 0 and 1)
– Negative (between 0 and 1)
– Neutral (between 0 and 1)
The positive, negative, and neutral scores represent the proportion of the text that falls
into these three sentiment categories. Therefore, all these scores together should add up
to 1. Additionally, there is the variable compound which expresses the three values in
one dimension. We use the scores of the three dimensions and the compound value as
a feature to describe the text. The sentiment analysis library Vader3, which combines
a sentiment-lexicon-approach and rule-based context consideration [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], is used for the
extraction of the sentiments.
        </p>
        <p>
          Emotional Analysis (EA): While sentiment analysis resolves the mood rather
objectively between a positive or negative score, emotional analysis attempts to assess the
text in terms of a multifaceted human perception of feelings. Since Ghanem et al. [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]
state how important the consideration of human emotions is for the recognition of fake
messages, this strand attempts to extract emotions from the given text. To achieve this,
an analysis at token level is performed to check a text for the involvement of ten
different types of emotions and their degree of expression.
        </p>
        <p>
          We use the NRC emotion dictionary [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] to determine emotions. A word in the
dictionary may have markers for the emotion types anger, anticipation, disgust, fear,
1 https://spacy.io/
2 https://www.nltk.org/
3 https://pypi.org/project/vader-sentiment/
joy, negative, positive, sadness, surprise, and trust. A word can also have more than one
marker if it is associated with more than one emotion. Each word in the text is looked
up in the emotion dictionary, matching emotional markers are grouped within their type
and counted across the entire text. The count of each type is normalized by dividing it
by the total number of words with any emotional marker in the text. The normalized
values for each emotion type is used as emotional features.
        </p>
        <p>
          Readability (READ): How easy it is to read a text can also be a crucial feature
describing a text. Zlatkova et al. [26] have promoted the consideration of readability in their
work on style change detection. There are various static analysis methods for this
purpose, for example, the Flesch Reading Ease-Test (FRE) [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], which calculates a score
from the total number of sentences, words, and syllables. The score indicates how easy
it is for the reader to understand the text. It is calculated as follows:
        </p>
        <p>FRE = 206:835
1:015</p>
        <p>total words
total sentences
84:6
total syllables
total words
(1)</p>
        <p>
          Along the lines of Zlatkova et al. [26], we also incorporate the following readability
scores:
– Smog Grade[
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]
– Flesch Kincaid Grade [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]
– Coleman Liau Index [22]
– Automated Readability Index [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]
– Dale Chall Readability Score [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]
– Difficult Words [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]
– Linsear Write Formula [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]
– Gunning Fog Index [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]
Each score is considered separately as a feature for the text. The library Textstat4 was
used for the calculation of the scores.
2.4
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>Classification</title>
        <p>Based on the set of extracted features, the classifier aims to predict authors as fake or as
real. When applied to a collection of tweets of an author, the probability of the author
being a fake news spreader can be estimated.</p>
        <p>
          In our approach, we evaluated multiple classification algorithms with the eight
different feature types proposed in the previous section to obtain suitable combinations
of classification algorithms and representations. In particular, we evaluated Support
Vector Machines (SVM) [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], Random Forests (RF) [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], Artificial Neural Networks
(ANN) [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], Adaptive Boosting (AdaBoost) [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], and Extreme Gradient Boosting
(XGBoost) [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] approaches. For each of these classification approaches, we performed
crossvalidation with five folds [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] on the provided training data and with hyper parameters
set according to Table 2.
        </p>
        <p>Table 3 shows the accuracy values for each feature in combination with each
proposed classification algorithm for the provided training data set. The best accuracy
scores for each representation are highlighted in bold.</p>
        <p>
          Given that we found that different features work differently well when combined
with different classification algorithms, we propose to use an ensemble of classifiers
for our approach. The primary assumption of ensemble methods is that if weak
models are combined appropriately, more accurate and robust models can be achieved [25].
More precisely, we have chosen a stacking ensemble approach that deliberately
combines various weak models of different types. Accuracy values were determined for all
4 https://pypi.org/project/textstat/
combinations of algorithms and representations (see Table 3). However, only the best
combinations of each representation and a classification method (marked in bold in the
table) were used in the ensemble. This reduction to the essence is known as
ensemble pruning [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]. It is a method to increase efficiency and prediction performance by
reducing the ensemble of model components. The results of the eight classifiers are
aggregated using logistic regression as meta classifier. Thereby the classifiers are weighted
according to the accuracy scores they achieved on the training dataset (cf Table 3). The
hyper parameters are set as specified in Table 2 and Table 4.
tweets of an author have been classified, the probability of being fake news spreader
is used to classify the author itself. It is equal to the ratio of tweets classified as fake
news to tweets classified as not fake news of an author, as represented by Equation 2.
Ta denotes the set of tweets of an author a, F is the class of tweets containing fake
news, and Af is the class of fake news spreaders (i.e., authors of fake news).
        </p>
        <p>P (a 2 Af ) =</p>
        <p>T1 X jt 2 F j
t2Ta
An author is considered to be a fake news spreader if the calculated probability is
above 0.5. If the probability is lower, the author is assigned to the class of truth-tellers.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Results and Discussion</title>
      <p>In Table 3 we depict the accuracy scores of the individual representations. Here,
TFIDF stands out as the superior representation with an average accuracy of 79.056%,
which was determined by applying a variety of classification algorithms. However,
utilizing the proposed ensemble approach, we were able to increase the accuracy score by
6.144%.</p>
      <p>The pruned stacking classifier, which utilizes the best performing classifiers of each
representation, was evaluated by a seven-fold cross-validation of all labeled tweets of
the training data. Thereby the following result was obtained:
(2)
Accuracy: 85.2002</p>
      <p>
        Precision: 85.2329
The model was used for the classification of the test set of the according PAN task [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]
in the TIRA [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] evaluation platform. Thereby a classification of authors was conducted
based on authors’ tweets according to Equation 2 and a score of 0.72 was obtained.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>In this work, we aimed to identify suitable text features for the detection of fake news.
An increase in accuracy was not achieved by unification at the representation level,
but by combining multiple classification results based on the different representations
independently of each other using different classification algorithms. Based on these
findings, a pruned stacking classifier was developed which incorporates Support Vector
Machines, Random Forests, Artificial Neural Networks, and Extreme Gradient
Boosting Machines and considers eight different text representations.
22. Vajjala, S., Meurers, D.: On improving the accuracy of readability classification using
insights from second language acquisition. In: Proceedings of the seventh workshop on
building educational applications using NLP. pp. 163–173. Association for Computational
Linguistics (2012)
23. Wang, P.Y.A.: # irony or# sarcasm—a quantitative and qualitative study based on twitter. In:
Proceedings of the 27th Pacific Asia Conference on Language, Information, and
Computation (PACLIC 27). pp. 349–356 (2013)
24. Zhang, Y., Jin, R., Zhou, Z.H.: Understanding bag-of-words model: a statistical framework.</p>
      <p>International Journal of Machine Learning and Cybernetics 1(1-4), 43–52 (2010)
25. Zhou, Z.H.: Ensemble learning. Encyclopedia of biometrics 1, 270–273 (2009)
26. Zlatkova, D., Kopev, D., Mitov, K., Atanasov, A., Hardalov, M., Koychev, I., Nakov, P.: An
ensemble-rich multi-aspect approach for robust style change detection. CLEF 2018
Working Nots of CLEF (2018)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Chall</surname>
            ,
            <given-names>J.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dale</surname>
          </string-name>
          , E.:
          <article-title>Readability revisited: The new Dale-Chall readability formula</article-title>
          .
          <source>Brookline Books</source>
          (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guestrin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Xgboost: A scalable tree boosting system</article-title>
          .
          <source>In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
          . pp.
          <fpage>785</fpage>
          -
          <lpage>794</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Eltorai</surname>
            ,
            <given-names>A.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Naqvi</surname>
            ,
            <given-names>S.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghanian</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eberson</surname>
            ,
            <given-names>C.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weiss</surname>
            ,
            <given-names>A.P.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Born</surname>
            ,
            <given-names>C.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Daniels</surname>
            ,
            <given-names>A.H.</given-names>
          </string-name>
          :
          <article-title>Readability of invasive procedure consent forms</article-title>
          .
          <source>Clinical and translational science 8</source>
          (
          <issue>6</issue>
          ),
          <fpage>830</fpage>
          -
          <lpage>833</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Fushiki</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Estimation of prediction error by using k-fold cross-validation</article-title>
          .
          <source>Statistics and Computing</source>
          <volume>21</volume>
          (
          <issue>2</issue>
          ),
          <fpage>137</fpage>
          -
          <lpage>146</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <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 Trans. Internet Technol</source>
          .
          <volume>20</volume>
          (
          <issue>2</issue>
          ) (
          <year>Apr 2020</year>
          ), https://doi.org/10.1145/3381750
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Gunning</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>The fog index after twenty years</article-title>
          .
          <source>Journal of Business Communication</source>
          <volume>6</volume>
          (
          <issue>2</issue>
          ),
          <fpage>3</fpage>
          -
          <lpage>13</lpage>
          (
          <year>1969</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hüning</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hüning</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Textstat simple text analysis tool</article-title>
          . Dutch Linguistics, Free University of Berlin, Berlin (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Hutto</surname>
            ,
            <given-names>C.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gilbert</surname>
          </string-name>
          , E.:
          <article-title>Vader: A parsimonious rule-based model for sentiment analysis of social media text</article-title>
          . In: Eighth International AAAI Conference on Weblogs and Social
          <string-name>
            <surname>Media</surname>
          </string-name>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Jain</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mao</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mohiuddin</surname>
            ,
            <given-names>K.M.</given-names>
          </string-name>
          :
          <article-title>Artificial neural networks: A tutorial</article-title>
          .
          <source>Computer</source>
          <volume>29</volume>
          (
          <issue>3</issue>
          ),
          <fpage>31</fpage>
          -
          <lpage>44</lpage>
          (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Kincaid</surname>
            ,
            <given-names>J.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fishburne</surname>
            <given-names>Jr</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.P.</given-names>
            ,
            <surname>Rogers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.L.</given-names>
            ,
            <surname>Chissom</surname>
          </string-name>
          ,
          <string-name>
            <surname>B.S.:</surname>
          </string-name>
          <article-title>Derivation of new readability formulas (automated readability index, fog count and flesch reading ease formula) for navy enlisted personnel</article-title>
          .
          <source>Tech. rep., Naval Technical Training Command Millington TN Research Branch</source>
          (
          <year>1975</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Liaw</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wiener</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , et al.:
          <article-title>Classification and regression by randomforest</article-title>
          .
          <source>R news 2(3)</source>
          ,
          <fpage>18</fpage>
          -
          <lpage>22</lpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Mc</surname>
            <given-names>Laughlin</given-names>
          </string-name>
          ,
          <string-name>
            <surname>G.H.</surname>
          </string-name>
          :
          <article-title>Smog grading-a new readability formula</article-title>
          .
          <source>Journal of reading 12(8)</source>
          ,
          <fpage>639</fpage>
          -
          <lpage>646</lpage>
          (
          <year>1969</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Mohammad</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Turney</surname>
          </string-name>
          , P.D.:
          <article-title>NRC emotion lexicon</article-title>
          .
          <source>National Research Council</source>
          , Canada (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Nemitz</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Constitutional democracy and technology in the age of artificial intelligence</article-title>
          .
          <source>Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences</source>
          <volume>376</volume>
          (
          <issue>2133</issue>
          ),
          <volume>20180089</volume>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Popat</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mukherjee</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yates</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weikum</surname>
          </string-name>
          , G.:
          <article-title>DeClarE: Debunking fake news and false claims using evidence-aware deep learning</article-title>
          .
          <source>In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing</source>
          . pp.
          <fpage>22</fpage>
          -
          <lpage>32</lpage>
          . Association for Computational Linguistics, Brussels, Belgium (Oct-Nov
          <year>2018</year>
          ), https://www.aclweb.org/anthology/D18-1003
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gollub</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wiegmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>TIRA Integrated Research Architecture</article-title>
          . In: Ferro,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Peters</surname>
          </string-name>
          ,
          <string-name>
            <surname>C</surname>
          </string-name>
          . (eds.)
          <article-title>Information Retrieval Evaluation in a Changing World</article-title>
          . Springer (Sep
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Rangel</surname>
            ,
            <given-names>F.</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-WS.org (Sep</source>
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Rudolf</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>How to write plain english</article-title>
          . University of Canterbury (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Schapire</surname>
          </string-name>
          , R.E.:
          <article-title>Explaining adaboost</article-title>
          . In: Empirical inference, pp.
          <fpage>37</fpage>
          -
          <lpage>52</lpage>
          . Springer (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Schölkopf</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smola</surname>
            ,
            <given-names>A.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bach</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          , et al.:
          <article-title>Learning with kernels: support vector machines, regularization, optimization, and beyond</article-title>
          . MIT press (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Tsoumakas</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Partalas</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vlahavas</surname>
            ,
            <given-names>I.:</given-names>
          </string-name>
          <article-title>An ensemble pruning primer</article-title>
          .
          <source>In: Applications of supervised and unsupervised ensemble methods</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>13</lpage>
          . Springer (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>