The DOI matches its Crossref record; 53 of the 67 references it cites were found in a registry or an index; 5 of the 96 sources its claims cite were checked for support.
Fame for sale: Efficient detection of fake Twitter followers
Open accessAbstract
Fake followers are those Twitter accounts specifically created to inflate the number of followers of a target account. Fake followers are dangerous for the social platform and beyond, since they may alter concepts like popularity and influence in the Twittersphere—hence impacting on economy, politics, and society. In this paper, we contribute along different dimensions. First, we review some of the most relevant existing features and rules (proposed by Academia and Media) for anomalous Twitter accounts detection. Second, we create a baseline dataset of verified human and fake follower accounts. Such baseline dataset is publicly available to the scientific community. Then, we exploit the baseline dataset to train a set of machine-learning classifiers built over the reviewed rules and features. Our results show that most of the rules proposed by Media provide unsatisfactory performance in revealing fake followers, while features proposed in the past by Academia for spam detection provide good results. Building on the most promising features, we revise the classifiers both in terms of reduction of overfitting and cost for gathering the data needed to compute the features. The final result is a novel Class A classifier, general enough to thwart overfitting, lightweight thanks to the usage of the less costly features, and still able to correctly classify more than 95% of the accounts of the original training set. We ultimately perform an information fusion-based sensitivity analysis, to assess the global sensitivity of each of the features employed by the classifier. The findings reported in this paper, other than being supported by a thorough experimental methodology and interesting on their own, also pave the way for further investigation on the novel issue of fake Twitter followers.
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
The paper builds a public baseline of verified human and purchased fake Twitter follower accounts, then tests media/blogger rules and academic spam-detection features for fake-follower detection. It finds rule-based methods perform poorly, while feature-based classifiers work well, and proposes a lightweight Class A classifier using only profile features that still exceeds 95% accuracy on the original training set.
Key findings
- Media/blogger rules were largely ineffective: only three rules had MCC ≥ 0.6—followers ≥ 30, tweets ≥ 50, and tweeting a userID—while the Camisani-Calzolari algorithm achieved accuracy 0.548, precision 0.974, recall 0.062, F-Measure 0.116, and MCC 0.175 on BAS.
- Academic spam-detection feature sets performed strongly: with Yang et al.’s features, Random Forest reached accuracy 0.991, MCC 0.983, and AUC 0.998; with Stringhini et al.’s features, Random Forest reached accuracy 0.981, MCC 0.961, and AUC 0.995.
- The lightweight Class A classifier using only profile features remained effective: Random Forest achieved accuracy 0.987, MCC 0.967, and AUC 0.995 on BAS; on a random sampled-account test set it reached accuracy 0.975, precision 0.982, recall 0.975, and MCC 0.949.
- The bidirectional link ratio had the highest single-feature information gain (0.905) and Pcc (0.875); in the Class A sensitivity analysis, friends/(followers²) ratio ranked first with normalized score 1.000, followed by age (0.919) and number of tweets (0.816).
Methods
- Built a balanced baseline dataset (BAS) of 3,900 accounts: 1,950 verified humans (469 CAPTCHA-certified TFP followers plus 1,481 manually verified E13 accounts) and 1,950 fake followers randomly undersampled from 3,351 purchased accounts from three markets (FSF, INT, TWT).
- Tested grey-literature rules and academic feature sets from Stringhini et al. and Yang et al.; trained eight classifiers—Random Forest, Decorate, J48, Adaptive Boosting, Bayesian Network, k-Nearest Neighbors, Logistic Regression, and SVM—using Weka and 10-fold cross-validation, evaluating accuracy, precision, recall, F-Measure, MCC, AUC, information gain, and Pearson correlation.
- Classified features by crawling cost into Class A (profile), Class B (timeline), and Class C (relationships), built Class A-only classifiers, validated them on 1,000 randomly sampled accounts and 1,500 sampled Obama followers plus 1,401 held-out fake followers, and performed an information fusion-based sensitivity analysis.
Limitations
- The paper states the fake-follower dataset is illustrative, not exhaustive, and was found by simple Web searches; it also states the natural distribution of fake versus human followers is unknown, so the balanced BAS distribution is a conservative assumption, and Twitter’s <5% false/spam MAU estimate cannot be directly extended to followers of a given account.
- The paper states rules 6 and 7 from Stateofsearch could not be applied because they require continuous monitoring of friends/followers lists, which Twitter API rate limits make practically infeasible; it also notes countermeasures could evade the simplest features, requiring continual feature monitoring and updating.
- The paper states validation labels sampled accounts as humans, allowing at most a 5% error, and that classifiers could not be completely reproduced from prior work because of different datasets; evident from the text, Class A kNN, LR, and SVM classifiers dropped substantially versus Class C counterparts, and validation on Obama followers was more error-prone than on random sampled accounts.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
5 of 96 cited sources checked · 1 supported · 1 flagged · accuracy not yet measured
At least one cited source doesn’t support this claim or points to a different paper, and none confirmed it — see the verdicts below.
In the paper
“artificially inflating the number of followers can also be finalized to make an account more trustworthy and influential, in order to stand from the crowd and to attract other genuine followers [5].”
What the sources say
- Disputedcites [5] [5] M. Cha, H. Haddadi, F. Benevenuto, P. K. Gummadi, Measuring user influence in Twitter: The million follower fallacy, ICWSM 10 (10-17) (2010) 30. - sourceExperimental — accuracy not yet measured
The Introduction (page unavailable) says follower count alone reveals little about influence and that even a million followers does not necessarily mean much; it identifies retweets and mentions from an active audience as more meaningful. This runs contrary to the claim that inflating follower count makes an account influential. The paper does not address whether artificial inflation increases perceived trustworthiness or attracts genuine followers. (LLM, conf=0.76)
Checked by a reasoning model — may be wrong.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- Disputed
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Building on theoretical calculations and empirical evaluations, we show how the best performing features are also the most costly ones.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our results show that most of the rules proposed by Media provide unsatisfactory performance in revealing fake followers, while features proposed in the past by Academia for spam detection provide good results.”
- Also stated in: § Contributions · p. 3 · plain
“classifiers based on features sets for spambot detection work quite well also for fake followers detection.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- Also stated in: § Contributions · p. 3 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Concerning the features underlying the rules, we find that the Pcc ∗ is strongly reduced because, as above noticed, they can (and indeed do) assume very high values and this severely affects the linear correlation with the class.”
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The information gain of the rules ( I gain ) is always lower than the evaluation of the related attribute I gain* , while this is not true for the Pearson correlation coefficient ( Pcc and Pcc* ).”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The relevance to the prediction task is also confirmed by both the I gain/I gain ∗ and the Pcc/Pcc ∗ values.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Similarly, rules 4 and 5 are much more useful for the detection process when considering their underlying features (namely, number of retweets and number of tweets with URLs).”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our experiments in the following sections will show that, generally, a rule and the corresponding attribute assume very different values for the information gain and the Pearson correlation coefficient.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The information gain of the rules ( I gain ) is always lower than the evaluation of the related attribute I gain* , while this is not true for the Pearson correlation coefficient ( Pcc and Pcc* ).”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIn the paper
“As expected, the algorithm has a poor accuracy (very close to 0.5)”
What the sources say
- Not matchedcites [12] [12] Camisani-Calzolari M. (digitalevaluations), Analysis of Twitter followers of the US Presidential Election candidates: Barack Obama and Mitt Romney (August 2012). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- Not matched
- Probably not a substantial claim. 54
- It may state two separate claims as one. 59
- The quote only partly states this claim. 4
Every source the paper cites for this claim was checked and supports it.
In the paper
“The conclusions of their investigation have shown that the metric used to evaluate the performance of the different classifiers changes the optimal distribution of the classes for the training set.”
What the sources say
- Supportedcites [34] [34] G. M. Weiss, F. Provost, Learning when training data are costly: the effect of class distribution on tree induction, Journal of Artificial Intelligence Research 19 (2003) 315-354. - source
The Conclusion (Section 10; page unavailable) says the best training-class distribution tends to be near the natural distribution when accuracy is the performance measure, but near a balanced distribution when AUC is used. This directly supports the claim that the evaluation metric affects the optimal training-class distribution. (LLM, conf=0.93)
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Moreover, the optimal distribution has an oversampling of the minority class (there are also cases when the best classifier is obtained with an oversampling up to 90% of the minority class samples).”
What the sources say
- Partly supportedcites [34] [34] G. M. Weiss, F. Provost, Learning when training data are costly: the effect of class distribution on tree induction, Journal of Artificial Intelligence Research 19 (2003) 315-354. - sourceExperimental — accuracy not yet measured
Section 6.3 (page unavailable) reports that, for AUC, 11 of the 12 data sets whose optimal range excludes the natural distribution have more minority-class examples in that range. This supports the claim that increasing the minority-class share can be optimal. The cited 90% example is not established as the best classifier overall: the paper says it performs better at high true-positive rates in one example, while a balanced distribution has the highest AUC for that data set. (LLM, conf=0.85)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Partly supported
The cited sources that could be checked couldn’t confirm or dispute this claim.
In the paper
“The authors exploit several characteristics that can be gathered crawling an account's details, both from its profile and timeline. For each investigated account, such characteristics are exploited in a Random Forest algorithm [23, 43], that outputs if the account is a spambot or not.”
What the sources say
- Not checked — no full text of the sourcecites [8] [8] G. Stringhini, C. Kruegel, G. Vigna, Detecting spammers on social networks, in: 26th Annual Computer Security Applications Conference, ACSAC '10, ACM, 2010, pp. 1-9. - source
- Not matchedcites [23] [23] M. Hall, I. Witten, E. Frank, Data Mining: Practical Machine Learning Tools and Techniques, 3rd Edition, Morgan Kaufmann, 2011. -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Could not verifycites [43] [43] M. Hall, E. Frank, G. Holmes, B. Pfahringer, P. Reutemann, I. H. Witten, The WEKA data mining software: an update, ACM SIGKDD explorations newsletter 11 (1) (2009) 10-18. - sourceExperimental — accuracy not yet measured
The WEKA Workbench section describes software for applying classification algorithms, but it does not describe crawling account profiles or timelines to detect spambots. Searches for Random Forest and spambot account features found no passage in our copy establishing the specific method attributed to this source. (LLM, conf=0.76)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Sensitivity analysis, instead, aims at assessing the relative importance of the different features used to build a classification model [48].”
What the sources say
- Partly supportedcites [48] [48] A. Saltelli, Making best use of model evaluations to compute sensitivity indices, Computer Physics Communications 145 (2) (2002) 280-297. sourceExperimental — accuracy not yet measured
The Introduction (page unavailable) says global sensitivity analysis quantifies the relative importance of model input variables in determining an output. That supports the general purpose described, but the paper does not specifically address features used to build a classification model. (LLM, conf=0.86)
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Partly supported
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our results show that most of the rules proposed by Media provide unsatisfactory performance in revealing fake followers, while features proposed in the past by Academia for spam detection provide good results.”
- Also stated in: § Contributions · p. 3 · plain
“algorithms based on classification rules do not succeed in detecting the fake followers in our baseline dataset.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe quote only partly states this claim.
- Also stated in: § Contributions · p. 3 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The final result is a novel Class A classifier, general enough to thwart overfitting, lightweight thanks to the usage of the less costly features, and still able to correctly classify more than 95% of the accounts of the original training set.”
- Also stated in: § Contributions · p. 3 · plain
“lightweight classifiers that make use of the less costly features, while still being able to correctly classify more than 95% of the accounts of our training dataset.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
- Also stated in: § Contributions · p. 3 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Summarizing, independently from the typology of the account, the rules are almost always satisfied, leading to a severe flaw when dealing with fake followers detection.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Indeed, the large majority of the accounts are recognized as humans, resulting in a high precision, accuracy around 0.5 and very low recall.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The trained classifiers obtained their best results on a balanced distribution of humans and fake followers.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe quote only partly states this claim.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As shown, only three rules obtained a value higher than 0.6, namely: (1) the threshold of at least 30 followers, (2) the threshold of at least 50 tweets, and (3) the use of a userID in at least one tweet.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“in our dataset, fake followers accounts almost never tweet from API (instead, they use Twitter.com to tweet), whereas human accounts have posted at least once from outside the website.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Although obtaining very good results in detecting the real human accounts, the algorithm achieves a poor fake follower account detection.”
What the sources say
- Not matchedcites [12] [12] Camisani-Calzolari M. (digitalevaluations), Analysis of Twitter followers of the US Presidential Election candidates: Barack Obama and Mitt Romney (August 2012). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
- Not matched
In the paper
“As an example, all rules by Van Den Beld have accuracy and precision close to 0.5 or a very low recall.”
What the sources say
- Not matchedcites [11] [11] Stateofsearch.com, How to recognize Twitterbots: 7 signals to look out for., http://goo.gl/YZbVf, Last checked 23/07/15 (August 2012). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Not matched
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“If we consider as useful the rules and features that have an information gain value higher than 0.5, we observe that, even if many rules exhibit a very low I gain , their 'feature' version becomes much more interesting: for example, rules 18, 20, 21 and 22 have an evident increase in their information gain when used as features.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Coincidentally, we have that the best performing rules also show the highest Pcc values, namely their satisfaction is more strongly related to the belonging class.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We contacted their customer service, but we were answered that 'how the respective criteria are measured is rather an internal information'.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As expected by the definition of MCC , such rules also exhibit a combination of high accuracy, precision, and recall.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesThe quote only partly states this claim.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The exception is rule 6, '0 tweets': as a rule, it has an information gain value of 0.02, but when considered as a feature (i.e., number of tweets) it obtains 0.621.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Also, we observe that 'tweet from API' has an MCC of -0.779, meaning that it is strictly related to the class of the account, but by an inverse factor:”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“This poor performance is also expressed by a F-Measure close to 0.1 and by the low MCC value.”
What the sources say
- Not matchedcites [12] [12] Camisani-Calzolari M. (digitalevaluations), Analysis of Twitter followers of the US Presidential Election candidates: Barack Obama and Mitt Romney (August 2012). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Not matched
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Observing the results in Table 11, we can identify several promising features: 'number of tweets' (already noticed in Section 4), 'ratio between friends and followersˆ2', 'bidirectional links ratio' and 'API ratio'.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: The features from [2] and [8] are correctly implemented and computed.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This test set therefore comprises a broad range of accounts created during the nine years since Twitter's advent.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Observing the tree structure of our J48 classifier, instead, low values for this feature characterize fake followers, compared with higher values that indicate human accounts in our baseline dataset.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: The labels in the BAS dataset (human vs fake follower) are accurate.
- Rests on an assumption: The features from [2] and [8] are correctly implemented and computed.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The reduced error pruning with 50 folds produces a classifier that has MCC dropping from 0.966 to 0.866.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe quote only partly states this claim.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“For example, the tree that does not use that feature, pruned with subtree raising confidence of 0.25, requires 101 nodes, whereas the tree that uses it requires only 33 nodes.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Then, all the classifiers of the previous sections are classifiers of Class B , with the exception of the classifier with the feature set of Yang et al. [2], that belongs to Class C .”
What the sources say
- Not checked — no full text of the sourcecites Yang et al. [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“The decision tree obtained with the feature set of Stringhini et al. [8] has 22 leaves, 43 nodes, and a height of 7, whereas the best feature is the friends/(followersˆ2) ratio that places at the root.”
What the sources say
- Not checked — no full text of the sourcecites [8] [8] G. Stringhini, C. Kruegel, G. Vigna, Detecting spammers on social networks, in: 26th Annual Computer Security Applications Conference, ACSAC '10, ACM, 2010, pp. 1-9. - source
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: The features from [2] and [8] are correctly implemented and computed.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“More than 72% of the fake followers in our training dataset have a URL ratio lower than 0.05, oppositely to 14% of human accounts.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: The labels in the BAS dataset (human vs fake follower) are accurate.
- Rests on an assumption: The features from [2] and [8] are correctly implemented and computed.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Indeed, in this experiment SVM scores only slightly worse than RF, D and J48, and better than AB.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: The labels in the BAS dataset (human vs fake follower) are accurate.
- Rests on an assumption: The features from [2] and [8] are correctly implemented and computed.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“All the rules and features considered in this study fall into one of the three aforementioned categories, as reported in Table 14.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“The decision tree with the feature set of Yang et al. [2] has 17 leaves, 33 nodes and a height of 8, with the bi-directional link ratio as the root.”
What the sources say
- Not checked — no full text of the sourcecites [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Rests on an assumption: The features from [2] and [8] are correctly implemented and computed.
A claim is checked only against the cited paper’s full text, never its abstract, and none is available for its sources.
In the paper
“Furthermore, we clearly observe that the pruned version of Stringhini et al. [8] reduces its recall of 0.017, while the one of Yang et al. [2] only drops of 0.004”
What the sources say
- Not checked — no full text of the sourcecites Stringhini et al. [8] [8] G. Stringhini, C. Kruegel, G. Vigna, Detecting spammers on social networks, in: 26th Annual Computer Security Applications Conference, ACSAC '10, ACM, 2010, pp. 1-9. - source
- Not checked — no full text of the sourcecites Yang et al. [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“For this reason, we trained and evaluated the proposed Class A classifiers, which achieve overall good performances, while only exploiting cost-efficient features.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A claim is checked only against the cited paper’s full text, never its abstract, and none is available for its sources.
In the paper
“Overall, the results of this experiment show that, even reducing the features, it is possible to have a detection rate higher than 0.95 (as in the last lines of Table 13, for [8] and [2], respectively).”
What the sources say
- Not checked — no full text of the sourcecites Stringhini et al. [8] [8] G. Stringhini, C. Kruegel, G. Vigna, Detecting spammers on social networks, in: 26th Annual Computer Security Applications Conference, ACSAC '10, ACM, 2010, pp. 1-9. - source
- Not checked — no full text of the sourcecites Yang et al. [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Load-bearingStrength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“A further interesting observation is that both the classifiers employ a set of features that includes both features proposed by the grey literature for fake detection, which we introduced in Section 4, and by Academia for spam and bot detection, as detailed in Section 5.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“The results in Table 13 show an evident decrease in accuracy , precision and recall for the less pruned trees (subtree raising 0.25 and reduced error 3 folds), as well as for both F-Measure and AUC , and an even noticeable decrease of the MCC measure.”
What the sources say
- Not checked — no full text of the sourcecites Yang et al. [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It is worth noting that the Class A classifier with BN outperforms the Class C competitor, noticeably obtaining an increase in all the metrics, but the AUC .”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Such simpler trees generally use subsets of the feature set, still maintaining very good performance on our BAS dataset.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Concerning the complexity of the two decision trees obtained with the J48 algorithm, they are comparable, since both of them are composed by 31 nodes and 16 leaves and they have a height of 7.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Timeline-based ( Class B ) features have been shown to be less time-demanding, while still effective”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In the two validation experiments, AB and BN noticeably switch their performances: the Adaptive Boosting algorithm raises its accuracy of 0.1 and its precision of around 0.08, outperforming the Bayesian Network-based one.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: Fake followers bought from online markets are representative of fake Twitter followers in general.
- Rests on an assumption: The accounts labeled as human in the baseline dataset are genuine human accounts.
- Rests on an assumption: The test sets (random sampled accounts and sampled Obama followers) are representative of Twitter populations for validating fake follower detection.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Notably, none of the features is clearly dominant: all the 19 Class A features give a significant contribution to the detection of fake Twitter followers.”
Load-bearingStrength:boosted· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The SVM classifier, instead, proves to be extremely effective, being the second best classifier when validated against random sampled accounts, and still performing very well against sampled Obama followers.”
Strength:boosted· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: Fake followers bought from online markets are representative of fake Twitter followers in general.
- Rests on an assumption: The accounts labeled as human in the baseline dataset are genuine human accounts.
- Rests on an assumption: The test sets (random sampled accounts and sampled Obama followers) are representative of Twitter populations for validating fake follower detection.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“With this final outcome, we were able to achieve detection rates comparable with the best of breed classifiers, whereas these latter necessitate overhead-demanding features.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: Fake followers bought from online markets are representative of fake Twitter followers in general.
- Rests on an assumption: The accounts labeled as human in the baseline dataset are genuine human accounts.
- Rests on an assumption: The test sets (random sampled accounts and sampled Obama followers) are representative of Twitter populations for validating fake follower detection.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Indeed, while in Tables 12 and 16 almost all the considered classifiers achieved comparable performances, here we can see some major differences.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“AB and BN obtain lower results for both accuracy and precision, but still a noticeably high recall”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: Fake followers bought from online markets are representative of fake Twitter followers in general.
- Rests on an assumption: The accounts labeled as human in the baseline dataset are genuine human accounts.
- Rests on an assumption: The test sets (random sampled accounts and sampled Obama followers) are representative of Twitter populations for validating fake follower detection.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“However, relationships-based ( Class C ) features are more demanding in terms of data to be downloaded and, consequently, they require a significant analysis time, making them unsuitable for analyses on massive amounts of followers.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Observing the validation against the random sampled accounts, we can see that the five Class A classifiers obtain an accuracy above 0.9, a precision close to (when not much higher than) 0.9 and a recall above 0.94”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: Fake followers bought from online markets are representative of fake Twitter followers in general.
- Rests on an assumption: The accounts labeled as human in the baseline dataset are genuine human accounts.
- Rests on an assumption: The test sets (random sampled accounts and sampled Obama followers) are representative of Twitter populations for validating fake follower detection.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The RF, D, and J48 classifiers obtain results that are comparable for the two test sets, with an accuracy greater than 0.9 and a precision close to 0.87, with a reduction of only 0.025 on average.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: Fake followers bought from online markets are representative of fake Twitter followers in general.
- Rests on an assumption: The accounts labeled as human in the baseline dataset are genuine human accounts.
- Rests on an assumption: The test sets (random sampled accounts and sampled Obama followers) are representative of Twitter populations for validating fake follower detection.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We can finally observe that the AUC metric is always very high and that does not consistently reflect the real performances obtained by the five classifiers, as the F-measure and the MCC actually do.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: Fake followers bought from online markets are representative of fake Twitter followers in general.
- Rests on an assumption: The accounts labeled as human in the baseline dataset are genuine human accounts.
- Rests on an assumption: The test sets (random sampled accounts and sampled Obama followers) are representative of Twitter populations for validating fake follower detection.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Also the RF classifier looses 0.4 of accuracy and a considerable 0.1 in precision”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: Fake followers bought from online markets are representative of fake Twitter followers in general.
- Rests on an assumption: The accounts labeled as human in the baseline dataset are genuine human accounts.
- Rests on an assumption: The test sets (random sampled accounts and sampled Obama followers) are representative of Twitter populations for validating fake follower detection.
In the paper
“The results in [12], however, lack a validation phase.”
What the sources say
- Not matchedcites [12] [12] Camisani-Calzolari M. (digitalevaluations), Analysis of Twitter followers of the US Presidential Election candidates: Barack Obama and Mitt Romney (August 2012). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“Similarly, if the practice of buying fake followers is adopted by malicious accounts, as spammers, it can act as a way to post more authoritative messages and launch more effective advertising campaigns [6].”
What the sources say
- Not checked — no full text of the sourcecites [6] [6] C. Castillo, M. Mendoza, B. Poblete, Information credibility on Twitter, in: Proceedings of the 20th international conference on World Wide Web, ACM, 2011, pp. 675-684. - source
Strength:plain· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“To the best of our knowledge, however, despite fake followers constitute a widespread phenomenon with both economical and social impacts, in the literature the topic has not been deeply investigated yet.”
Strength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“However, such rules are usually paired neither with analytic algorithms to aggregate them, nor with validation mechanisms.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
None of the sources cited for this claim could be matched to a paper in Crossref, so there is nothing to check it against.
In the paper
“However, the criteria used for the analysis are not publicly disclosed and just partially deductible from information available on their web sites.”
What the sources say
- Not matchedcites [13] [13] Statuspeople.com, Status People Fakers, http://goo.gl/0Jpky, Last checked 23/07/15. -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Not matchedcites [14] [14] SocialBakers, Fake follower check, http://goo.gl/chWn0, Last checked 23/07/15. -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Not matchedcites [15] [15] Twitteraudit, How many of your followers are real?, www.twitteraudit.com, Last checked 23/07/15. -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Not matched
In the paper
“While the company website provides eight criteria to evaluate the fakeness degree of the followers of a certain account, it omits details on how to combine such criteria to classify the accounts.”
What the sources say
- Not matchedcites [14] [14] SocialBakers, Fake follower check, http://goo.gl/chWn0, Last checked 23/07/15. -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Actually, this happens because Pcc evaluates the linear dependency between two variables that assume very similar values, namely the output of the rule and the class, while the Pcc* considers variables with more heterogeneous values.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“Thus, we can derive that the rule is based on a right assumption (for example, the use of hashtags), but the rule definition is too simple to be effective: the algorithm proposed by [12] is simply too naive for the complex task of fake accounts detection in Twitter.”
What the sources say
- Not matchedcites [12] [12] Camisani-Calzolari M. (digitalevaluations), Analysis of Twitter followers of the US Presidential Election candidates: Barack Obama and Mitt Romney (August 2012). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Not matched
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We acknowledge that our fake followers dataset is just illustrative, and not exhaustive, of all the possible existing sets of fake followers.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Moreover, there are situations where some predictive models perform better than others, even having a lower accuracy [38].”
What the sources say
- Not checked yetcites [38] [38] D. M. W. Powers, Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation, International Journal of Machine Learning Technologies 2 (1) (2011) 37-63. -
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“In [12] it is detailed an algorithm to evaluate an account based on some of its public features. The cited algorithm has enough details to be reproducible: it assigns human/active and bot/inactive scores and classifies an account considering the gap between the sum of the two scores.”
What the sources say
- Not matchedcites [12] [12] Camisani-Calzolari M. (digitalevaluations), Analysis of Twitter followers of the US Presidential Election candidates: Barack Obama and Mitt Romney (August 2012). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This is because a single rule - or feature - alone may not perform well in classifying fake and human accounts, but it may improve the detection if used in combination with other ones.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. It may state two separate claims as one.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“We consider as 'certified humans' all the 469 accounts out of the 574 followers that successfully completed the CAPTCHA.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, MAUs can be assimilated neither to a random sample of Twitter accounts nor to the followers of a given account.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Furthermore, MCC is considered the unbiased version of the F-Measure , since it uses all the four elements of the confusion matrix [38].”
What the sources say
- Not checked yetcites [38] [38] D. M. W. Powers, Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation, International Journal of Machine Learning Technologies 2 (1) (2011) 37-63. -
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“This last set has been sampled (with confidence level 95% and confidence interval 2.5), leading to a final set of 1488 accounts, that have been subject to a manual verification to determine the nature of their profiles and tweets.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“The FakeFollowerCheck tool analyzes the followers of an account and considers them likely fake when the criteria listed in Table 4 are satisfied.”
What the sources say
- Not matchedcites [14] [14] SocialBakers, Fake follower check, http://goo.gl/chWn0, Last checked 23/07/15. -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
A claim is checked only against the cited paper’s full text, never its abstract, and none is available for its sources.
In the paper
“Both of them propose a list of features to be extracted from manually classified datasets of accounts.”
What the sources say
- Not checked — no full text of the sourcecites [8] [8] G. Stringhini, C. Kruegel, G. Vigna, Detecting spammers on social networks, in: 26th Annual Computer Security Applications Conference, ACSAC '10, ACM, 2010, pp. 1-9. - source
- Not checked — no full text of the sourcecites [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This means that the only way to check a user's follow/unfollow behavior (rule 7) is to continuously monitor full friends and followers complete lists. The same applies with respect to the measurement of the delay experienced when a user follows (and replies to) other users (rule 6).”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: Twitter only gives information about the current friends/followers list, with no details about past friends or followers, and does not disclose temporal data about when a user started following or got followed by another user.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“Only accounts labeled as humans by both the sociologists have been included in the E13 dataset.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
In the paper
“Camisani-Calzolari [12] carried out a series of tests over samples of Twitter followers of Romney and Obama, for the last US presidential elections, as well as for popular Italian politicians.”
What the sources say
- Not matchedcites [12] [12] Camisani-Calzolari M. (digitalevaluations), Analysis of Twitter followers of the US Presidential Election candidates: Barack Obama and Mitt Romney (August 2012). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“In 2013, the Twitter staff conjectured that the number of 'false or spam accounts should represent less than 5% of our MAUs' (where MAUs refer to monthly active users) [35].”
What the sources say
- Not matchedcites [35] [35] Twitter Inc., Twitter's IPO filing, http://www.sec.gov/Archives/edgar/data/1418091/000119312513390321/d564001ds1.htm, Last checked 23/07/15 (Oct 2013). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
A claim is checked only against the cited paper’s full text, never its abstract, and none is available for its sources.
In the paper
“Such feature sets are then used to train and test machine learning classifiers in order to distinguish between humans and spammers.”
What the sources say
- Not checked — no full text of the sourcecites [8] [8] G. Stringhini, C. Kruegel, G. Vigna, Detecting spammers on social networks, in: 26th Annual Computer Security Applications Conference, ACSAC '10, ACM, 2010, pp. 1-9. - source
- Not checked — no full text of the sourcecites [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
In the paper
“We have decided to include AB in our work, since it is considered one of the most effective machine learning algorithms for classification tasks [39].”
What the sources say
- Not checked yetcites [39] [39] J. Friedman, T. Hastie, R. Tibshirani, The elements of statistical learning, Vol. 1, Springer Series in Statistics, 2001. -
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“Without the original training set, we were unable to reproduce the same classifier, but we picked the five features and used them to train a set of classifiers with our BAS dataset.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“The study presented in [8] focuses on spambot detection.”
What the sources say
- Not checked — no full text of the sourcecites [8] [8] G. Stringhini, C. Kruegel, G. Vigna, Detecting spammers on social networks, in: 26th Annual Computer Security Applications Conference, ACSAC '10, ACM, 2010, pp. 1-9. - source
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“9. following rate : this metric reflects the speed at which an accounts follows other accounts. Spammers usually feature high values of this rate.”
What the sources say
- Not checked — no full text of the sourcecites [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“The authors of [2] observed that Twitter spammers often modify their behavior in order to evade existing spam detection techniques.”
What the sources say
- Not checked — no full text of the sourcecites [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“In 'glassbox' models, such as Decision Trees and Regression Models, the inner structure of the models can be understood by humans, also providing insights on how the classifiers identify fake accounts [39].”
What the sources say
- Not checked yetcites [39] [39] J. Friedman, T. Hastie, R. Tibshirani, The elements of statistical learning, Vol. 1, Springer Series in Statistics, 2001. -
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A claim is checked only against the cited paper’s full text, never its abstract, and none is available for its sources.
In the paper
“Even if the proposed features have been originally designed for spam detection, here, for the first time, we consider them to spot another category of Twitter accounts, i.e., the fake followers.”
What the sources say
- Not checked — no full text of the sourcecites [8] [8] G. Stringhini, C. Kruegel, G. Vigna, Detecting spammers on social networks, in: 26th Annual Computer Security Applications Conference, ACSAC '10, ACM, 2010, pp. 1-9. - source
- Not checked — no full text of the sourcecites [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“2. spambots have sent less than 20 tweets;”
What the sources say
- Not checked — no full text of the sourcecites [8] [8] G. Stringhini, C. Kruegel, G. Vigna, Detecting spammers on social networks, in: 26th Annual Computer Security Applications Conference, ACSAC '10, ACM, 2010, pp. 1-9. - source
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“3. the content of spambots' tweets exhibits the so-called message similarity ;”
What the sources say
- Not checked — no full text of the sourcecites [8] [8] G. Stringhini, C. Kruegel, G. Vigna, Detecting spammers on social networks, in: 26th Annual Computer Security Applications Conference, ACSAC '10, ACM, 2010, pp. 1-9. - source
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Instead, here we evaluate how those features, which proved to be quite robust against evasion techniques adopted by spammers, perform in detecting fake Twitter followers.”
What the sources say
- Not checked — no full text of the sourcecites [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
In the paper
“Then, we have used a 10-fold cross validation [23] to estimate the performances of each obtained classifier.”
What the sources say
- Not checked yetcites [23] [23] M. Hall, I. Witten, E. Frank, Data Mining: Practical Machine Learning Tools and Techniques, 3rd Edition, Morgan Kaufmann, 2011. -
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Beyond the features directly available from the account profile lookup, the authors propose some graph-, automation-, and timing-based features.”
What the sources say
- Not checked — no full text of the sourcecites [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“4. spambots have a high tweets containing URLs ratio ( URL ratio );”
What the sources say
- Not checked — no full text of the sourcecites [8] [8] G. Stringhini, C. Kruegel, G. Vigna, Detecting spammers on social networks, in: 26th Annual Computer Security Applications Conference, ACSAC '10, ACM, 2010, pp. 1-9. - source
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A claim is checked only against the cited paper’s full text, never its abstract, and none is available for its sources.
In the paper
“1. age of the account (this feature also appears in [28]): the more an account is aged, the more it could be considered a good one;”
What the sources say
- Not checked — no full text of the sourcecites [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
- Not checked — no full text of the sourcecites [28] [28] K. Lee, J. Caverlee, S. Webb, Uncovering social spammers: social honeypots + machine learning, in: SIGIR Conference on Research and Development in Information Retrieval, ACM, 2010, pp. 435-442. - source
Strength:hedged· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“total tweets 5. spambots have a high friends ( followersˆ2 ) ratio value (i.e., lower ratio values mean legitimate users).”
What the sources say
- Not checked — no full text of the sourcecites [8] [8] G. Stringhini, C. Kruegel, G. Vigna, Detecting spammers on social networks, in: 26th Annual Computer Security Applications Conference, ACSAC '10, ACM, 2010, pp. 1-9. - source
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“Thus, they suggested to consider some new features, making evasion more difficult for spammers.”
What the sources say
- Not checked — no full text of the sourcecites [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Strength:hedged· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“However, as claimed by the same authors, they are less robust with regards to evasion techniques and thus we decided not to include them in our evaluation.”
What the sources say
- Not checked — no full text of the sourcecites [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In other words, to get the total time, one should not consider the sum of the time needed for each of the three cost classes, but just the most costly one.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Rests on an assumption: Twitter limits the number of calls of the same API, but different APIs can be called in parallel.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The total time required to collect all data depends on the category that requires more time, i.e., the relationship one.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Rests on an assumption: Twitter limits the number of calls of the same API, but different APIs can be called in parallel.
In the paper
“A similar behavior has been observed for the average neighbor's tweets feature, that has been found to be lower for spammers in [2], but higher for our fake followers.”
What the sources say
- Not checked — no full text of the sourcecites [2] [2] C. Yang, R. Harkreader, G. Gu, Empirical evaluation and new design for fighting evolving Twitter spammers, Information Forensics and Security, IEEE Transactions on 8 (8) (2013) 1280-1293. - source
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“These initial observations highlight a behavioral difference between a spam account and a fake follower. In particular, fake followers appear to be more passive compared to spammers and they do not make use of automated mechanisms for posting their tweets, as spammers usually do.”
Strength:hedged· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: The labels in the BAS dataset (human vs fake follower) are accurate.
- Rests on an assumption: The features from [2] and [8] are correctly implemented and computed.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“a classifier that uses a certain feature set belongs to the class of the more expensive feature.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“By capturing the nature of the social ties between an account and its neighbors, this feature is intrinsically harder to beat than those based on simpler characteristics, like, e.g., other information in the account's profile.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“This represents an unbiased sample of all the currently available (i.e., not closed, banned or suspended) Twitter accounts.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“we can consider the use of the most expensive Class B or even Class C features to have stronger evidences about the more suspicious followers.”
Strength:plain· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“From the results shown in Table 13, we conclude that the bidirectional link ratio is an important feature for fake follower detection: even if not essential, it is extremely effective for the detection process.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This experiment resembles the practical application scenario of the proposed classifier, since it investigates a sample of a single account's followers, in this case a major politician.”
Strength:plain· not yet calibratedSingle caseTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Information fusion is a technique aimed at leveraging the predictive power of several different models in order to achieve a combined prediction accuracy which is better than the predictions of the single models [47].”
What the sources say
- Not checked — no full text of the sourcecites [47] [47] C. W. Chase Jr, Composite forecasting: combining forecasts for improved accuracy, Journal of Business Forecasting Methods & Systems 19 (2) (2000) 2. -
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Automatically labeling the sampled accounts as humans would result in an error of at most 5%, still allowing an overall correct validation of our classifiers.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“meaning that only few fake followers are left behind, but a considerably higher number of human accounts are classified as fake followers”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: Fake followers bought from online markets are representative of fake Twitter followers in general.
- Rests on an assumption: The test sets (random sampled accounts and sampled Obama followers) are representative of Twitter populations for validating fake follower detection.
The authors state this as an assumption.
A balanced distribution of fake followers and human followers is appropriate as the baseline dataset.
“This is why we made a conservative assumption, considering a balanced distribution of fake followers and human followers as our baseline dataset.”
The paper relies on this without support.
Twitter only gives information about the current friends/followers list, with no details about past friends or followers, and does not disclose temporal data about when a user started following or got followed by another user.
“For rules 6 and 7, when looking for an account's friends or followers list, Twitter only gives information about the current list, with no details about past friends or followers. Moreover, Twitter does not disclose any temporal data related to the moment a user stared following, or got followed by, another user.”
The paper relies on this without support.
The labels in the BAS dataset (human vs fake follower) are accurate.
“we have trained the models using our baseline ( BAS ) dataset.”
The paper relies on this without support.
The features from [2] and [8] are correctly implemented and computed.
“We have built 8 classifiers adopting the features in Sections 5.1 and 5.2”
The authors state this as an assumption.
The approximation of the following rate with the ratio friends/age is adequate.
“As in [2], the following rate (feature 9) has been approximated with the ratio friends/age , since a precise evaluation would require to know the evolution of the number of friends of an account, but this is, indeed, publicly unavailable.”
The paper relies on this without support.
Computational costs can be generally lowered with optimized algorithms and data representations and are negligible when compared to crawling costs.
“Computational costs can be generally lowered with optimized algorithms and data representations and they are negligible when compared to the crawling costs.”
The paper relies on this without support.
Twitter API allows fetching at most 100 accounts, 200 tweets, and 5000 friends/followers per single API request.
“The number of API calls for each category depends on the maximum number of accounts (100), tweets (200) and friends/followers (5000) that can be fetched from Twitter with a single API request.”
The paper relies on this without support.
Twitter API rate limits are 12 calls per minute for profile and timeline data and 1 call per minute for relationship data.
“| Calls/min. | 12 | 12 | 1 |”
The paper relies on this without support.
A user timeline is limited to 3200 accessible tweets, leading to a maximum of 16 API calls per follower.
“since the number of tweets that can be accessed from a user timeline is limited to 3200, leading to a maximum of 16 calls for each follower.”
The paper relies on this without support.
At the time of writing, the Twitter account with the highest number of followers belonged to Katy Perry (@katyperry) and had about 60 million followers.
“belongs to the pop star Katy Perry ( @katyperry ), with about 60 millions of followers.”
The paper relies on this without support.
The number of friends and followers on Twitter is not limited.
“The number of friends and followers, instead, is not limited and, therefore, it is impossible to calculate a worst-case scenario for the relationship category.”
The paper relies on this without support.
Twitter limits the number of calls of the same API, but different APIs can be called in parallel.
“Twitter limits the number of calls of the same API, but different APIs can be called in parallel.”
The paper relies on this without support.
Data collected for a category can be used to evaluate all the features of that category.
“Firstly, data collected for a category can be used to evaluate all the features of that category.”
The paper relies on this without support.
Fake followers bought from online markets are representative of fake Twitter followers in general.
“the latter being bought from available online markets”
“the 1401 fake followers we bought”
The paper relies on this without support.
The accounts labeled as human in the baseline dataset are genuine human accounts.
“baseline dataset of verified human and fake follower accounts”
The paper relies on this without support.
Glass-box classifiers produce interpretable models and their inner structure allows insights into the mechanisms exploited to perform detection.
“So-called 'glass-box' classifiers produce interpretable models and an analysis of their inner structure allows to get insights into the mechanisms exploited to perform the detection.”
The paper relies on this without support.
Black-box classifiers have been recently employed in a broad range of diverse classification tasks, achieving excellent results.
“Nonetheless, 'black-box' classifiers have been recently employed in a broad range of diverse classification tasks, achieving excellent results.”
The paper relies on this without support.
The test sets (random sampled accounts and sampled Obama followers) are representative of Twitter populations for validating fake follower detection.
“Class A validation on a test set of random sampled accounts”
“Class A validation on a test set of random sampled Obama followers”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“For example, Cresci et al. developed a set of supervised machine learning classifiers for detecting so-called fake followers, a type of automated accounts commonly used to artificially boost the popularity of the public characters that buy them [4].”
From A decade of social bot detection (2020) · cites this paper as [4]
In the citing paper
“These results are backed by the same platforms where information operations took place - namely, Facebook 2 , Twitter 3 and Reddit 4 - that banned tens of thousands accounts involved in coordinated activities since 2016.”
From A decade of social bot detection (2020) · cites this paper as [4]
In the citing paper
“However, although achieving an overall good performance for the considered spambots, the approach in [9] might lack reusability across other groups of spambots with different behaviors, such as those perpetrating a follower fraud [5],[11].”
From DNA-Inspired Online Behavioral Modeling and Its Application to Spambot Detection (2016) · cites this paper as [11]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
The 5% estimate changes from active users to all registered accounts
MajorThe paper first says the less-than-5% estimate concerns monthly active users and cannot be applied to a random sample of accounts or an account's followers. It later describes the same estimate as applying to all registered accounts and uses it to justify labeling both validation samples as human.
“Twitter officially reports that fake and spam profiles together are less than 5% of all registered accounts [35], therefore we are confident that just a few among the accounts labeled as humans might actually be fake ones.”
“In 2013, the Twitter staff conjectured that the number of 'false or spam accounts should represent less than 5% of our MAUs' (where MAUs refer to monthly active users) [35]. However, MAUs can be assimilated neither to a random sample of Twitter accounts nor to the followers of a given account.”
RF validation accuracy drop is overstated
MinorThe RF accuracy falls from 0.975 on randomly sampled accounts to 0.929 on sampled Obama followers-a drop of 0.046, not 0.4.
Reported 0.4 · recomputed 0.046
“Also the RF classifier looses 0.4 of accuracy and a considerable 0.1 in precision”
Table 18 attributes a Camisani-Calzolari rule to a different source
MinorTable 18 attributes the '2 × followers ≥ friends' feature to [11], while Table 14 lists it under Camisani-Calzolari [12].
“| 14 | 2 × followers ≥ friends | [11] | 0.721 |”
“| Camisani-Calzolari [12] | has name, has image, has address, has biography, followers ≥ 30, belongs to a list, tweets ≥ 50, URL in profile, 2 × followers ≥ friends”
Accuracy stated for the no-bi-link tree differs from Table 13
MinorThe three stated accuracies refer to the trees without the bi-link ratio. For the reduced-error, three-fold tree, Table 13 reports 0.961 rather than the stated second value, 0.982.
“Its detection level ( accuracy ) is still very good for all the three pruned trees (0.964, 0.982 and 0.933, respectively)”
“| 53 | 27 | 8 | 0.961”
FAK is incorrectly identified as all purchased fake accounts
MinorFAK is defined as an undersample of 1950 accounts from the 3351 purchased fake accounts. The description of Table 6 instead calls the FAK set all the purchased fake accounts.
“Table 6 details the results of running the algorithm over the complete dataset, including the FAK set, namely all the bought fake followers accounts.”
“To obtain a balanced dataset, we randomly undersampled the total set of fake accounts (i.e., 3351) to match the size of the HUM dataset of verified human accounts. Thus, we built a baseline dataset of 1950 fake followers, labeled FAK .”
Citations
Cites
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918 · cited 1×
“Our SVM classifier exploits a Radial Basis Function (RBF) kernel and has been trained using libSVM as the machine learning algorithm [44].”
MethodData Mining: Practical Machine Learning Tools and Techniques
Witten, I. H., Frank, E., & Hall, M. A. (2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,537
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
The WEKA data mining software: an update
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1656274.1656278 · Cited by 17,750 · cited 3×
“, by using the reduce-error pruning with small test sets [23, 43].”
MethodLibsvm : A library for support vector machines
Ferrari, V. (2008) · Medical Entomology and Zoology · Cited by 10,123
Witten, I. H. (2008) · Cited by 9,143
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 8,354
Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation
Powers, D. M. W. (2020) · arXiv · doi:10.48550/arxiv.2010.16061 · Cited by 5,440
Mathematical Statistics and Data Analysis
Rabinowitz, L., & Rice, J. A. (1989) · Technometrics · doi:10.2307/3556160 · Cited by 3,142
Measuring user influence in twitter: The million follower fallacy
Cha, M., Haddadi, H., Benevenuto, F., & Gummadi, K. (2010) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v4i1.14033 · Cited by 3,022 · cited 1×
“However, artificially inflating the number of followers can also be finalized to make an account more trustworthy and influential, in order to stand from the crowd and to attract other genuine followers [5].”
Background
Flagged first, then by citations
14 of the 67 references couldn’t be matched to a known paper.
Research works printed but not linked: 1
- Kohavi, 1998, Glossary of terms, Machine Learning, 30, 271
Cited by
Sorted by citations
Items 301–400 of 459
He, H., Yang, H., Burckhardt, P., Kapravelos, A., Vasilescu, B., & Kästner, C. (2026) · Proceedings of the 2026 IEEE/ACM 48th International Conference on Software Engineering · doi:10.1145/3744916.3764531 · Cited by 28
“While honeypots are often used in prior research (e.g., [38, 40, 43]), they raise ethical concerns [61, 91]: If we were to buy fake stars for a honeypot repository, we would be effectively funding malicious actors and creating spam for other developers.”
DMIBot: Dynamic Multimodal Interaction for Twitter Bot Detection
Lin, X., Wu, Q., & Huang, Y. (2025) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49660.2025.10889631 · Cited by 3
“A. Experiment Settings a) Datasets: This study employs two datasets: Cresci-15 [21] and Twibot-20 [22].”
Liu, F., & Ma, R. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.113712 · Cited by 4
Demystifying Misconceptions in Social Bots Research
Cresci, S., Yang, K.-C., Spognardi, A., Pietro, R. D., Menczer, F., & Petrocchi, M. (2025) · Social Science Computer Review · doi:10.1177/08944393251376707 · Cited by 30
“Consider, for example, the differences between the bots used to boost the popularity of certain public figures—so-called fake followers (Cresci et al., 2015)—and those that manipulate trending topics—astroturfers and spammers (Abokhodair et al., 2015).”
Self-citationProactive Bot Detection Based on Structural Information Principles
Zeng, X., Peng, H., & Li, A. (2025) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2025.3646644 · Cited by 4
Detecting Automatically Generated Tweets Using Lexical Analysis and Profile Credibility
Wickramarathna, N. C., & Ganegoda, G. U. (2019) · International Conference on Information Technology Research (ICITR) · doi:10.1109/icitr49409.2019.9407800 · Cited by 2
“A fake account is considered also as deception in content and personal information in the profile [19].”
BackgroundSurvey on Novelty Detection using Machine Learning Techniques
Ouafae, B., Oumaima, L., Mariam, R., & Lyhyaoui, A. (2021) · Advances in Science Technology and Engineering Systems Journal · doi:10.25046/aj060510 · Cited by 2
Kats, D., & Sharif, M. (2022) · International Conference on Human-Agent Interaction (HAI) · doi:10.1145/3527188.3561928 · Cited by 3
“influence on OSNs via “fake followers” [15], influencing people’s opinions and increasing polarization [53], spreading malware and disinformation [20, 33], and participating in spam and phishing [60].”
BackgroundFake Twitter Followers Detection using Machine Learning Approach
Shabbir, M. Z., Naseer, I., Akhter, S., Abubakar, M., Issa, G. F., & Mehmood, M. H. (2023) · International Conference on Business Analytics for Technology and Security (ICBATS) · doi:10.1109/icbats57792.2023.10111260 · Cited by 2
“[22] used a supervised learning approach to detect Twitter bot accounts.”
MethodDetecting Malicious Users on Twitter Using Topic Modeling
Swe, M. M., & Myo, N. N. (2023) · IEEE Conference on Computer Applications (ICCA) · doi:10.1109/icca51723.2023.10181604 · Cited by 2
“This data was created by Cresci et al (2012) [17] between Jan 2013 and Feb 2013.”
MethodPlatformization: The Dangers of the Artificial Public Sphere
Marzá, D. G., & Calvo, P. (2024) · Philosophy and politics · doi:10.1007/978-3-031-53015-9_5 · Cited by 2
Social bot detection on Twitter: robustness evaluation and improvement
Liu, A.-A., Xie, Y., Wang, L., Jin, G., Guo, J., & Li, J. (2024) · Multimedia Systems · doi:10.1007/s00530-024-01364-2 · Cited by 2
“We use two widely used datasets in social bot detection models [40, 41].”
Coarse-to-fine label propagation with hybrid representation for deep semi-supervised bot detection
Peng, H., Zhang, Y., Bai, X., & Dai, Q. (2024) · Wireless Networks · doi:10.1007/s11276-024-03821-2 · Cited by 3
Sallah, A., Alaoui, E. A. A., Hessane, A., Agoujil, S., & Nayyar, A. (2024) · Neural Computing and Applications · doi:10.1007/s00521-024-10350-8 · Cited by 3
Efficient Detection of Fake Twitter Profiles on Social Media Through Hybrid Deep Learning Model
Bibi, H., Ashraf, H., & Jhanjhi, N. Z. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-97-8090-7_17 · Cited by 2
How to use Graph Data in the Wild to Help Graph Anomaly Detection?
Cao, Y., Xu, J., Zhao, C., et al. (2025) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3690624.3709320 · Cited by 2
G-CutMix: A CutMix-based graph data augmentation method for bot detection in social networks
Li, Y., Shi, S., Guo, X., Zhou, C., & Hu, Q. (2025) · PLoS ONE · doi:10.1371/journal.pone.0331978 · Cited by 3
“For the Cresci-15 [20], Twibot-20 [21], and MGTAB [22] datasets, we utilize followers and friends user relationships, respectively.”
MTD-Spamguard: a moving target defense-based spammer detection system in social network
Park, J. H., Rathore, S., Moon, D., & Park, J. H. (2017) · Soft Computing · doi:10.1007/s00500-017-2976-x · Cited by 2
“In classifying a user on SNS, supervised machine learning classifiers are known to achieve better classification results (Rathore et al. 2017; Ahmed and Abulaish 2013; Cresci et al. 2015; Bhat et al. 2014).”
BackgroundMethodInfluentialTwitter User Recommendation for Gaining Followers
Corcoglioniti, F., Nechaev, Y., Giuliano, C., et al. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-03840-3_40 · Cited by 2
Identity deception detection: requirements and a model
van der Walt, E., & Eloff, J. H. P. (2019) · Information and Computer Security · doi:10.1108/ics-01-2019-0017 · Cited by 2
Twitter Bots and the Swedish Election
Fernquist, J., Kaati, L., Schroeder, R., Akrami, N., & Cohen, K. (2020) · Lecture notes in social networks · doi:10.1007/978-3-030-41251-7_6 · Cited by 2
Implementation of Ensemble-Based Prediction Model for Detecting Sybil Accounts in an OSN
Roy, P., & Sood, M. (2020) · Advances in intelligent systems and computing · doi:10.1007/978-981-15-5148-2_62 · Cited by 2
Assessment of Malicious Tweets Impact on Stock Market Prices
Ishikawa, T., Sassi, I. B., & Yahia, S. B. (2021) · Lecture notes in business information processing · doi:10.1007/978-3-030-75018-3_22 · Cited by 2
Ensuring the Inclusive Use of NLP in the Global Response to COVID-19
Luccioni, A. S., Pham, K. H., Lam, C. S. N., Aylett-Bullock, J., & Luengo-Oroz, M. A. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-93733-1_18 · Cited by 2
Layered Malicious Nodes Detection with Graph Attention Network in Human-Cyber-Physical Networks
Lin, Y., Huang, Y., Hsieh, S., Lin, L., & Xia, F. (2022) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mass56207.2022.00079 · Cited by 3
“The dataset we used is made public by Cresci in 2015 [30], called Cresci-2015, and we modified it somewhat in order to study the influence of graph structure in our method.”
MethodWayPop Machine: A Wayback Machine to Investigate Popularity and Root Out Trolls
Elmas, T., Ibanez, T. R., Hutter, A., Overdorf, R., & Aberer, K. (2022) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam55673.2022.10068665 · Cited by 2
“To do so, they can author viral tweets that attract public attention or use malicious strategies such as buying retweets [2] or followers [3].”
BackgroundAn Analysis of Graph Properties for Detecting Sybil Nodes in Social Networks
Kaewking, K., & Boonkrong, S. (2018) · Journal of ICT Research and Applications · doi:10.5614/itbj.ict.res.appl.2018.12.2.6 · Cited by 3
“(3), comparing an honest graph and a Sybil graph using data sets from [7], as shown in Table 1.”
MethodTrusted Follower Factors That Influence Purchase Intention In Social Commerce
Hairudin, H., Dahlan, H. M., & Selamat, M. H. (2019) · International Conference on Research and Innovation in Information Systems · doi:10.1109/icriis48246.2019.9073627 · Cited by 2
Performance Analysis of the ML Prediction Models for the Detection of Sybil Accounts in an OSN
Kumari, A., & Sood, M. (2020) · Advances in intelligent systems and computing · doi:10.1007/978-981-15-5148-2_60 · Cited by 2
DECIFE: Detecting Collusive Users Involved in Blackmarket Following Services on Twitter
Dutta, H. S., Aggarwal, K., & Chakraborty, T. (2024) · Figshare · Cited by 2
Performance Examination and Feature Selection on Sybil User Data using Recursive Feature Elimination
(2019) · International Journal of Innovative Technology and Exploring Engineering · doi:10.35940/ijitee.i1108.0789s419 · Cited by 2
Analysis of Malicious Behavior on Social Media Platforms Using Agent-Based Modeling
Onuchowska, A. (2020) · Digital Commons - University of South Florida (University of South Florida) · Cited by 2
Unmasking Social Robots’ Camouflage: A GNN-Random Forest Framework for Enhanced Detection
Fan, W., Wang, C., Xiao, H., & Lin, C. (2024) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2024.056930 · Cited by 2
The Influence of SNS Majority Users
Matsui, A. (2021) · Quarterly Journal of Marketing · doi:10.7222/marketing.2021.008 · Cited by 1
Mylabattula, S. (2023) · International Journal for Research in Applied Science and Engineering Technology · doi:10.22214/ijraset.2023.54970 · Cited by 1
A Multi-Modal Approach for the Detection of Account Anonymity on Social Media Platforms
Wang, B., Guo, J., Huang, Z., & Qiu, W. (2023) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn54540.2023.10191222 · Cited by 1
Forecasting Political News Engagement on Social Media
Shivaram, K., Bilgic, M., Shapiro, M., & Culotta, A. (2024) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v18i1.31401 · Cited by 2
Comparison of Various Data Mining Techniques for Fake Profile Detection on Twitter
Gupta, S., & Saurabh, S. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-80842-5_12 · Cited by 1
Identifying Bots on Social Media through Coordinated Group Perception
Qiao, B., Li, K., Zhou, W., Li, S., Lü, Q., & Hu, S. (2025) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49660.2025.10889669 · Cited by 1
Adaptive Social Bot Detection through Bridging the Feature Bias Between Source and Target Users
Sun, H., Peng, H., Cao, Y., Dai, Q., & Bai, X. (2025) · International Conference on Multimedia Retrieval · doi:10.1145/3731715.3733268 · Cited by 2
Source attribution and detection strategies for AI-era journalism
Luttrell, R. M., Davis, J., & Welch, C. (2025) · Telecommunications Policy · doi:10.1016/j.telpol.2025.103053 · Cited by 4
Node Injection-Based Adversarial Attack and Defense on Social Bot Detection
Xie, Y., Nie, W., Wang, L., Qiao, X., Zhang, S., & Liu, A.-A. (2025) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2025.3599730 · Cited by 1
“A. Experimental Settings 1) Datasets: Since our method relies on social graph structures, we utilize two datasets of different sizes, Cresci-2015 [52] and TwiBot-22 [53], both of which include social graph information and neighbor attributes.”
Advanced text-based transformer architecture for malicious social bots detection
Ellaky, Z., & Benabbou, F. (2025) · Mathematical Modeling and Computing · doi:10.23939/mmc2025.03.972 · Cited by 1
A Community-Aware Spatio-Temporal Hypergraph Contrastive Learning Method for Social Bot Detection
Liu, F., Li, Z., & Ma, R. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3637684 · Cited by 1
“Cresci et al. [41] To ensure labeling quality, the dataset was constructed using a weak supervision framework: 1,000 accounts were manually annotated by five domain experts, Algorithm 1 BotSTHCL while 8 handcrafted labeling functions and 7 baseline detection models were employed to generate weak…”
InfluentialHCGBot: Learning Homophilous Context Graphs for Twitter Bot Detection
Wan, H., Luo, M., Wang, J., et al. (2026) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2026.3656720 · Cited by 1
Shevtsov, A., Antonakaki, D., Lamprou, I., Pratikakis, P., & Ioannidis, S. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-13821-7_2 · Cited by 4
“To simplify, we have labeled the selected datasets as follows: TwiBot-22 (Feng et al. 2022b).”
MethodBuilding Reference Datasets to Support Socialbots Detection
Pacheco, C. C., Garcia, A. D. V., Machado, R., & Salles, R. M. (2018) · IEEE International Workshop on Metrology for Industry 4.0 & IoT (MetroInd4.0&IoT) · doi:10.1109/metroi4.2018.8428331 · Cited by 1
Detection of Twitter Bots using DNA-based Entropy Technique
Gilmary, R., Akila, V., Praveen, M. B., Prasath, H. R., & Vaiyapuri, G. (2022) · International Conference on Electrical, Electronics, Information and Communication Technologies (ICEEICT) · doi:10.1109/iceeict53079.2022.9768516 · Cited by 1
Straus, J. R. (2022) · Transforming Government People Process and Policy · doi:10.1108/tg-10-2021-0165 · Cited by 1
Shavnam, & Sood, M. (2023) · Lecture notes in networks and systems · doi:10.1007/978-981-19-7615-5_47 · Cited by 1
False Detection for Online Reviews by Using Deep Neural Network
Libina, M., & Logesh, D. (2023) · International Conference on Science Technology Engineering and Mathematics (ICONSTEM) · doi:10.1109/iconstem56934.2023.10142855 · Cited by 1
Fake Profile Detection Using Image Processing and Machine Learning
Sen, S., Islam, M. I., Azim, S. S., et al. (2023) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-031-34619-4_24 · Cited by 1
Social Media Fake Profile Classification: A New Machine Learning Approach
Kadam, N., & Sharma, S. K. (2023) · Lecture notes in networks and systems · doi:10.1007/978-981-99-0981-0_62 · Cited by 1
Entropy-Based Automation Detection on Twitter Using DNA Profiling
Gilmary, R., & Venkatesan, A. (2023) · SN Computer Science · doi:10.1007/s42979-023-02324-9 · Cited by 1
“Also, the bot detection techniques must take feasibility into account by the evaluating cost of performance, reliability and expected scale of real-world application [27].”
BackgroundInfluentialAdvanced Machine Learning Model to Detect Spam on Instagram
Singh, M. (2023) · IEEE International Conference on Blockchain and Distributed Systems Security (ICBDS) · doi:10.1109/icbds58040.2023.10346308 · Cited by 1
“[5].”
BotScout: A Social Bot Detection Algorithm Based on Semantics, Attributes and Neighborhoods
Lin, H., Chen, N., Chen, Y., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-5581-3_28 · Cited by 1
Detecting Camouflaged Social Bots Through Multi-level Aggregation and Information Encoding
Wang, Z., & Zhao, K. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-7241-4_25 · Cited by 1
Using Coloured Acyclic Nets to Detect Fake Accounts on Social Media
Alshammari, T. (2024) · International Conference on Computer, Software and Modeling (ICCSM) · doi:10.1109/iccsm63823.2024.00013 · Cited by 1
“In this study, we secured access to the MIB dataset [1] and analysed a total of 5301 user accounts, including 1950 genuine accounts distributed across two distinct groupings and 3351 fake accounts.”
MethodNeighborhood Difference-Enhanced Graph Neural Network Based on Hypergraph for Social Bot Detection
Shi, S., Yan, L., Liu, Z., Chen, C., Chen, J., & Yan, B. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-8490-5_6 · Cited by 1
Weibo-FA: A Benchmark Dataset for Fake Account Detection in Weibo Platform
Li, Z., Fang, W., & Zhang, W. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0576-7_13 · Cited by 1
Machine Learning for Detecting Fake Accounts in OSNs: A Review
Sallah, A., Sahlaoui, H., Errousso, H., Alaoui, E. A. A., & Agoujil, S. (2025) · Lecture notes in networks and systems · doi:10.1007/978-3-031-88304-0_32 · Cited by 1
How “VKontakte” Fake Accounts Influence the Social Network of Users
Kaveeva, A., Евгеньевич, Г. К., & Solovyev, V. D. (2018) · Communications in computer and information science · doi:10.1007/978-3-030-02843-5_41 · Cited by 3
Valliyammai, C., & Kiliroor, C. C. (2020) · Wireless Personal Communications · doi:10.1007/s11277-020-07228-y · Cited by 1
“The fake twitter followers were identified in two ways, based on classification rules, and feature sets [9].”
MethodUm Modelo Baseado em Regras para a Detecção de bots no Twitter
Leite, M. A. G. L., Guelpeli, M. V. C., & Santos, C. Q. (2020) · doi:10.5753/brasnam.2020.11161 · Cited by 1
“Os atributos destacados pelos modelos não aparecem na lista dos principais atributos de detecção de bots, apontadas por [Cresci et al. 2015], que testaram, em uma versão anterior à mesma base de dados utilizada neste estudo, várias técnicas de classificação em diferentes conjunto de…”
BackgroundFOSTERING STUDENTS’ EXPERIENCES IN ENGLISH WRITING WITH MICROBLOGGING IN TWITTER
Hien, P. T. T. (2019) · ENGLISH JOURNAL · doi:10.32832/english.v13i2.3783 · Cited by 1
FollowAKOInvestor: Using Machine Learning to Hear Voices from All Kinds of Investors
Chang, J., Ding, Y., & Tu, W. (2020) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai50040.2020.00137 · Cited by 2
“However, previous studies have found that there are many low-quality opinions posted by non-experts or by malicious users [4, 5].”
BackgroundAdvertising and Spams: How to Recognize the Lie and Reality in Social Media
Sachdeva, N., Sharma, A. K., & Sharma, S. B. (2021) · Studies in autonomic, data-driven and industrial computing · doi:10.1007/978-981-15-9873-9_16 · Cited by 1
Detecting Fake Users on Social Media with a Graph Database
Zhao, Y., & Weber, J. H. (2021) · The Arbutus Review · doi:10.18357/tar121202120027 · Cited by 1
“Cresci et al. (2015) have used the random forest classifier and features including number of friends, number of tweets, content of tweets, and relation between number of friends and followers to detect fake users.”
MethodWeakening the Inner Strength: Spotting Core Collusive Users in YouTube Blackmarket Network
Dutta, H. S., Diwan, N., & Chakraborty, T. (2022) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v16i1.19280 · Cited by 1
“Several efforts have been made to detect fake activities in different online social networks (Cresci et al. 2015; Castellini, Poggioni, and Sorbi 2017).”
BackgroundRelevance-Aware Anomalous Users Detection in Social Network via Graph Neural NetworkPreprint
Li, Y., Ji, Y., Li, S., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.06095 · Cited by 1
“The basic Bayesian classification with user characteristics [34] and machine learning methods [35] have proven efficient for zombie users detection.”
MethodAnalyzing time series activity of Twitter political spambotsPreprint
Fontanelli, Ó., Venegas, A., & Mansilla, R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.12734 · Cited by 1
“Supervised classification We selected two groups of features: those regarding time interval distribution (temporal features) and a list of characteristics that are typically used to identify Twitter bots (non temporal features) [4, 7, 10, 15, 21].”
BackgroundMethodEnsuring the Inclusive Use of Natural Language Processing in the Global Response to COVID-19Preprint
Luccioni, A. S., Pham, K. H., Lam, C. S. N., Aylett-Bullock, J., & Luengo-Oroz, M. A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.10791 · Cited by 1
“‘liking’ a post can be driven by many different motives and emotions) as well as the commercialization of fake followers and metrics [3, 9].”
BackgroundBots on Social Media: The Past, Present and Future
Rossi, S. (2024) · doi:10.22439/phd.19.2024 · Cited by 2
BotFlowMon: Identify Social Bot Traffic with NetFlow and Machine Learning
Feng, Y. (2018) · Scholars' Bank (University of Oregon) · doi:10.13140/rg.2.2.12240.87048
Feature Selection Optimization Using Genetic Algorithm for Spambot Detection in an OSN
Singh, A., & Sood, M. (2020) · Communications in computer and information science · doi:10.1007/978-981-15-4451-4_26
Soziale Medien zwischen Disruption und Synthese
Verständig, D. (2020) · Ars digitalis · doi:10.1007/978-3-658-30702-8_2
Prioritizing Original News on FacebookPreprint
Ni, X., Bu, S., & Markov, I. L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.08465
“Context indicators in the other group require analysis of external sources, such as author reputation and/or recognition by peers in terms of the PageRank algorithm, as in [3, 4].”
BackgroundFEATURE BASED ANALYSIS ON THE DUPLICATE FAKE ACCOUNT ON TWITTER USING INTELLIGENT MECHANISM
Alhariri, M. A. (2021) · INFORMATION TECHNOLOGY IN INDUSTRY · doi:10.17762/itii.v9i1.272
“Machine learning is evolving diverse nature tasks due to its abilities to handle complex task [5].”
BackgroundComprehensive Analysis of Two Malicious Arabic-Language Twitter Campaigns
Alharthi, R. M., Alhothali, A., & Moria, K. M. (2021) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2021.0120493
“For instance, a study [14] proposed examining the social graph between users and pages to reveal Fake-Likes campaigns on Facebook, and several studies have used the synchronized behavior and timing of social spammers’ fraud activities, fake Twitter followers, and malicious retweeter groups to expose their accounts on…”
BackgroundA Multi-agent Approach for Online Twitter Bot Detection
Abreu, J. V. F., Ralha, C. G., & Gondim, J. J. C. (2021) · Colección Jornadas y congresos · doi:10.18239/jornadas_2021.34.03
Spatial Dissemination of Trends Along with Resolution of Multifaceted EntitiesPreprint
Chhabra, M., Garg, S., Goyal, H., & Jain, S. (2018) · SSRN Electronic Journal · doi:10.2139/ssrn.3166092
Detecting Bots Using a Hybrid Approach
Genfi, E. K. (2021)
Performance Analysis of Machine Learning Algorithms in SMP: A Case Study of Twitter
Varsha, S., Prathiba, P., Deepika, N., Janghel, N., & Ashoka, D. V. (2019) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.3268438
Detecção de Bots Sociais: Uma Discussão sobre o Tempo de Vida de Abordagens Tradicionais
da Mata, E. N., Dias, G. M. D. S., & Salles, R. M. (2021) · Simpósio Brasileiro de Cibersegurança (SBSeg) · doi:10.5753/sbseg.2021.17326
“…ocorrer; por exemplo, a propagação de notícias intencionalmente inverídicas (fake news) [Wang et al. 2018], ataques de ódio ou phishing [Latah 2020]; além disso a comercialização de tais atividades como serviço pode ocorrer, facilitando crimes e o abuso de políticas das RSO [Cresci et al. 2015].”
BackgroundSistemas fuzzy complementam a detecção de socialbots por aprendizado de máquina
Ferreira, C. C. D. C. P., Garcia, A. D. V., Salles, R. M., & Machado, R. (2019) · Brazilian Journal of Development · doi:10.34117/bjdv5n12-308
Identifying Bots on Twitter with Benford’s Law
Bhosale, S. (2021) · doi:10.31979/etd.4ad2-q4wm
An Overview of Detecting Fake Accounts on Twitter Networks
Oumaima, L., Ouafae, B., Mariam, R., et al. (2022) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-90633-7_97
Social Bot Detector using Graph Neural Networks
Nguyen, H.-D., Nguyen, Q. D., Pham, H. L., et al. (2022) · RIVF International Conference on Computing and Communication Technologies (RIVF) · doi:10.1109/rivf55975.2022.10013786
“The majority of Twitter social bot detection studies employ the MIB dataset, which is made up of two distinct datasets we shall call to as MIB-1 [11] and MIB-2 [12].”
Backgroundto Protect the Public Opinion Against New Types of Bots?
Reubold, J. L., Escher, S., Wressnegger, C., & Strufe, T. (2022) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata55660.2022.10020758
“For more information see Cresci et al. [30].”
BackgroundA Survey on Machine Learning to Detect Creation of Fake Identities by Human vs. Bots
Lakshmanan, V., Manasa, K., Soundarya, P. S., Renuka, R., & Subanandhana, R. (2023) · International Conference on Smart Systems and Inventive Technology (ICSSIT) · doi:10.1109/icssit55814.2023.10060939
“21 Fame for sale: Efficient detection of fake twitter followers [21] Artificial neural networks (ANN).”
BackgroundDeep, A., & Sood, M. (2023) · Lecture notes in networks and systems · doi:10.1007/978-981-19-7615-5_44
Dual-Channel Relation Mixup Strategy for Social Bot Detection Based on Graph Neural NetworkPreprint
Liu, M., Shi, S., Shi, Y., Qiao, K., Song, B., & Yang, J. (2023) · Research Square · doi:10.21203/rs.3.rs-2863221/v1 · Cited by 1
Improving bot detection of fake followers on Twitter via a hybrid B-HC optimisation algorithm
Alzeyadi, H., & Duran, F. (2023) · International Conference on Electrical, Computer and Communication Technologies (ICECCT) · doi:10.1109/icecct56650.2023.10179751
“In [34], several feature extraction and rule-based methods (proposed by Academia and Media) were tested on a newly generated baseline datasets, including verified human and fake followers accounts for anomalous Twitter account detection.”
MethodNokovic, B. (2023) · doi:10.5121/csit.2023.131206
“It is shown that bots or computers can be detected successfully using ML models [4].”
How Can Instagram be a Better Space for You?
Burling, M. G. H. (2023) · doi:10.32920/23978808
How Can Instagram be a Better Space for You?
Burling, M. G. H. (2023) · doi:10.32920/23978808.v1
Zhu, H., Yuan, S., Liu, X., et al. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4579075
Using graph solutions to identify "troll farms" and fake news propagation channels
Sulej, P., & Hryniów, K. (2023) · Annals of Computer Science and Information Systems · doi:10.15439/2023f2738
“Due to the known problems with the collection download and the Twitter limits [6][12][14][15], it was eventually possible to obtain 6 240 964 unique identifiers of users.”
BackgroundX Bots and Earnings AnnouncementsPreprint
Hanousek, J., Jr., Hanousek, J., & Sokolov, K. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4595101
Metadata
- Authors
- Cresci, S., Di Pietro, R., Petrocchi, M., Spognardi, A., & Tesconi, M.
- Affiliations
- Institute of Informatics and Telematics (IT)
- Corresponding author
- Spognardi, Angelo
- Venue
- Decision Support Systems
- Publisher
- Elsevier BV
- Published
- 2015-12
- Volume
- 80
- Pages
- 56-71
- ISSN
- 0167-9236 (ISSN-L)
- OpenAlex
- W1849719402
- Cited by
- 475
- References
- 67
- Citations by year
- 2026: 34 · 2025: 56 · 2024: 63 · 2023: 60 · 2022: 38 · 2021: 59 · 2020: 60 · 2019: 41 · 2018: 36 · 2017: 15 · 2016: 13
- FWCI
- 35.44
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Decision Support Systems (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CINECA IRIS Institutial research information system (University of Pisa) (submittedVersion)
- IRIS Research product catalog (Sapienza University of Rome) (submittedVersion)
- Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU) (submittedVersion)
- Padua Research Archive (University of Padova) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Information Systems › Spam and Phishing Detection
- Social Sciences › Sociology and Political Science › Misinformation and Its Impacts
- Physical Sciences › Computer Science › Artificial Intelligence › Hate Speech and Cyberbullying Detection
- Keywords
- fake followers, Twitter, spam social media, feature engineering, feature sensitivity analysis, data fusion
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-09, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-09 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review