<!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>Detecting Fake News Spreaders with Behavioural, Lexical and Psycholinguistic Features</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Héctor Ricardo Murrieta Bello</institution>
          ,
          <addr-line>Lukas Heilmann, and Esben Ronan</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Copenhagen</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <abstract>
        <p>In this paper, we propose a multilingual approach to identifying fake news spreaders on Twitter data, as part of the PAN 2020 competition for author profiling. We manually engineered domain-specific features covering behavioural, lexical and psycholinguistic aspects and evaluated them using traditional machine learning models. The focus of this paper is exploring the problem domain by testing domain-specific features on different types of classifiers first, and evaluating a pure multilingual approach on combined English and Spanish texts second. Out of the methods tested, the Gradient Boosting classifiers performed best. We extended our experiments to a multilingual design using less preprocessing and feature selection, with a comparable result to the monolingual Gradient Boosting models.</p>
      </abstract>
      <kwd-group>
        <kwd>fake news detection</kwd>
        <kwd>gradient boosting</kwd>
        <kwd>liwc</kwd>
        <kwd>psycholinguistic features</kwd>
        <kwd>behavioural features</kwd>
        <kwd>lexical features</kwd>
        <kwd>feature engineering</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Fake news has become a catchphrase present all over the political arena in the recent
years, and its presence is rapidly increasing. The effects are wide-ranging. There is,
for example, an undeniable interference of fake news in traditional political processes
like political campaigns. It is believed that fake news generated to favor either of the
two nominees in the 2016 presidential campaign was shared up to 37 million times
on Facebook [19], the top 20 of which generating up to 9 million shares. Fake news
reporting the injury of Barack Obama in an explosion caused a wiping out of up to
$130 billion in stock value [16].</p>
      <p>Fake news is not a new problem, but its ability to be easily and rapidly
disseminated in large scale across a population is. Fake news as a term thus uniquely locates
its domain in the realm of social media, where its new, pressing importance is found.
The rapid democratisation of public expression that social media encapsulates operates
hand-in-hand with the new role of fake news.</p>
      <p>The multifaceted nature of this phenomenon, and it’s crucial relevance to the
functioning of political processes, public discourse, and the well-being of citizens highlights
the importance to develop cutting-edge techniques in detection of fake news spreading,
so damaging information can be cut off before it spreads beyond a critical mass.</p>
      <p>
        Our study answers the PAN Shared Task "Profiling Fake News Spreaders on Twitter"[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
We approach the problem using a classical machine learning approach utilising
GradientBoosting methods on domain-specific features, such as lexical features, grammatical
features, sentimental analysis with LIWC1, SentiWordnet2 and EmoLex3, Twitter-DNA
as well as TF-IDF vectorisation.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>Fake news is a complex phenomenon that has elicited a great variety of approaches from
different fields of academia. [19] provides a succinct overview over four broad types of
approaches hitherto taken: i) "knowledge-based", which focuses upon the truth-value
of the knowledge content of the news; ii) "style-based", which concerns the linguistic
manner in which news is communicated; iii) "propagation-based", which focuses on
how fake news spreads through a network, and iv) "credibility-based", which
investigates the credibility of those who create and those who spread news. We will briefly
discuss previous research in the category most relevant to our task: Style-based.
2.1</p>
      <sec id="sec-2-1">
        <title>Style-based Fake News Detection</title>
        <p>Style-based approaches focus on quantifiable stylistic features of texts, upon which
machine learning algorithms can be trained to detect characteristics of the expression of
fake news creators and spreader. These tend towards assessing the intention of the text,
over its content. There is good experimental evidence in forensic studies to suggest
statements derived from factual experiences differ from those derived from statements
based in fantasy [19]. Not only this, but the current state-of-the-art in style-based
approaches varies from 60-90% [19], which is significantly higher than a normal person’s
ability to differentiate, as mentioned in the introduction.</p>
        <p>
          A variety of stylistic features can be studied, two main streams of which [19] have
identified. The first is "attribute-based language features", which derive from
psychological deception theories. They include attributes such as: Quantity (counts of
characters, words, sentences, etc), sentiment (positivity and negativity), diversity (number
of unique words, unique content words, etc), and uncertainty (degree of modal words,
quantifiers, generalising terms, etc used). The other category spans "structure-based
language features", which describes content style from four different language levels: i)
lexicon, ii) syntax, iii) semantic and iv) discourse. The lexicon level assesses frequency
of letters and words using n-gram models or TF-IDF. The syntax level uses NLP
techniques such as POS-tagging. The semantic level identifies topics that texts cover, using
1 http://liwc.wpengine.com/
2 http://sentiwordnet.isti.cnr.it/
3 https://saifmohammad.com/WebPages/NRC-Emotion-Lexicon.htm
packages such as LIWC. Discourse features include features on the level furthest out,
such as Rhetorical Structure Theory (RST). Generally, it seems to be the case that with
only one language used, lexicon-level features perform better than all others - 11 out of
14 studies studied by [19] report better performance at the lexicon-level. [?] achieved
a very high level performance (75-99% accuracy) detecting fake news on a selection
of Bulgarian news sites. They utilised linguistic features (n-grams), credibility-related
features such as sentiment polarity, capitalisation and punctuation, as well as semantic
embeddings. More recently, [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] introduced the usage of novel stylometric features such
as Twitter DNA, text readability and TF-IDF to assess the author’s profile.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Author Profiling</title>
        <p>
          A related task to a style-based fake news detection is author profiling. Author profiling
is an old problem where one attempts to infer characteristics about the author of a text
based on stylistic analysis. This could be, for example, gender, age, native language,
personality, age, economic class. Author profiling on social media inspires its own set
of problems but previous PAN tasks have shown a success in predicting a variety of
characteristics from Twitter data: Whether or not the user is a bot [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], personality traits
[15], gender [13] and language variety [14].
2.3
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Multilingual Approaches</title>
        <p>
          An interesting direction this research is beginning to take is multilingualism. Combining
features across different languages was found to outperform those using features from
a single language in eight out of twelve studies, according to a survey by [19]. A recent
innovative approach is the one shown by [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], which incorporated counting features and
psycho-linguistic features in order to assess whether an user is a bot or a human. They
proposed an ensemble model utilising a neural network and a fine-tuned BERT model
to a high accuracy.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Dataset</title>
      <p>The provided dataset had various idiosyncrasies that provided various constraints to
analysis. All meta data of users and tweets (e.g. profile picture, timestamps) was omitted
- only the textual data remained. This prevented any analysis according to suggestive
avatars, or posting time patterns. Beyond that, URLs, hashtags and usernames retweeted
were replaced with the respective placeholders #URL#, #HASHTAG#, #USER#. This
prevented any classification according to the news they were spreading, and instead
forced us to focus on stylistic features specifically.</p>
      <p>The task itself was crucially focused upon classifying fake news spreaders, which
meant we had to concentrate upon the stylistic features of a fake news spreader.
Knowledgebased approaches did not seem relevant, since tweets did not necessarily make
knowledge claims, but often consisted of clickbait-like expression, e.g."#HASHTAG #The
One Super Bowl Moment We Can’t Stop Watching #URL# #URL#".</p>
      <p>An interesting subtlety that makes this task more difficult, is there may well be
a large presence of "naive" fake news spreaders, who only intermittently spread fake
news. Thus, some users may only partially have tweets with fake news as content, but
they are classified as a whole as fake news.
4
4.1</p>
    </sec>
    <sec id="sec-4">
      <title>Method</title>
      <sec id="sec-4-1">
        <title>Preprocessing</title>
        <p>To preprocess the raw data, we implemented separate steps that specifically tackled
the idiosyncrasies of the dataset. In the first step, we removed all tags which we
labelled as user "behavior": Retweets, URLs, hashtags and mentions of users. Further
steps provided functionality for: lowercasing words, removing extra whitespaces,
expanding contractions, removing punctuation, removing stop words, removing numbers,
lemmatizing and removing ellipses. Lemmatisation and lowercasing were reserved for
higher level feature extraction like TF-IDF.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Feature Extraction</title>
        <p>We chose to extract domain-specific features from the respectively preprocessed texts
in English and Spanish. We did this through multiple extraction steps, which we shall
illustrate in the following.</p>
        <p>Behavioral Features The first features to be extracted were the URL, hashtag, retweet
and user counts per user. We did this because initial data explorations indicated that
fake news spreaders often used more hashtags and retweets than normal users.</p>
        <p>
          To investigate the structural distribution of these elements we decided to explore
a novel tweet history DNA algorithm designed by [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. This algorithm was used in the
context of bot detection, but it provided a novel way to analyse the behaviour of a
Twitter user. We implemented it with some modifications for our purposes. As proposed
in [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], specific tweet behaviors are represented by the values illustrated in . A weighted
linear combination of these behavioural values in each tweet is transformed into a letter
using the ASCII index.
        </p>
        <p>An =
&gt;80; plain
&gt;
&gt;&gt;&gt;8;
&gt;
&gt;
&gt;&lt;16; reply</p>
        <p>retweet
&gt;1;
&gt;
&gt;&gt;&gt;&gt;2;
&gt;
&gt;:4;
has hashtags
has mentions
has URLs
(1)</p>
        <p>For example, a retweet with hashtags, mentions, but no URLs would be calculated
as 0 0 + 8 1 + 1 1 + 2 1 + 4 0 + 65 = 84 = T (each value multiplied by
1 if the feature is present and 0 if not present). Each resultant letter is concatenated to
each other to form a tweet history DNA string 100 letters long. From this string we
calculate the frequency of every character in the string so that we finish with a vector of
16 dimensions.</p>
        <p>Lexical Features To extract all lexical, grammatical and miscellaneous features we
implemented an additional vectorisation step. We counted all character-level features
(digits, alpha characters, capital characters, punctuation, etc), all token-level features
(word lengths, syllable counts, emoji/emoticon counts, etc), as well as POS tag counts,
NER tag counts and others (see table below for more details).</p>
        <p>To extract the emoticons and emojis, we utilised the emot library 4. To extract NER
tags and POS tags we used the open-source SpaCy library. To count misspellings, we
utilised the open-source pyspellchecker library 5. Due to the limited range of the
library, it was crucial to subtract any identified named entities from the total count.</p>
        <p>
          We furthermore implemented some measures of vocabulary diversity. The first was
hapax legomena frequency, which calculates the amount of words that appear only once
[
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. Hapax legomena frequency is commonly used in author profiling [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], as often their
frequency correlates with the size of the author’s vocabulary. Another way to measure
vocabulary diversity is by the type-token ratio - the ratio of unique word count to total
word count.
        </p>
        <p>We also implemented a universal quantifier count, since we hypothesised that fake
news spreaders often utilise more absolute manners of expression, e.g. "why liberals are
always wrong".</p>
        <p>The length of the final vector outputted per user in regard to lexical measures was
166. The exact composition is depicted in Table 4.2.</p>
        <sec id="sec-4-2-1">
          <title>4 https://pypi.org/project/emot/ 5 https://pypi.org/project/pyspellchecker/</title>
          <p>
            Psycholinguistic Features Inspired by the work of Joo et. al. [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ], we considered
psycholinguistic lexica as a valuable resources for extracting features. While humans are
trained to perceive such underlying mental mechanisms, machines require the help of
annotated lexical resources, which we implemented in a variety of manners.
          </p>
          <p>
            We started off by incorporating sentiment polarity scores that have proven useful
as facilitators for automatic authorship profiling in earlier competitions. [
            <xref ref-type="bibr" rid="ref9">9</xref>
            ]
SentiWordNet 3.06, a publicly available lexical resource for opinion mining in English, holds three
sentiment scores for each synonym set present in the popular WordNet7: positivity,
negativity and objectivity. As an example, the English adjective "amazing" is represented by
the values 0.875, 0.125 and 0 for the aforementioned measures. The noun "secret",
however, has the scores 0.125, 0.375 and 0.5. Hence, "amazing" can be interpreted as a more
positive word, while "secret" reveals a rather negative and objective nature. The
objectivity score of each word is calculated with the formula 1 (positivity + negativity),
which consequently serves as a general measure of affectivity. To tackle words with a
          </p>
        </sec>
        <sec id="sec-4-2-2">
          <title>6 http://sentiwordnet.isti.cnr.it/</title>
          <p>7 https://wordnet.princeton.edu/
plurality of meanings, the part-of-speech tag of the given word is integrated.
Accordingly, we computed part-of-speech tags per document as a preparatory step. We then
queried SentiWordNet through the Natural Language Toolkit8 (NLTK) and transformed
the obtained scores into features.</p>
          <p>
            Linguistic Inquiry and Word Count9 (LIWC) is a lexical resource for
psycholinguistic measures. By integrating the tool, we intended to capture the author’s social and
psychological states, which have proven to be effective in author profiling tasks. [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ] To
our advantage, the lexicon was available in both English and Spanish. With the
purpose of summarizing language variables and linguistic dimensions, the first category
LIWC captures includes word frequencies, POS-frequencies, etc. The second category
aims at associating a word with certain psychological processes, such as affective
processes, social processes (e.g. family), personal concerns, etc. [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ] As we already covered
a significant amount of the stylistic features in the aforementioned lexical approach, we
directed our attention at the second category.
          </p>
          <p>
            To deepen the study of the emotional patterns of fake news spreaders, we
investigated the NRC Word-Emotion Association Lexicon10 (EmoLex) developed by
Mohammad et. al.. This vectorizer captures eight basic emotions from Plutchik’s wheel of
emotions: anger, fear, anticipation, trust, surprise, sadness, joy, and disgust. [8,?] The
lexicon has been used for sentiment and emotion analysis, abusive language detection,
personality trait identification, etc. on word-, sentence-, and tweet-level and has proven
useful in the SemEval shared task competition 2018. [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ]
Token Count Vectorizers An important set of features to employ alongside the
aforementioned feature extraction methods is TF-IDF. TF-IDF is important in measuring not
just the relevance of a word to a document (using frequency as a heuristic), but it’s
relative relevance, as compared to the compositions of other documents.
          </p>
          <p>TF-IDF is composed of: The term frequency within a document, the frequency a
term appears within a given document; and the inverse document frequency, which takes
the logarithm of the inverse of the frequency of documents in which the term appears.
These two are calculated for each term in each document and compiled into a vector.
The vector is restricted to a length specified by the hyperparameter "max_features".
After experimentation the performance was found to be optimum when max_features
was equal to 500. This restriction includes only the most frequent terms.
4.3</p>
        </sec>
      </sec>
      <sec id="sec-4-3">
        <title>Models</title>
        <p>We investigated a variety of different experimental designs which we will now present.
We used as input the aforementioned reduced set of features for English and Spanish
texts, as well as all features, in order to allow for later comparisons.</p>
        <p>To tune hyperparameters of each algorithm, we utilised a grid search automation.
Grid search is an exhaustive brute-force algorithm that takes a list of lists specifying a
range of values for each hyperparameter, derives all possible permutations and tests for
8 https://www.nltk.org/
9 http://liwc.wpengine.com/
10 https://saifmohammad.com/WebPages/NRC-Emotion-Lexicon.htm
their accuracy. Each test was achieved by averaging the accuracies of a repeated
stratified 10-fold (scikit-learn’s implementation). Since we used scikit-learn’s
implementation, we were unable to perform TF-IDF within each fold, since the module implements
cross-validation automatically. We reasoned, however, that since it was only for tuning
parameters, it did not matter so much.</p>
        <p>Multinomial Naive Bayes Multinomial Naive Bayes is a supervised machine learning
algorithm often used for text classification. It relies upon Bayesian conditional
reasoning and generating data from which to classify. One manner of generating the data is
by creating Gaussian distributions from the mean and standard deviation of each class,
another is by creating simple multinomial distributions. Since "the multinomial
distribution describes the probability of observing counts among a number of categories"
[18], this algorithm seems to be most appropriate for our vectors composed of count
features.</p>
        <p>We tested hyperparameters using grid search. The hyperparameters available to tune
were: "Alpha", which we tested values between 0.5 and 1.5; and "fit_prior", for which
there were values of True and False.</p>
        <p>Random Forest Random Forest is a flexible and quick-to-train ensemble machine
learning algorithm based upon decision trees [17]. Decision trees iteratively split the
dataset into subsets according to a quantitative threshold along an axis, the resultant
class for the subset derived from a majority vote. Random forest prevents the
overfitting tendency of decision trees by averaging the results of decision trees trained upon
randomly split training data (bagging).</p>
        <p>Hyperparameters to adjust included number of estimators (decision trees), for which
we selected logarithmically interpolated values: 10, 100, 1000, and max_features (for
node-splitting), for which we chose: ’sqrt’, ’log2’.</p>
        <p>
          Support Vector Machine (SVM) SVM is a supervised learning algorithm which
learns by finding the most optimum hyperplane to linearly separate data into distinct
areas, corresponding to a positive and negative classification. The hyperplane is
calculated by the utilisation of support vectors, data points close to the hyperplane, the
distance (margin) from which is to be maximised. Though in its basic form it is
designed for linear classification, it can be mapped to non-linear sets by using different
"kernels" [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ].
        </p>
        <p>To tune it we utilised scikit-learn’s GridsearchCV with a stratified 5-fold cross
validation procedure. Kernel parameters we tested were: ’poly’ (polynomial), ’rbf’
(radial base function), ’sigmoid’ and ’linear’. The regularization parameter C values we
tested were: 50, 10, 1.0, 0.1, and 0.01. We used "scale" as the gamma hyperparameter
value and a linear kernel.</p>
        <p>
          Gradient Boosting Gradient boosting is a powerful supervised machine learning
algorithm that is born out of the theoretical assumption that "weak learners" can be turned
into better learners [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. Weak learners are observations who as hypotheses perform only
slightly better than chance. An ensemble of these can sequentially handle their
respective observation and iteratively tackle difficult problems. Though it is comparatively
computationally expensive algorithm, it is powerful at grasping subtleties in data, and
since our dataset is small, computational expenditure is not as big an issue.
        </p>
        <p>The hyperparameters we selected to tune are: number of estimators with values of
10, 100, 500, 800, 1000; Learning rate with logarithmic values of: 0.001, 0.01, 0.1,
subsample with values of 0.5, 0.7, 1.0. and max depth with values of 3, 7, 9. Since the
GradientBoostingClassifier turned out to be our most promising algorithm,
we decided to implement a manual grid search that allowed implementation of TF-IDF
within each fold, so that we could be assured to discover the best parameters.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Results</title>
      <p>We subsequently present our results for the aforementioned methods employed. As we
aimed for a stabilized comparison of performances among the different experimental
setups, we consistently utilized a stratified 10-fold cross validation with 3 repeats, each
with a training size of 80% of the features.
5.1</p>
      <sec id="sec-5-1">
        <title>Experiment 1</title>
        <p>For the first experiment we tested each dataset individually using a variety of machine
learning algorithms previously described. First we tested the algorithms on just the
domain-specific features as described in the method section. After that we tested them
with a combination vector of domain-specific features and the TF-IDF vector. We then
tuned the hyperparameters for each one using the SKLearn’s GridSearchCV.</p>
        <p>As can be seen in Table 2, the Gradient Boosting algorithm performed significantly
better on both the English and Spanish datasets than any of the other algorithms.
Random Forest performed next best, with the Support Vector Machine and Multinomial
Naive Bayes coming last. Interestingly, in every single case we tested, there was a higher
accuracy on the Spanish dataset than on the English dataset.
5.2</p>
      </sec>
      <sec id="sec-5-2">
        <title>Experiment 2</title>
        <p>Our multilingual approach consisted of individual preprocessing of the English and the
Spanish dataset, followed by extraction of the manually engineered features for each
dataset. We deleted language dependent features such as sentimental analysis with
SentiNet (only English) and the additional ten LIWC categories for Spanish. We then
concatenated the two vectors into one. Subsequently, we split the datasets into training and
validation sets (20%) in each fold. Finally, as a further experiment, we merged English
and Spanish tweets and fitted a TF-IDF vectorizer. In this setup we did not explore the
application of any feature extraction algorithm or hyper-parameter optimization. Since
the best algorithm in the monolingual setup was gradient boosting, we decided to use
that algorithm for this section.</p>
        <p>Language Model Features
English Multinomial Naive Bayes ALL
Spanish Multinomial Naive Bayes ALL
English Multinomial Naive Bayes ALL + TFIDF
Spanish Multinomial Naive Bayes ALL +TFIDF
English Random Forest ALL
Spanish Random Forest ALL
English Random Forest ALL + TFIDF
Spanish Random Forest ALL +TFIDF</p>
        <p>As can be seen in the results table, the gradient boosting algorithm used upon the
vector combining all features and TF-IDF functioned best, though not by a particularly
large margin. There was however no increase in accuracy compared to the monolingual
setups, and it performed significantly worse than upon just the spanish dataset.</p>
        <p>Model</p>
        <p>Features</p>
        <p>Accuracy Std
Gradient Boosting All 0.71 0.075</p>
        <p>
          Gradient Boosting All + TF-IDF 0.7218 0.0460
Our final submission was made using the methodology of the second experiment.
However during for the test phase, we predicted our answers separately for the Spanish tweet
feed and for the English tweet feed. In order to test the efficiency of our algorithm we
made use of the software submission platform [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]
To our surprise, the accuracy on the Spanish dataset vastly outperformed the accuracy
on the English dataset, with an accuracy of 0.7450 to 0.65550. This was in contrast to
our first experiments, where the difference was markedly less.
        </p>
        <p>Language accuracy
Our study has demonstrated the importance of carefully selected domain-specific
features in the domain of fake news identification. These features are integral in classifying
monolingual texts as well as multilingual text. We can conclude that it was possible to
classify fake news spreaders on a limited dataset consisting of 300 Twitter users, by
applying gradient boosting to a set of lexical, behavioural and psycholinguistic features
and TFIDF to represent the text. Furthermore, these features have been shown to
provide useful information in multilingual environments and are not limited to monolingual
contexts.
13. Rangel, F., 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)
14. Rangel, F., Rosso, P., Potthast, M., Stein, B.: Overview of the 5th author profiling task at
pan 2017: Gender and language variety identification in twitter. Working notes papers of the
CLEF pp. 1613–0073 (2017)
15. Rangel Pardo, F.M., Celli, F., Rosso, P., Potthast, M., Stein, B., Daelemans, W.: Overview
of the 3rd author profiling task at pan 2015. In: CLEF 2015 Evaluation Labs and Workshop
Working Notes Papers. pp. 1–8 (2015)
16. Rapoza, K.: Can ‘fake news’ impact the stock market? by Forbes (2017)
17. Svetnik, V., Liaw, A., Tong, C., Culberson, J.C., Sheridan, R.P., Feuston, B.P.: Random
forest: a classification and regression tool for compound classification and qsar modeling.</p>
        <p>Journal of chemical information and computer sciences 43(6), 1947–1958 (2003)
18. VanderPlas, J.: Python data science handbook: Essential tools for working with data. "</p>
        <p>O’Reilly Media, Inc." (2016)
19. Zhou, X., Zafarani, R.: Fake news: A survey of research, detection methods, and
opportunities. CoRR abs/1812.00315 (2018), http://arxiv.org/abs/1812.00315</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Friedman</surname>
            ,
            <given-names>J.H.</given-names>
          </string-name>
          :
          <article-title>Stochastic gradient boosting</article-title>
          .
          <source>Computational statistics &amp; data analysis 38(4)</source>
          ,
          <fpage>367</fpage>
          -
          <lpage>378</lpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Hearst</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumais</surname>
            ,
            <given-names>S.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Osuna</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Platt</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Scholkopf</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Support vector machines</article-title>
          .
          <source>IEEE Intelligent Systems and their applications 13(4)</source>
          ,
          <fpage>18</fpage>
          -
          <lpage>28</lpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <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 Model using Various Features</article-title>
          .
          <source>Notebook for PAN at CLEF</source>
          <year>2019</year>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Kosmajac</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Keselj</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Twitter bot detection using diversity measures</article-title>
          .
          <source>In: Proceedings of the 3rd International Conference on Natural Language and Speech Processing</source>
          . pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kosmajac</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Keselj</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Twitter user profiling: Bot and gender identification</article-title>
          .
          <source>In: CLEF (Working Notes)</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Martinc</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skrjanec</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zupan</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pollak</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          : Pan 2017:
          <article-title>Author profiling-gender and language variety prediction</article-title>
          .
          <source>In: CLEF (Working Notes)</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Mohammad</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bravo-Marquez</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Salameh</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kiritchenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Semeval-2018 Task 1: Affect in tweets</article-title>
          .
          <source>In: Proceedings of International Workshop on Semantic Evaluation (SemEval-2018)</source>
          . New Orleans, LA, USA (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Mohammad</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Turney</surname>
          </string-name>
          , P.D.:
          <article-title>Crowdsourcing a word-emotion association lexicon 29(3</article-title>
          ),
          <fpage>436</fpage>
          -
          <lpage>465</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Patra</surname>
            ,
            <given-names>B.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Banerjee</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Das</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Saikh</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bandyopadhyay</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Automatic author profiling based on linguistic and stylistic features</article-title>
          .
          <source>Notebook for PAN at CLEF</source>
          <volume>1179</volume>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Popescu</surname>
            ,
            <given-names>I.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Altmann</surname>
          </string-name>
          , G.:
          <article-title>Hapax legomena and language typology</article-title>
          .
          <source>Journal of Quantitative Linguistics</source>
          <volume>15</volume>
          (
          <issue>4</issue>
          ),
          <fpage>370</fpage>
          -
          <lpage>378</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <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="ref12">
        <mixed-citation>
          12.
          <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-list>
  </back>
</article>