<!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>How many bots are you following? y</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alessandro Balestrucci</string-name>
          <email>alessandro.balestrucci@gssi.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Gran Sasso Science Institute</institution>
          ,
          <addr-line>L'Aquila</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>IMT School for Advanced Study Lucca</institution>
          ,
          <addr-line>Lucca</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Social Media are evolving as a pervasive source of news able to reach a larger audience through their spreading power. The main drawback is given by the presence of malicious accounts, known as social bots, which are often used to di use misleading information. Social bots are automated accounts whose goal is to interact with humans and in uence them. Starting from the de nition of credulous (i.e., human accounts with a high percentage of bot friends among their followees), in this work we aim to single out a regression model to derive, with an acceptable margin of error, the percentage of bot-followees of a human-operated account. The advantage lies in knowing, as a preventive measure, which users may be the target of bots' activities, hence more exposed to the misleading/unreliable content. Our results showed that the best regression model achieves a Mean Absolute Error of 3.62% and a Root Mean Squared Error of 5.96%, thus encouraging further research in this direction.</p>
      </abstract>
      <kwd-group>
        <kwd>{ Credulous Twitter Users</kwd>
        <kwd>Humans-Bots Interactions</kwd>
        <kwd>Disinformation Spreading</kwd>
        <kwd>Social Networks Analysis</kwd>
        <kwd>Supervised Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Despite the e orts spent by OSM administrators in removing suspicious accounts34, and by
researchers in improving bot detection techniques [
        <xref ref-type="bibr" rid="ref2 ref33">33, 2</xref>
        ], this plague is far from being
eradicated. In fact, by recent estimates on Twitter, the percentage of bots among the active users
ranges between 9% and 15% [
        <xref ref-type="bibr" rid="ref45">45</xref>
        ]. Furthermore, a new generation of bots, more sophisticated
than the previous ones, are able to avoid detection by mimicking human behaviour [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
In some cases, bots have been used to call volunteers in case of emergencies [
        <xref ref-type="bibr" rid="ref40">40</xref>
        ] or to spread
academic events such as conferences, but these are only exceptions. In fact, a dominant use of
these arti cial entities is for malicious purposes, e.g., to encourage hate speeches, misconception
and, more in general to in uence people [
        <xref ref-type="bibr" rid="ref25 ref44">44, 25</xref>
        ].
      </p>
      <p>
        The e ectiveness of such malicious activities, intended to manipulate public opinion, has been
investigated on the Brexit referendum [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], the US Presidential election 2016 [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], the elections in
France [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] and Mexico [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. These are few well-known examples of how and to what extent bots
and disinformation can damage democracy, especially if this kind of campaigns target speci c
categories of users.
      </p>
      <p>
        A recent study stated that the majority of genuine (human) users usually do not check the
reliability of contents on OSM, and many even share these articles [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]; hence contributing,
although unknowingly, to di use unreliable content. Moreover, in [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ] models for in uence
propagation in OSM have been studied, and a strong correlation emerged between the target
nodes (to in uence) and the role of their neighbours (social contacts).
      </p>
      <p>
        Using Twitter as benchmark, this paper focuses on nding a way to determine, as precisely as
possible, the amount of potential malicious accounts (bots) a human is following (bot-followees ).
In our opinion, the more bots a user is following, the more she/he is exposed to potentially
malicious activities. Speci cally, by using Machine Learning (ML) techniques, we aim to single
out a regression model able to predict, for a human-operated account, the percentage of its
bot-followees. Starting from a publicly available dataset5 of credulous users, built in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], and
by using commonly employed features from the literature [
        <xref ref-type="bibr" rid="ref12 ref45">45, 12</xref>
        ], we build several regression
models by means of various ML algorithms. Since this work deal with a regression task, we
cannot use the well-known metrics usually used for classi cation tasks (e.g., accuracy, F-score);
instead, as in [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ], we will use the Mean Absolute Error (MAE) and the Root Mean Squared
Error (RMSE) for evaluation.
      </p>
      <p>
        For the sake of completeness, we experiment on two \versions" of the considered dataset:
rstly by considering the subset of credulous users only (with 316 instances, henceforth called
credulous-only ), and then on the whole set of human-operated accounts (with 2,838 instances,
named all humans. The experimental results are promising. The best model trained by using
credulous-only, achieves a MAE of 4.32% and a RMSE of 6.62%. On the other hand,
astonishingly, the best model trained on the whole humans set, ts better; in fact it obtains a MAE of
3.62% and a RMSE of 5.96%. Although RMSE scores are not the best obtained, by following
the nding in [
        <xref ref-type="bibr" rid="ref48">48</xref>
        ], we prefer to give more importance to MAE scores than to RMSE.
      </p>
      <p>Despite these encouraging results, additional e orts are needed to improve users' awareness.
The usefulness in improving the accuracy of these models is twofold. Firstly, in a preventive
way, to identify sensible users more exposed to the malicious activities of bots and by being
identi ed as good targets of misinformation campaigns. Secondly, to safeguard the usefulness,
credibility and e ectiveness of social media as mean of communication. Moreover, by adapting
the concept of users' following to other types of relationships between users, it is possible to
conduct these same experiments in other Social Media, e.g. Facebook.</p>
      <p>The remainder of this paper is organized as follow: Section 2 presents the related work
highlighting di erences and novelty of our approach; Section 3 exposes the general approach
and provides the details of the performed experiments; Section 4 illustrates the experimental
results; Section 5 discusses the main ndings, and Section 6 concludes the paper by outlining
future research.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>This paper aims to investigate the dynamics and causes of human users in uenced by Social
Media, especially if interacting with bots and exposed to misinformation. In the following, we
review the related work dealing with similar goals.</p>
      <p>Despite this cannot be considered an exhaustive literature review, we tried to supply
concepts, de nitions and adopted strategies related to interactions between human-operated
accounts and bots on Social Media; and to stress the di erences and novelty in this work.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref46">46</xref>
        ] the authors stress the importance of adopting protection mechanisms in Social Media
to protect human-operated accounts. To this purpose, the authors provided the de nition of
susceptible users, i.e., users who start to interact with a social bot (even if only once). By
introducing a set of 97 features (categorized in linguistic, network and behavioural ), a binary
classi er is successfully produced to spot out susceptible users. A regression model was also built
to predict users level of susceptibility without success. Inspired by the de nition of susceptible
users, in our work we investigate on the challenging task to build a regression model able to
predict the percentage of bot-followees of human-operated accounts.
      </p>
      <p>
        On the same line of the described research, in [
        <xref ref-type="bibr" rid="ref47">47</xref>
        ] the authors conducted a feature study
to single out those features useful to predict whether a user is likely to interact with a bot. To
this end, the considered users have been contacted by a bot through a tweet mention, and when
replying users are labelled as susceptible. The drawback of this approach is represented by the
key feature (i.e., klout score), no longer available due to the related web-service closure.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ] a comprehensive categorization scheme for social bot attacks in Twitter has been
proposed. The analysis of each attack is considered along di erent dimensions, i.e., targets,
account types, vulnerabilities, attack methods and results. This categorization is useful to
investigate to which class of attacks users with a considerable percentage of bot-followees are
vulnerable. Speci cally, the authors observed the impact of social bots in link creation between
targeted human-operated accounts in Twitter.
      </p>
      <p>
        Inspired by [
        <xref ref-type="bibr" rid="ref46">46</xref>
        ], in [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ] gullible users have been de ned in relation to their susceptibility to
fake news. The authors present ve degrees of susceptibility (referred to a user's reply to a fake
news) and, by using the same features of [
        <xref ref-type="bibr" rid="ref46">46</xref>
        ], aim to build a multi-class classi er predicting the
susceptibility level. The classi er achieves an AUC of 0.82. Similarly to this approach, we also
used existing feature sets (Botometer [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] and ClassA [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]), but applied to a regression task.
      </p>
      <p>
        An interesting case study is presented in [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ], where human's skills have been tested in
recognizing fake accounts generated by the M3 app [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]. In general, there is a good humans'
ability to distinguish the generated accounts, but there are no details on the characteristics of
such fake accounts. Sharing the same motivation, our work aims to produce a regression model
that, complementary to [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ], quanti es when a human user is not able to recognize a bot.
      </p>
      <p>
        We conclude this section by mentioning our previous works [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ]. Beside the de nitions of
susceptible users [
        <xref ref-type="bibr" rid="ref46">46</xref>
        ] and gullible users [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ], in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] we introduced the concept of credulous users,
i.e., human operated accounts following a considerable amount of bots (i.e., bot-followees using
Twitter's slang). A set of rules have been introduced to discern whether a user is a credulous,
and these rules allow to rank human operated accounts by relying on the ratio of bots (supported
by a bot detector) over their followees. On a dataset with more 700 human operated accounts,
only 64 have been identi ed as credulous6. Here, the drawback is represented by the huge
amount of data needed to investigate the followees of humans under analysis.
      </p>
      <p>
        To overcome this issue, in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], we built a binary classi er to nd out credulous Twitter users
by considering a larger ground-truth (of almost 3k7) and considering only features of the pro le
and not of users' followees. We ended up with a lightweight (in terms of costs for gathering
the data) classi er. The achieved classi cation performance have been very promising with an
accuracy of 93.27% and an AUC (Area Under the ROC curve) of 0.93.
      </p>
      <p>
        Although this work is in line with the themes of the previous ones [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ], it di ers in scope
and strategy. The primary target is the prediction of a percentage value of bot-followees, and
the adopted strategy is no longer the classi cation, but the regression.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Experimental Setup</title>
      <p>This section explains the dataset, the features and the experimental design; specifying the
metrics used to evaluate the performance of the trained models.
3.1</p>
      <sec id="sec-3-1">
        <title>Dataset</title>
        <p>
          The considered dataset includes 2,838 IDs of human-operated accounts on Twitter, presented
in [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] and publicly available7. A label (0 or 1) is associated to each entry to indicate whether
an account is credulous (with 1) or not (with 0).
        </p>
        <p>
          For each account we downloaded all the information (timeline, tweet mentions and pro le
data) of its followees. Then, through of a bot detector [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], it has been possible to assign, to
each followee, a label indicating whether it is a bot. This allows us to derive a ground-truth
where each accounts is assigned to a percentage of its bot-followees (publicly available8). As
anticipated in Section 1, two versions have been built: one with 316 entries labeled as credulous
(credulous-only ) and another one including all 2,838 human-operated accounts (all hums). All
accounts in our dataset belong to human users and taken from three datasets publicly available9
described below:
cresci-2015 [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. This repository consists of three smaller datasets: (i) 469 Twitter accounts
certi ed as human-operated during in a research project named @TheFakeProject. (ii) 1,481
accounts selected as genuine users as the result of a sociological study relying on manual
verication. (iii) 833 fake accounts, bought from three di erent Twitter accounts online markets.
cresci-2017 [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. This repository contains 3,474 Twitter accounts certi ed as humans and
6,609 social spambots (e.g., spammers of job o ers and advertising products on sale at
Amazon). The humans were selected through a hybrid crowd-sensing approach [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]; the authors
of [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] randomly contacted Twitter users and asked simple questions in natural language, all
replies were then manually veri ed.
varol-2017 [
          <xref ref-type="bibr" rid="ref45">45</xref>
          ]. This repository consists of 2,573 Twitter accounts selected after a manual
annotation based on inspecting the pro le details and the produced content. Overall, 1,747
Twitter accounts were annotated as human-operated and 826 as bots.
6First Credulous Dataset: https://tinyurl.com/y6lod2yz
7Dataset: https://tinyurl.com/y4o98c7l
8Used ground-truth: https://tinyurl.com/tcjjmbu
9BotRepository:https://tinyurl.com/yxfxmqac
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Features</title>
        <p>
          The features employed to represent the human accounts can be grouped in three sets. The rst
set inherits the features from the Botometer web service10, plus some additional ones introduced
in [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. We use the Botometer macro categories scores, which encompasses the essence of all the
features (around 1,000) [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], on which the outputs' scores are computed. We extend this set
by considering also: the CAP (Completely Automated Pro le) value, the \Scores" [
          <xref ref-type="bibr" rid="ref49">49</xref>
          ], the
number of tweets and mentions. This augmented set of features will be called Botometer+.
        </p>
        <p>
          The second set inherits the so-called ClassA features, singled out in [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. We discard the one
considering duplicated pictures, because we could not verify whether the picture of a pro le was
also used in another one. This subset is called ClassA-. We want to stress that these features
can be calculated by only looking at the social pro le of an account, without considering the
timeline, that is instead considered in Botometer+. A schematic representation of these two
feature sets is reported in table 5 in Appendix A.1.
        </p>
        <p>
          The third set of features has been built through the union of the two previous ones and
called ALL features. We want to stress the dataset's independency of the used feature sets
that have been successfully used for binary classi cation task in [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. The introduction of new
features is out of the scope of this work.
3.3
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Experimental Design</title>
        <p>The experimental session starts by setting up the data; precisely, by transforming the entries
of our dataset accordingly to the three sets of features.</p>
        <p>
          Afterwards, to train regression models, 14 algorithms have been employed. The machine
learning framework utilized to conduct the experiments is Weka [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]. It is worth to notice that,
by default, the results obtained by the experimenter in the weka framework are cross-validated.
Accordingly to the notation adopted by the tool, the algorithms are: ZeroR11 (used to obtain a
baseline value against which to compare the values of the other model), REPTree [
          <xref ref-type="bibr" rid="ref37">37</xref>
          ],
LinearRegression [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ], k-Nearest Neighbour (IBk) [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], LWL [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], AdditiveRegression [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ],
RegressionByDiscretization [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], M5Rules [
          <xref ref-type="bibr" rid="ref38">38</xref>
          ], DecisionStump [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ], GaussianProcess [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ], SMOreg [
          <xref ref-type="bibr" rid="ref43">43</xref>
          ],
MultilayerPerceptron [
          <xref ref-type="bibr" rid="ref36">36</xref>
          ], MLPRegressor12, RandomForest [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. To investigate whether
regression models, built on credulous users work better than the general case, we experiment on
both versions (credulous-only and all hums).
        </p>
        <p>
          Results evaluation At best of our knowledge, there are few papers addressing this
problem [
          <xref ref-type="bibr" rid="ref42 ref46">46, 42</xref>
          ]. Hence, no well-de ned baseline is available from the literature to compare our
results. To overcome this issue, we compare the performance of the trained models (obtained
from the aforementioned algorithms) with the score calculated by ZeroR method, since it
predicts, for each human-operated account, the average value of the population.
To evaluate models' performance, two metrics have been used: Mean Absolute Error (MAE)
and Root Mean Squared Error (RMSE) that are widely used for regression tasks13 [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ]. The
former measures the average of errors in a set of numerical predictions, between the real values
and the predicted ones (M AE = n1 Pjn=1 jyrealj ypredj j); the latter measures the error too,
but it stresses more the prediction error by raising the square of the di erence between the real
values and the predicted ones (RM SE = q n1 Pjn=1 (yrealj ypredj )2).
        </p>
        <p>10Botometer web service (RapidAPI): https://tinyurl.com/yytf282s
11ZeroR weka: https://tinyurl.com/y4hdhp54
12MLPRegressor weka: https://tinyurl.com/y5krc6d2
13https://tinyurl.com/yd9ljcmj</p>
        <p>
          Through the experimental results analyzer embedded in Weka [
          <xref ref-type="bibr" rid="ref41">41</xref>
          ], we performed statistical
tests (paired T-Test [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ] with = 0:05) to determine which algorithm performs signi cantly
better than the baseline, relatively to each set of features.
        </p>
        <p>All the results are presented in the following section 4 and then discussed in section 5.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experimental Results</title>
      <p>For sake of clarity, Section 4.1 reports the results referring to the experiments performed on
the set of credulous users only (credulous-only ). Section 4.2 shows the outcome derived by
considering all the human-operated accounts (all hums).</p>
      <p>Tables 1-4 have the same structure, di ering in evaluation metric and ground-truth data
entries. In the rst column the algorithms mentioned in Section 3.3 are listed. The remaining
columns show the scores obtained when dataset's instances are represented according to a
speci c feature set (see section 3.2) namely Botometer+, ClassA- and All features. The rst
row of the table contains the baseline obtained through the ZeroR method. The star symbol
indicates some tables' entries whose associated value is signi cantly lower than the baseline,
according to the paired t-test performed by Weka (see results evaluation in Section 3.3). The
lowest score is reported in bold.
4.1</p>
      <sec id="sec-4-1">
        <title>Credulous-only</title>
        <p>Di erently from the Botometer+ case, the column ClassA- there are some starred values.</p>
        <sec id="sec-4-1-1">
          <title>Algorithms</title>
          <p>Both DecisionStump and RandomForest achieve a RMSE score of 6.15%; but, the lowest value
of 6.10% belongs to LWL, which also is the best score reported in Table 1.</p>
          <p>The last column of Table 1 contains only one starred value which also the column's lowest
score (DecisionStump). Like for the previous column, also here there are some values lower than
the baseline (AdditiveRegression with 6.20% and RandomForest with 6.21%), but not enough
to be labeled as star entries.
In this Section we report the results related to the experiments performed on all human-operated
accounts (2,838 instances).</p>
          <p>Table 3 reports the values concerning RMSE, with a baseline value of 6.25%.</p>
          <p>In the second column (Botometer+), almost all the RMSE scores are lower than the baseline
and starred, with the exception of IBk (7.73%), RegressionByDiscretization (6.32%) and
MultilayerPerceptron (7.67%). With a score of 5.77%, LinearRegression has the lowest column's
RMSE (and the second better one in Table 3). Concerning the third column (ClassA-), the
situation is slightly worse. Despite nine values have better scores than the baseline, only three
of them are signi cantly lower: 6.02% (REPTree, the lowest) and 6.06% (DecisionStump and</p>
        </sec>
        <sec id="sec-4-1-2">
          <title>Algorithms</title>
          <p>! ZeroR (baseline)
REPTree
LinearRegression
IBk
LWL
AdditiveRegression
RegressionByDiscretization
M5Rules
DecisionStump
GaussianProcesses
SMOreg
MultilayerPerceptron
MLPRegressor
RandomForest
MLPRergessor both). The forth column (ClassA-) shows a situation close to Botometer+'s
case. In fact, with exception of four cases (i.e., IBk, RegressionByDiscretization,
MultilayerPerceptron and MLPRegressor ), all the other entries have signi cantly better values w.r.t. baseline
(starred table's entries). The lowest RMSE of 5.72% is achieved by using RandomForest and
it is the better score of Table 3.</p>
          <p>Finally, Table 4 presents the MAE outcome. The calculated baseline is 4.21%. At rst</p>
        </sec>
        <sec id="sec-4-1-3">
          <title>Algorithms</title>
          <p>! ZeroR (baseline)
REPTree
LinearRegression
IBk
LWL
AdditiveRegression
RegressionByDiscretization
M5Rules
DecisionStump
GaussianProcesses
SMOreg
MultilayerPerceptron
MLPRegressor
RandomForest
sight, regardless to the feature sets, almost all the entries are lower than baseline; and most of
them are starred. When considering Botometer+ features, the exceptions are: IBk (5.07%) and
MultilayerPerceptron (4.90%); RegressionByDiscretization (4.16%) and DecisionStump (4.06%)
are not lower enough to gain the star. For Botometer+, the lowest MAE is 3.67% (the second
better value) achieved by the model built by mean of SMOreg.</p>
          <p>Similarly, when analyzing ClassA- features, the values higher than the baseline are: 5.43%
(IBk ), 4.24% (RegressionByDiscretization ) and 4.39% (MultilayerPerceptron). The remaining
values are signi cantly lower than the one in the ZeroR's row but 4.08% (LinearRegression) and
4.09% (GaussianProcesses ). Even in this case, the lowest score (3.84%) belongs to SMOreg.
Like in the previous cases, even when all features are taken into account, almost all values
are lower, not only compared to the baseline, but also compared (by row) to the values of the
other two feature sets. The values overcoming the baseline are: 5.14% (MultilayerPerceptron),
4.95% (IBk ) and 4.36% (RegressionByDiscretization ). Except MLPRegressor and
DecisionStump (both 4.07%), all the other entries have signi cantly better MAE values (starred). Once
again, SMOreg outperforms other algorithms' scores for all features, with a MAE of 3.62%; the
lowest in Table 4.
5</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Discussion</title>
      <p>It is possible to immediately notice that better results can be obtained when the full version of
the dataset (all hums) is considered rather than credulous-only, in terms of both quantity
(number of models with lower performance than the baseline) and quality (statistical signi cance of
the values).</p>
      <p>However, focusing on baseline values of each metric, the highest ones are observed in the
version credulous-only. This is due to a higher distance between the real values (by credulous
class attribute) and the average value calculated on them. The fact that all hums's baselines
have lower values indicates a better closeness to the average value of not-credulous instances.</p>
      <p>Considering the MAE metric, the model generated by the SMOreg algorithm is the most
accurate, regardless of the dataset versions. This concordance is limited exclusively to the
algorithm, as these performances have been obtained with two di erent feature sets: 4.32%
by using Botometer+ for credulous-only version and 3.62% with All features for the All hums
version.</p>
      <p>But, considering the dataset with all instances, and looking the MAE's score obtained by
SMOreg (using Botometer+'s features), we can see that the value is very similar (3,67%, the
second-best result). This 0,05% loss (3,62 vs 3,67) can still be overshadowed by the advantage
of not having to calculate the ClassA- features (included in ALL features ). Therefore, at least
as far as MAE metrics are concerned, a representation in Botometer+ features combined with
the use of the SMOreg algorithm can be considered the best choice.</p>
      <p>Good performances are also achieved by the algorithms LWL and RandomForest, producing
the models with the best RMSE in credulous-only and all hums, respectively. DecisionStump
and AdditiveRegression produce good models too, and many times even with errors signi cantly
lower than the baseline. As for the models generated through REPTree, LinearRegression,
M5Rules, GaussianProcesses and MLPRegressor, it is possible to notice an inequality depending
on the version of the dataset to which they are applied, proving more e ective when used on the
full version. Unfortunately, the use of IBk, RegressionByDiscetization and MultilayerPerceptron
has not been pro table, regardless of both the set of used features and the version of the
considered dataset.</p>
      <p>In some cases, on the same algorithm, the score obtained by using All features is identical (or
very similar) to the one in ClassA- or Botometer+. These situations occur when the algorithm
prefers to consider the components of a certain feature set. Some examples are given by:
DecisionStump in Tables 2 and 1, GaussianProcesses in Table 4 and REPTree in Table 1.</p>
      <p>Further ndings can be provided by studying, for each evaluation metric, to what extent
the choice of a feature set (w.r.t. another one) can a ect the overall performance. Regardless
of the cost to calculate a feature set, the experimental results do not show a great disparity
in preferring one feature set over another. Therefore, as far as the "MAE" is concerned, the
previous assertion of preferring the Botometer+ functionalities remains valid.</p>
      <p>On the contrary, considering RMSE, the situation is more complicated. The best values come
from the use of two distinct feature sets: ClasseA- (credulous-only ) and All features (all hums).
By using a similar logic adopted for the MAE, it is possible to notice that, the second-best RMSE
value for credulous-only is identical both for ClassA- and All features. Therefore, unlike MAE
case, if we concern about the RMSE only, we can prefer All features, making the calculus of
ClassA-'s features mandatory.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>
        The recent literature shows a great deal of concern regarding the e ectiveness of malicious bots
and in their role to a ect several domains (economics, politics, etc.). Not only as regards the
spreading of fake news, but especially on their ability to interact with and deceive human users.
In fact, the dissemination of low-credibility content is not only performed by social bots but
also emphasized by genuine users by sharing it [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>In this work, we devote our attention to single out a method that enables us to quantify,
as precisely as possible, the percentage of bots followed (bot-followees ) by human operated
accounts in Twitter. By mean of machine learning regression techniques, we derived predictive
models. The experimentation has been conducted rstly by considering credulous users only
(i.e., humans with high percentage of bots among their friends) and then on all the
humanoperated accounts in the dataset.</p>
      <p>For our experimentation we considered three feature sets, namely: Botometer+, ClassA- and
their union All features. We recall that Botometer+'s features are obtained by using the related
web-service, and for each user the following input is required: pro le data, tweets,
mentiontweets. The calculus of ClassA-'s features is less expensive because such features are derived by
analyzing users' data pro le only. The best regression model, obtained on the complete dataset
trained with the SMOreg algorithm, achieves promising performances, in fact it shows a MAE
of 3.62% by using the feature set All features and 3.67% with Botometer+'s features.</p>
      <p>We think that having an estimate of how many bots a human account follows, can be a rst
step to the fact-checking of what people reads on their dashboards and from whom they are
reading. Additionally, such approaches can help researchers and social media administrators to
(i) identify potential targets of misinformation campaigns in advance and (ii) contributing to
increase the usefulness, credibility and e ectiveness of social media.</p>
      <p>Further e orts have to be devoted to this research topic; as future work it can be interesting
to focus on the nature and quality of the information that humans with a large percentage of
bot-followees create and/or contribute to di use.</p>
      <p>A
A.1</p>
    </sec>
    <sec id="sec-7">
      <title>Appendix</title>
      <sec id="sec-7-1">
        <title>Feature sets</title>
        <sec id="sec-7-1-1">
          <title>Name</title>
        </sec>
        <sec id="sec-7-1-2">
          <title>Botometer+</title>
          <p>
            used in[
            <xref ref-type="bibr" rid="ref7">7</xref>
            ]
From Botometer[
            <xref ref-type="bibr" rid="ref45">45</xref>
            ]
          </p>
        </sec>
        <sec id="sec-7-1-3">
          <title>ClassA</title>
          <p>
            used in[
            <xref ref-type="bibr" rid="ref7">7</xref>
            ]
From Fake Follower[
            <xref ref-type="bibr" rid="ref12">12</xref>
            ]
(Class A)
          </p>
        </sec>
        <sec id="sec-7-1-4">
          <title>Original Features</title>
          <p>Macro categories scores:</p>
          <p>Sentiment, Friend,</p>
          <p>User, Content,</p>
          <p>Temporal, Net
friends/(followers2), age,
#tweets, pro le has name,
has URL in pro le, following rate,
default image after 2 months,
belongs to a list, pro le has image,
friends/followers 50,
`bot' in biography, #friends,</p>
          <p>2 followers friends,
#followers, friends/followers'100,
no bio &amp; no location &amp; friends 100,
has address, has biography</p>
          <p>Features alteration
(+) CAP (ENG and UNI)
(+) Score (ENG and UNI)
(+) #Tweets4WS
(+) #Mentions4WS
(-) duplicated pictures
of the pro le</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1] David W Aha, Dennis Kibler, and
          <string-name>
            <surname>Marc K Albert.</surname>
          </string-name>
          <article-title>Instance-based learning algorithms</article-title>
          .
          <source>Machine learning</source>
          ,
          <volume>6</volume>
          (
          <issue>1</issue>
          ):
          <volume>37</volume>
          {
          <fpage>66</fpage>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Shehu</given-names>
            <surname>Amina</surname>
          </string-name>
          , Raul Vera, Tooska Dargahi, and
          <string-name>
            <given-names>Ali</given-names>
            <surname>Dehghantanha</surname>
          </string-name>
          .
          <article-title>A bibliometric analysis of botnet detection techniques</article-title>
          .
          <source>In Handbook of Big Data and IoT Security</source>
          , pages
          <volume>345</volume>
          {
          <fpage>365</fpage>
          . Springer,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Zeenab</given-names>
            <surname>Aneez</surname>
          </string-name>
          , Taberez Ahmed Neyazi, Antonis Kalogeropoulos, and Rasmus Kleis Nielsen.
          <article-title>Reuters institute india digital news report. Reuters Institute for the Study of Journalism/India Digital News Report</article-title>
          . Retrieved from https://reutersinstitute. politics. ox. ac. uk/sites/default/ les/2019-03/India DNR FINAL. pdf on,
          <volume>26</volume>
          :
          <fpage>19</fpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C.</given-names>
            <surname>Atkeson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Moore</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Schaal</surname>
          </string-name>
          .
          <article-title>Locally weighted learning</article-title>
          .
          <source>AI Review</source>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Marco</given-names>
            <surname>Avvenuti</surname>
          </string-name>
          , Salvatore Bellomo, Stefano Cresci, Mariantonietta Noemi La Polla, and
          <string-name>
            <given-names>Maurizio</given-names>
            <surname>Tesconi</surname>
          </string-name>
          .
          <article-title>Hybrid crowdsensing: A novel paradigm to combine the strengths of opportunistic and participatory crowdsensing</article-title>
          .
          <source>In Proceedings of the 26th International Conference on World Wide Web Companion, Perth, Australia, April 3-7</source>
          ,
          <year>2017</year>
          , pages
          <fpage>1413</fpage>
          {
          <fpage>1421</fpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Alessandro</given-names>
            <surname>Balestrucci</surname>
          </string-name>
          , Rocco De Nicola, Omar Inverso, and
          <string-name>
            <given-names>Catia</given-names>
            <surname>Trubiani</surname>
          </string-name>
          .
          <article-title>Identi cation of credulous users on twitter</article-title>
          .
          <source>In Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing</source>
          , pages
          <year>2096</year>
          {
          <article-title>2103</article-title>
          . ACM,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Alessandro</given-names>
            <surname>Balestrucci</surname>
          </string-name>
          , Rocco De Nicola, Marinella Petrocchi, and
          <string-name>
            <given-names>Catia</given-names>
            <surname>Trubiani</surname>
          </string-name>
          .
          <article-title>Do you really follow them? automatic detection of credulous twitter users</article-title>
          . arXiv preprint arXiv:
          <year>1909</year>
          .03851 - to appear
          <source>in Proceedings of IDEAL</source>
          <year>2019</year>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Alessandro</given-names>
            <surname>Bessi</surname>
          </string-name>
          and
          <string-name>
            <given-names>Emilio</given-names>
            <surname>Ferrara</surname>
          </string-name>
          .
          <article-title>Social bots distort the 2016 us presidential election online discussion</article-title>
          .
          <source>First Monday</source>
          ,
          <volume>21</volume>
          (
          <issue>11-7</issue>
          ),
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Samantha</given-names>
            <surname>Bradshaw</surname>
          </string-name>
          and
          <string-name>
            <given-names>Philip</given-names>
            <surname>Howard</surname>
          </string-name>
          .
          <article-title>Troops, trolls and troublemakers: A global inventory of organized social media manipulation</article-title>
          .
          <source>Oxford Internet Institute</source>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Leo</given-names>
            <surname>Breiman</surname>
          </string-name>
          .
          <article-title>Random forests</article-title>
          .
          <source>Machine learning</source>
          ,
          <volume>45</volume>
          (
          <issue>1</issue>
          ):5{
          <fpage>32</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <article-title>Irene Costera Meijer and Tim Groot Kormelink. Checking, sharing, clicking and linking: Changing patterns of news use between 2004 and 2014</article-title>
          . Digital Journalism,
          <volume>3</volume>
          (
          <issue>5</issue>
          ):
          <volume>664</volume>
          {
          <fpage>679</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Stefano</surname>
            <given-names>Cresci</given-names>
          </string-name>
          , Roberto Di Pietro, Marinella Petrocchi, Angelo Spognardi, and
          <string-name>
            <given-names>Maurizio</given-names>
            <surname>Tesconi</surname>
          </string-name>
          .
          <article-title>Fame for sale: E cient detection of fake Twitter followers</article-title>
          .
          <source>Decision Support Systems</source>
          ,
          <volume>80</volume>
          :
          <fpage>56</fpage>
          {
          <fpage>71</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Stefano</surname>
            <given-names>Cresci</given-names>
          </string-name>
          , Roberto Di Pietro, Marinella Petrocchi, Angelo Spognardi, and
          <string-name>
            <given-names>Maurizio</given-names>
            <surname>Tesconi</surname>
          </string-name>
          .
          <article-title>The paradigm-shift of social spambots: Evidence, theories, and tools for the arms race</article-title>
          .
          <source>In Proceedings of the 26th International Conference on World Wide Web Companion, Perth, Australia, April 3-7</source>
          ,
          <year>2017</year>
          , pages
          <fpage>963</fpage>
          {
          <fpage>972</fpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Florian</surname>
            <given-names>Daniel</given-names>
          </string-name>
          , Cinzia Cappiello, and
          <string-name>
            <given-names>Boualem</given-names>
            <surname>Benatallah</surname>
          </string-name>
          .
          <article-title>Bots acting like humans: understanding and preventing harm</article-title>
          .
          <source>IEEE Internet Computing</source>
          ,
          <volume>23</volume>
          (
          <issue>2</issue>
          ):
          <volume>40</volume>
          {
          <fpage>49</fpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Clayton</given-names>
            <surname>Allen</surname>
          </string-name>
          <string-name>
            <surname>Davis</surname>
          </string-name>
          , Onur Varol, Emilio Ferrara, Alessandro Flammini, and
          <string-name>
            <given-names>Filippo</given-names>
            <surname>Menczer</surname>
          </string-name>
          .
          <article-title>Botornot: A system to evaluate social bots</article-title>
          .
          <source>In Proceedings of the 25th International Conference Companion on World Wide Web</source>
          , pages
          <volume>273</volume>
          {
          <fpage>274</fpage>
          . International World Wide Web Conferences Steering Committee,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Phillip</given-names>
            <surname>George Efthimion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Scott</given-names>
            <surname>Payne</surname>
          </string-name>
          , and Nicholas Proferes.
          <article-title>Supervised machine learning bot detection techniques to identify social twitter bots</article-title>
          .
          <source>SMU Data Science Review</source>
          ,
          <volume>1</volume>
          (
          <issue>2</issue>
          ):
          <fpage>5</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Emilio</given-names>
            <surname>Ferrara</surname>
          </string-name>
          .
          <article-title>Disinformation and social bot operations in the run up to the 2017 french presidential election</article-title>
          .
          <source>First Monday</source>
          ,
          <volume>22</volume>
          (
          <issue>8</issue>
          ),
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Emilio</surname>
            <given-names>Ferrara</given-names>
          </string-name>
          , Onur Varol, Clayton Davis,
          <string-name>
            <given-names>Filippo</given-names>
            <surname>Menczer</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Alessandro</given-names>
            <surname>Flammini</surname>
          </string-name>
          .
          <article-title>The rise of social bots</article-title>
          .
          <source>Communications of the ACM</source>
          ,
          <volume>59</volume>
          (
          <issue>7</issue>
          ):
          <volume>96</volume>
          {
          <fpage>104</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>Eibe</given-names>
            <surname>Frank and Remco R Bouckaert.</surname>
          </string-name>
          <article-title>Conditional density estimation with class probability estimators</article-title>
          .
          <source>In Asian Conference on Machine Learning</source>
          , pages
          <volume>65</volume>
          {
          <fpage>81</fpage>
          . Springer,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>J.H.</given-names>
            <surname>Friedman</surname>
          </string-name>
          .
          <article-title>Stochastic gradient boosting</article-title>
          .
          <source>Technical report</source>
          , Stanford University,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>Mark</given-names>
            <surname>Hall</surname>
          </string-name>
          , Eibe Frank, Geo rey Holmes, Bernhard Pfahringer,
          <string-name>
            <given-names>Peter</given-names>
            <surname>Reutemann</surname>
          </string-name>
          , and
          <string-name>
            <surname>Ian H Witten</surname>
          </string-name>
          .
          <article-title>The weka data mining software: an update</article-title>
          .
          <source>ACM SIGKDD explorations newsletter</source>
          ,
          <volume>11</volume>
          (
          <issue>1</issue>
          ):
          <volume>10</volume>
          {
          <fpage>18</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Philip</surname>
            <given-names>N Howard</given-names>
          </string-name>
          and
          <string-name>
            <given-names>Bence</given-names>
            <surname>Kollanyi</surname>
          </string-name>
          . Bots,# strongerin, and
          <article-title># brexit: computational propaganda during the uk-eu referendum</article-title>
          .
          <source>Available at SSRN 2798311</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>Henry</given-names>
            <surname>Hsu and Peter A Lachenbruch</surname>
          </string-name>
          .
          <article-title>Paired t test</article-title>
          .
          <source>Wiley encyclopedia of clinical trials, pages 1{3</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>Wayne</given-names>
            <surname>Iba</surname>
          </string-name>
          and
          <string-name>
            <given-names>Pat</given-names>
            <surname>Langley</surname>
          </string-name>
          .
          <article-title>Induction of one-level decision trees</article-title>
          .
          <source>In Machine Learning Proceedings</source>
          <year>1992</year>
          , pages
          <fpage>233</fpage>
          {
          <fpage>240</fpage>
          .
          <string-name>
            <surname>Elsevier</surname>
          </string-name>
          ,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Tobias</surname>
            <given-names>R Keller</given-names>
          </string-name>
          and Ulrike Klinger.
          <article-title>Social bots in election campaigns: Theoretical, empirical, and methodological implications</article-title>
          .
          <source>Political Communication</source>
          ,
          <volume>36</volume>
          (
          <issue>1</issue>
          ):
          <volume>171</volume>
          {
          <fpage>189</fpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>David</given-names>
            <surname>Kempe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Jon</given-names>
            <surname>Kleinberg</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Eva</given-names>
            <surname>Tardos</surname>
          </string-name>
          .
          <article-title>Maximizing the spread of in uence through a social network</article-title>
          .
          <source>In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          , pages
          <volume>137</volume>
          {
          <fpage>146</fpage>
          . ACM,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>David MJ Lazer</surname>
          </string-name>
          ,
          <article-title>Matthew A Baum, Yochai Benkler</article-title>
          , Adam J Berinsky, Kelly M Greenhill,
          <string-name>
            <given-names>Filippo</given-names>
            <surname>Menczer</surname>
          </string-name>
          , Miriam J Metzger, Brendan Nyhan, Gordon Pennycook,
          <string-name>
            <surname>David Rothschild</surname>
          </string-name>
          , et al.
          <article-title>The science of fake news</article-title>
          .
          <source>Science</source>
          ,
          <volume>359</volume>
          (
          <issue>6380</issue>
          ):
          <volume>1094</volume>
          {
          <fpage>1096</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>Saskia</given-names>
            <surname>Le Cessie and Johannes C Van</surname>
          </string-name>
          <article-title>Houwelingen</article-title>
          .
          <article-title>Ridge estimators in logistic regression</article-title>
          .
          <source>Journal of the Royal Statistical Society</source>
          : Series C (Applied Statistics),
          <volume>41</volume>
          (
          <issue>1</issue>
          ):
          <volume>191</volume>
          {
          <fpage>201</fpage>
          ,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>S</given-names>
            <surname>Li</surname>
          </string-name>
          and
          <string-name>
            <given-names>ATS</given-names>
            <surname>Ho</surname>
          </string-name>
          .
          <article-title>Hiding information in a digital environment</article-title>
          . Publication No. WO/
          <year>2016</year>
          /075459, International Application No.
          <source>PCT/GB2015/053412, GB application led on 11th November</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <surname>David</surname>
            <given-names>J.C.</given-names>
          </string-name>
          <string-name>
            <surname>Mackay</surname>
          </string-name>
          . Introduction to gaussian processes,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <surname>Silvia</surname>
            <given-names>Mitter</given-names>
          </string-name>
          , Claudia Wagner, and
          <string-name>
            <given-names>Markus</given-names>
            <surname>Strohmaier</surname>
          </string-name>
          .
          <article-title>A categorization scheme for socialbot attacks in online social networks</article-title>
          .
          <source>arXiv preprint arXiv:1402.6288</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <surname>Jojo</surname>
            <given-names>Moolayil</given-names>
          </string-name>
          , Moolayil, and
          <string-name>
            <given-names>Suresh</given-names>
            <surname>John</surname>
          </string-name>
          .
          <source>Learn Keras for Deep Neural Networks</source>
          . Springer,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <surname>Atif</surname>
            <given-names>Mushtaq</given-names>
          </string-name>
          , Todd Rosenberry, Ashar Aziz, and
          <string-name>
            <given-names>Ali</given-names>
            <surname>Islam</surname>
          </string-name>
          .
          <article-title>Distributed systems and methods for automatically detecting unknown bots and botnets</article-title>
          ,
          <source>February</source>
          <volume>5</volume>
          2019. US Patent
          <volume>10</volume>
          ,
          <issue>200</issue>
          ,
          <fpage>384</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <surname>Nic</surname>
            <given-names>Newman</given-names>
          </string-name>
          , Richard Fletcher, Antonis Kalogeropoulos, David Levy, and Rasmus Kleis Nielsen.
          <source>Reuters institute digital news report 2017. Reuters Institute for the Study of Journalism</source>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <surname>Nic</surname>
            <given-names>Newman</given-names>
          </string-name>
          , Richard Fletcher, Antonis Kalogeropoulos, David AL Levy,
          <article-title>and</article-title>
          <string-name>
            <given-names>Rasmus-Kleis</given-names>
            <surname>Nielsen</surname>
          </string-name>
          .
          <source>Digital news report 2016. Reuters Institute for the study of Journalism</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <surname>Sankar</surname>
            <given-names>K</given-names>
          </string-name>
          <string-name>
            <surname>Pal and Sushmita Mitra</surname>
          </string-name>
          .
          <article-title>Multilayer perceptron, fuzzy sets, and classi cation</article-title>
          .
          <source>IEEE Transactions on neural networks</source>
          ,
          <volume>3</volume>
          (
          <issue>5</issue>
          ):
          <volume>683</volume>
          {
          <fpage>697</fpage>
          ,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <surname>J. Ross Quinlan</surname>
          </string-name>
          .
          <article-title>Simplifying decision trees</article-title>
          .
          <source>International Journal of Human-Computer Studies</source>
          ,
          <volume>27</volume>
          (
          <issue>3</issue>
          ):
          <volume>221</volume>
          {
          <fpage>234</fpage>
          ,
          <year>1987</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <surname>Ross</surname>
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Quinlan</surname>
          </string-name>
          .
          <article-title>Learning with continuous classes</article-title>
          .
          <source>In 5th Australian Joint Conference on Arti cial Intelligence</source>
          , pages
          <fpage>343</fpage>
          {
          <fpage>348</fpage>
          ,
          <string-name>
            <surname>Singapore</surname>
          </string-name>
          ,
          <year>1992</year>
          . World Scienti c.
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <surname>Christopher</surname>
            <given-names>Sandy</given-names>
          </string-name>
          , Patrice Rusconi, and
          <string-name>
            <given-names>Shujun</given-names>
            <surname>Li</surname>
          </string-name>
          .
          <article-title>Can humans detect the authenticity of social media accounts? on the impact of verbal and non-verbal cues on credibility judgements of twitter pro les</article-title>
          .
          <source>In 2017 3rd IEEE International Conference on Cybernetics (CYBCONF)</source>
          , pages
          <fpage>1</fpage>
          <article-title>{8</article-title>
          . IEEE,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <surname>Saiph</surname>
            <given-names>Savage</given-names>
          </string-name>
          ,
          <article-title>Andres Monroy-Hernandez, and Tobias Hollerer. Botivist: Calling volunteers to action using online bots</article-title>
          .
          <source>In CSCW. ACM</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>David</given-names>
            <surname>Scuse</surname>
          </string-name>
          and
          <string-name>
            <given-names>Peter</given-names>
            <surname>Reutemann</surname>
          </string-name>
          .
          <article-title>Weka experimenter tutorial for version 3-5-5</article-title>
          . University of Waikato,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>Tracy</given-names>
            <surname>Jia</surname>
          </string-name>
          <string-name>
            <surname>Shen</surname>
          </string-name>
          , Robert Cowell, Aditi Gupta, Thai Le, Amulya Yadav, and
          <string-name>
            <given-names>Dongwon</given-names>
            <surname>Lee</surname>
          </string-name>
          .
          <article-title>How gullible are you?: Predicting susceptibility to fake news</article-title>
          .
          <source>In Proceedings of the 11th ACM Conference on Web Science, WebSci</source>
          <year>2019</year>
          , Boston, MA, USA, June 30 - July 03,
          <year>2019</year>
          , pages
          <fpage>287</fpage>
          {
          <fpage>288</fpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [43]
          <string-name>
            <given-names>S.K.</given-names>
            <surname>Shevade</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.S.</given-names>
            <surname>Keerthi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bhattacharyya</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.R.K.</given-names>
            <surname>Murthy</surname>
          </string-name>
          .
          <article-title>Improvements to the smo algorithm for svm regression</article-title>
          .
          <source>In IEEE Transactions on Neural Networks</source>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          [44]
          <string-name>
            <given-names>Pablo</given-names>
            <surname>Suarez-Serrato</surname>
          </string-name>
          , Margaret E Roberts, Clayton Davis, and
          <string-name>
            <given-names>Filippo</given-names>
            <surname>Menczer</surname>
          </string-name>
          .
          <article-title>On the in uence of social bots in online protests</article-title>
          .
          <source>In International Conference on Social Informatics</source>
          , pages
          <volume>269</volume>
          {
          <fpage>278</fpage>
          . Springer,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          [45]
          <string-name>
            <surname>Onur</surname>
            <given-names>Varol</given-names>
          </string-name>
          , Emilio Ferrara, Clayton A.
          <string-name>
            <surname>Davis</surname>
            ,
            <given-names>Filippo</given-names>
          </string-name>
          <string-name>
            <surname>Menczer</surname>
            , and
            <given-names>Alessandro</given-names>
          </string-name>
          <string-name>
            <surname>Flammini</surname>
          </string-name>
          .
          <article-title>Online human-bot interactions: Detection, estimation, and characterization</article-title>
          .
          <source>In Proceedings of the Eleventh International Conference on Web and Social Media</source>
          ,
          <string-name>
            <surname>ICWSM</surname>
          </string-name>
          <year>2017</year>
          , Montreal, Quebec, Canada, May
          <volume>15</volume>
          -18,
          <year>2017</year>
          ., pages
          <volume>280</volume>
          {
          <fpage>289</fpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          [46]
          <string-name>
            <surname>Claudia</surname>
            <given-names>Wagner</given-names>
          </string-name>
          , Silvia Mitter, Christian Korner, and Markus Strohmaier.
          <article-title>When social bots attack: Modeling susceptibility of users in online social networks</article-title>
          .
          <source>In # MSM</source>
          , pages
          <volume>41</volume>
          {
          <fpage>48</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          [47]
          <string-name>
            <surname>Randall</surname>
            <given-names>Wald</given-names>
          </string-name>
          , Taghi M Khoshgoftaar,
          <string-name>
            <given-names>Amri</given-names>
            <surname>Napolitano</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Chris</given-names>
            <surname>Sumner</surname>
          </string-name>
          .
          <article-title>Predicting susceptibility to social bots on twitter</article-title>
          .
          <source>In 2013 IEEE 14th International Conference on Information Reuse &amp; Integration (IRI)</source>
          , pages
          <fpage>6</fpage>
          <lpage>{</lpage>
          13. IEEE,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          [48]
          <string-name>
            <surname>Cort J Willmott and Kenji Matsuura</surname>
          </string-name>
          .
          <article-title>Advantages of the mean absolute error (mae) over the root mean square error (rmse) in assessing average model performance</article-title>
          .
          <source>Climate research</source>
          ,
          <volume>30</volume>
          (
          <issue>1</issue>
          ):
          <volume>79</volume>
          {
          <fpage>82</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref49">
        <mixed-citation>
          [49]
          <string-name>
            <surname>Kai-Cheng</surname>
            <given-names>Yang</given-names>
          </string-name>
          , Onur Varol,
          <article-title>Clayton A Davis, Emilio Ferrara, Alessandro Flammini, and Filippo Menczer. Arming the public with arti cial intelligence to counter social bots</article-title>
          .
          <source>Human Behavior and Emerging Technologies</source>
          ,
          <volume>1</volume>
          (
          <issue>1</issue>
          ):
          <volume>48</volume>
          {
          <fpage>61</fpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref50">
        <mixed-citation>
          [50]
          <string-name>
            <given-names>Xinyi</given-names>
            <surname>Zhou</surname>
          </string-name>
          and
          <string-name>
            <given-names>Reza</given-names>
            <surname>Zafarani</surname>
          </string-name>
          .
          <article-title>Fake news: A survey of research, detection methods, and opportunities</article-title>
          . arXiv preprint arXiv:
          <year>1812</year>
          .00315,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>