Measuring, Characterizing, and Detecting Facebook Like Farms
Abstract
Online social networks offer convenient ways to reach out to large audiences. In particular, Facebook pages are increasingly used by businesses, brands, and organizations to connect with multitudes of users worldwide. As the number of likes of a page has become a de-facto measure of its popularity and profitability, an underground market of services artificially inflating page likes (“like farms ”) has emerged alongside Facebook’s official targeted advertising platform. Nonetheless, besides a few media reports, there is little work that systematically analyzes Facebook pages’ promotion methods. Aiming to fill this gap, we present a honeypot-based comparative measurement study of page likes garnered via Facebook advertising and from popular like farms. First, we analyze likes based on demographic, temporal, and social characteristics and find that some farms seem to be operated by bots and do not really try to hide the nature of their operations, while others follow a stealthier approach, mimicking regular users’ behavior. Next, we look at fraud detection algorithms currently deployed by Facebook and show that they do not work well to detect stealthy farms that spread likes over longer timespans and like popular pages to mimic regular users. To overcome their limitations, we investigate the feasibility of timeline-based detection of like farm accounts, focusing on characterizing content generated by Facebook accounts on their timelines as an indicator of genuine versus fake social activity. We analyze a wide range of features extracted from timeline posts, which we group into two main categories: lexical and non-lexical. We find that like farm accounts tend to re-share content more often, use fewer words and poorer vocabulary, and more often generate duplicate comments and likes compared to normal users. Using relevant lexical and non-lexical features, we build a classifier to detect like farms accounts that achieves a precision higher than 99% and a 93% recall.
AI snapshot
Written from the paper’s full text.
TL;DR
This paper uses Facebook honeypot pages to compare likes from paid like farms versus legitimate Facebook ad campaigns, characterizing farm behavior and showing that deployed graph co-clustering detection can fail against stealthy farms. It then builds timeline-based classifiers using lexical and non-lexical features that detect like farm accounts with at least 99% precision and 93% recall across campaigns.
Key findings
- The honeypot study collected 6,222 likes total: 4,453 from like farms and 1,769 from Facebook ads; like farms showed two main modi operandi: bot-like farms delivering likes in bursts, and stealthier farms mimicking regular users with well-connected social graphs and gradual likes.
- Graph co-clustering detection performed poorly on the stealthiest farm: for BL-USA it achieved 47% precision, 100% recall, and 64% F1-score, while other farms ranged from 86–98% precision and 93–99% F1-score.
- Timeline posts by like farm accounts had 43% fewer words, lower lexical richness (55% vs. 70% for baseline), lower ARI (15 vs. 20), and lower Flesch score (48 vs. 55); farm posts also attracted more comments and likes and contained more shared activity.
- The best SVM classifier using both lexical and non-lexical features achieved 100% precision and 97% recall at best, and at least 99% precision and 93% recall across all campaigns; SVM outperformed Decision Tree, AdaBoost, kNN, Random Forest, and Naïve Bayes.
Methods
- In March 2014, the authors created 13 empty Facebook honeypot pages described as “This is not a real page, so please do not like it”; 5 were promoted via Facebook ad campaigns and 8 via 4 like farms, with monitoring every 2 hours using Selenium and collection of liker demographics, friend lists, and page likes.
- They later re-crawled like farm accounts and a baseline of 1,408 random accounts, collecting timelines up to 500 recent posts; the final dataset included 3,670 like farm users, more than 234K posts, and about 35K baseline posts.
- They evaluated graph co-clustering algorithms inspired by CopyCatch and SynchroTrap, then extracted lexical and non-lexical timeline features and trained supervised two-class SVM classifiers with 80/20 train-test splits, comparing against other classifiers.
Limitations
- The paper states that lexical analysis is limited to English and may be biased toward non-native English speakers and non-USA campaign users; it also states it lacks a larger dataset to measure false positive ratio at scale.
- The paper states data collection was incomplete because Facebook blocked crawling accounts, some accounts became inactive or restricted timelines, and 109 users were missed; it also notes no fine-grained features to further analyze CopyCatch and SynchroTrap.
- Evident from the text: the honeypot pages explicitly said they were not real and campaigns were designed to avert real users, so the authors caution findings do not necessarily imply Facebook advertising is ineffective; the ground truth also assumes farm likers are fake or compromised.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
0 of 32 cited sources checked · 0 supported · 0 flagged
- Findingown data§ 1.1 Roadmap · p. 2
Like farm accounts' posts generate significantly more comments and likes than normal users' posts.
“Moreover, like farm accounts' posts generate significantly more comments and likes, and a much larger fraction of their posts consists of 'shared activity' (i.e., sharing posts from other users, news articles, videos, and external URLs).”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Findingown data§ 1.1 Roadmap · p. 2
The SVM classifier achieves higher accuracy across the board than decision tree, AdaBoost, kNN, random forest, and naive Bayes.
“Finally, we generalize our approach using other classification algorithms, namely, decision tree [7], AdaBoost [20], kNN [1], random forest [6], and na¨ ıve Bayes [55], and empirically confirm that the SVM classifier achieves higher accuracy across the board.”
Quote in the paperNot a substantial claim - Findingown data§ Abstract · p. 1
Like farm accounts more often generate duplicate comments and likes compared to normal users.
“We find that like farm accounts tend to re-share content more often, use fewer words and poorer vocabulary, and more often generate duplicate comments and likes compared to normal users.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Findingown data§ 1.1 Roadmap · p. 2
Timeline posts by like farm accounts have 43% fewer words than normal users' posts.
“In particular, we find that timeline posts by like farm accounts have 43% fewer words, a more limited vocabulary, and lower readability than normal users' posts.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Findingown data§ 2.2 Location and Demographics Analysis · p. 3
For the first four Facebook campaigns (FB-USA, FB-FRA, FB-IND, FB-EGY), we mainly received likes from the targeted country (87-99.8%).
“as shown in Figure 1, for the first four Facebook campaigns (FB-USA, FB-FRA, FB-IND, FB-EGY), we mainly received likes from the targeted country (87-99.8%), even though FB-USA and FB-FRA generated a number of likes much smaller than any other campaign.”
Quote in the paperSubstantial claim
- Findingown data§ Abstract · p. 1
Like farm accounts tend to re-share content more often than normal users.
“We find that like farm accounts tend to re-share content more often, use fewer words and poorer vocabulary, and more often generate duplicate comments and likes compared to normal users.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Findingown data§ 2.2 Location and Demographics Analysis · p. 3
When we targeted Facebook users worldwide (FB-ALL), we almost exclusively received likes from India (96%).
“When we targeted Facebook users worldwide (FB-ALL), we almost exclusively received likes from India (96%).”
Quote in the paperSubstantial claim - Findingown data§ Abstract · p. 1
Facebook's currently deployed fraud detection algorithms do not work well to detect stealthy farms which spread likes over longer timespans and like popular pages to mimic regular users.
“Next, we look at fraud detection algorithms currently deployed by Facebook and show that they do not work well to detect stealthy farms which spread likes over longer timespans and like popular pages to mimic regular users.”
Quote in the paperSubstantial claim - Findingown data§ 1.1 Roadmap · p. 2
A much larger fraction of like farm accounts' posts consists of 'shared activity' (sharing posts from other users, news articles, videos, and external URLs) than normal users' posts.
“Moreover, like farm accounts' posts generate significantly more comments and likes, and a much larger fraction of their posts consists of 'shared activity' (i.e., sharing posts from other users, news articles, videos, and external URLs).”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Findingown data§ 1.1 Roadmap · p. 2
Timeline posts by like farm accounts have a more limited vocabulary than normal users' posts.
“In particular, we find that timeline posts by like farm accounts have 43% fewer words, a more limited vocabulary, and lower readability than normal users' posts.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Findingown data§ 1.1 Roadmap · p. 2
Classifiers using timeline-based features achieve 99-100% precision and 93-97% recall in detecting like farm accounts.
“We evaluate the classifiers using the ground-truth dataset of like farm accounts and show that they achieve 99-100% precision and 93-97% recall in detecting like farm accounts.”
Quote in the paperSubstantial claim - Findingown data§ Abstract · p. 1
Like farm accounts have poorer vocabulary than normal users.
“We find that like farm accounts tend to re-share content more often, use fewer words and poorer vocabulary, and more often generate duplicate comments and likes compared to normal users.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Findingown data§ 1.1 Roadmap · p. 2
When targeting Facebook users worldwide, likes are obtained from only a few countries.
“When targeting Facebook users worldwide, we obtain likes from only a few countries, and that likers' profiles seem skewed toward males.”
Quote in the paperNot a substantial claim - Findingown data§ 2.2 Location and Demographics Analysis · p. 4
These three campaigns also appear to be skewed toward male profiles.
“These three campaigns also appear to be skewed toward male profiles.”
Quote in the paperNot a substantial claim - Findingown data§ 2.2 Location and Demographics Analysis · p. 3
Most likers from SocialFormula were based in Turkey, regardless of whether we requested a US-only campaign.
“Looking at the like farms, most likers from SocialFormula were based in Turkey, regardless of whether we requested a US-only campaign.”
Quote in the paperSubstantial claim - Findingown data§ Abstract · p. 1
Like farm accounts use fewer words than normal users.
“We find that like farm accounts tend to re-share content more often, use fewer words and poorer vocabulary, and more often generate duplicate comments and likes compared to normal users.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Findingown data§ 2.3 Temporal Analysis · p. 4
All like farm campaigns, except BoostLikes, exhibit a very similar trend with a few bursts of a large number of likes.
“We observe from Figure 2(a) that all the like farm campaigns, except BoostLikes, exhibit a very similar trend with a few bursts of a large number of likes.”
Quote in the paperNot a substantial claim - Findingreasoning§ 1.1 Roadmap · p. 2
Graph-based co-clustering fraud detection algorithms incur high false positive rates for stealthy farms, as their accounts mimic normal users.
“We show that these tools incur high false positives rates for stealthy farms, as their accounts mimic normal users.”
Quote in the paperSubstantial claim - Findingown data§ 1.1 Roadmap · p. 2
Different like farms (with different pricing schemes) garner likes from overlapping sets of users.
“Moreover, we find evidence that different like farms (with different pricing schemes) garner likes from overlapping sets of users and, thus, may be managed by the same operator.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Findingown data§ 2.1 Datasets · p. 3
We collected a total of 6,222 likes (4,453 from like farms and 1,769 from Facebook ads).
“Overall, we collected a total of 6,222 likes (4,453 from like farms and 1,769 from Facebook ads).”
Quote in the paperNot a substantial claim - Findingown data§ 2.3 Temporal Analysis · p. 4
For SocialFormula, AuthenticLikes, and MammothSocials campaigns, likes were garnered within a short period of time of two hours.
“Specifically, for the SocialFormula, AuthenticLikes, and MammothSocials campaigns, likes were garnered within a short period of time of two hours.”
Quote in the paperNot a substantial claim - Findingown data§ 1.1 Roadmap · p. 2
Timeline posts by like farm accounts have lower readability than normal users' posts.
“In particular, we find that timeline posts by like farm accounts have 43% fewer words, a more limited vocabulary, and lower readability than normal users' posts.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Findingown data§ 2.4 Social Graph Analysis · p. 6
BoostLikes accounts have dense connectivity compared to accounts belonging to SocialFormula, AuthenticLikes, and MammothSocials.
“The distributions demonstrate that BoostLikes accounts have dense connectivity as compared to accounts belonging to SocialFormula, AuthenticLikes, and MammothSocials.”
Quote in the paperNot a substantial claim - Findingcitation§ 2.5 Page Like Analysis · p. 6
The page like counts of the baseline sample mirrored numbers reported in prior work, e.g., according to [28], the average number of pages liked by Facebook users amounts to roughly 40.
“The page like counts of our baseline sample mirrored numbers reported in prior work, e.g., according to [28], the average number of pages liked by Facebook users amounts to roughly 40.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [28] [28] J. Lafferty. How Many Pages Does The Average Facebook User Like? http://allfacebook.com/ how-many-pages-does-the-average-facebook-user-like b115098, 2013. -
Not checked in the free run.
- Findingown data§ 2.4 Social Graph Analysis · p. 5
The BoostLikes network is well-connected.
“In contrast, the BoostLikes network is well-connected.”
Quote in the paperNot a substantial claim - Findingown data§ 2.5 Page Like Analysis · p. 7
FB-IND, FB-EGY, and FB-ALL have relatively large Jaccard similarity with each other.
“Note from Figure 6 that FB-IND, FB-EGY, and FB-ALL have relatively large (Jaccard) similarity with each other.”
Quote in the paperSubstantial claim - Findingown data§ 3.1 Re-Crawling · p. 8
In Summer 2015, 624 out of 5,616 accounts (11%) were no longer active.
“In Summer 2015, we checked how many accounts had been closed or terminated and found that 624 out of 5,616 accounts (11%) were no longer active.”
Quote in the paperNot a substantial claim - Findingown data§ 2.4 Social Graph Analysis · p. 5
For SocialFormula, AuthenticLikes, and MammothSocials, many isolated pairs and triplets of likers are not connected.
“For SocialFormula, AuthenticLikes, and MammothSocials, we also observe many isolated pairs and triplets of likers who are not connected.”
Quote in the paperSubstantial claim - Findingown data§ 4.1 Analysis of Non-Lexical Features · p. 10
Users of AL-ALL like farm generate many more comments than the baseline users.
“In Figure 8(a), we plot the distributions of the number of comments a post attracts, revealing that users of AL-ALL like farm generate many more comments than the baseline users.”
Quote in the paperNot a substantial claim - Findingown data§ 2.4 Social Graph Analysis · p. 5
A significant fraction of users liked pages corresponding to both the AuthenticLikes and the MammothSocials campaigns.
“A significant fraction of users actually liked pages corresponding to both the AuthenticLikes and the MammothSocials campaigns (see Figure 5): we put these users into a separate group, labelled as ALMS.”
Quote in the paperNot a substantial claim - Findingown data§ 2.4 Social Graph Analysis · p. 6
BoostLikes accounts have higher degree than other like farms.
“BoostLikes accounts have higher degree, are part of more triangles, have higher clustering coefficient, and have larger maximal cliques than other like farms.”
Quote in the paperNot a substantial claim - Findingown data§ 2.5 Page Like Analysis · p. 6
Honeypot pages attracted users that tend to like significantly more pages than regular Facebook users.
“In other words, our honeypot pages attracted users that tend to like significantly more pages than regular Facebook users.”
Quote in the paperSubstantial claim - Findingown data§ 4.1 Analysis of Non-Lexical Features · p. 10
Roughly half of the users in four of the like farms (AL-ALL, BL-USA, SF-ALL, and SF-USA) use 10 or less words in their posts, versus 17 words by baseline users.
“Roughly half of the users in four of the like farms (AL-ALL, BL-USA, SFALL, and SF-USA) use 10 or less words in their posts, versus 17 words by baseline users.”
Quote in the paperNot a substantial claim - Findingown data§ 2.4 Social Graph Analysis · p. 5
The average number of friends of users associated with the BoostLikes campaign (and to a smaller extent, the AuthenticLikes campaign) was much higher than the average number of friends observed elsewhere.
“The average number of friends of users associated with the BoostLikes campaign (and to a smaller extent, the AuthenticLikes campaign) was much higher than the average number of friends observed elsewhere.”
Quote in the paperNot a substantial claim - Findingown data§ 3.2 Experimental Evaluation of Co-Clustering · p. 9
The horizontal false positive streaks in BL-USA include popular pages, such as 'Fast & Furious' and 'SpongeBob SquarePants,' each with millions of likes.
“Further analysis reveals that the horizontal false positive streaks in BL-USA include popular pages, such as 'Fast & Furious' and 'SpongeBob SquarePants,' each with millions of likes.”
Quote in the paperSubstantial claim - Findingown data§ 2.5 Page Like Analysis · p. 6
There is large variance in the number of pages liked, ranging from 1 to 10,000.
“We observed a large variance in the number of pages liked, ranging from 1 to 10,000.”
Quote in the paperNot a substantial claim - Findingown data§ 2.4 Social Graph Analysis · p. 6
BoostLikes accounts have larger maximal cliques than other like farms.
“BoostLikes accounts have higher degree, are part of more triangles, have higher clustering coefficient, and have larger maximal cliques than other like farms.”
Quote in the paperNot a substantial claim - Findingown data§ 4.1 Analysis of Non-Lexical Features · p. 10
Posts of like farm users attract much more likes than those of baseline users.
“Next, Figure 8(b) shows the number of likes associated with users' posts, highlighting that posts of like farm users attract much more likes than those of baseline users.”
Quote in the paperSubstantial claim - Findingown data§ 2.5 Page Like Analysis · p. 6
The median page like count for the baseline Facebook user sample was 34.
“In contrast, the median page like count for our baseline Facebook user sample was 34.”
Quote in the paperSubstantial claim - Findingown data§ 4.1 Analysis of Non-Lexical Features · p. 10
Posts of like farm users tend to have fewer words.
“Figure 8(d) plots the distributions of number of words that make up a text-based post, highlighting that posts of like farm users tend to have fewer words.”
Quote in the paperNot a substantial claim - Findingown data§ 4.1 Analysis of Non-Lexical Features · p. 10
BL-USA is almost identical to the baseline users in number of comments.
“We note that BL-USA is almost identical to the baseline users.”
Quote in the paperNot a substantial claim - Findingown data§ 2.4 Social Graph Analysis · p. 5
There are relations between likers from the same provider.
“Figure 3(b) plots the relations between likers who either have a direct relation or a mutual friend, clearly pointing to the presence of relations between likers from the same provider.”
Quote in the paperSubstantial claim - Findingown data§ 2.4 Social Graph Analysis · p. 6
BoostLikes accounts are part of more triangles than other like farms.
“BoostLikes accounts have higher degree, are part of more triangles, have higher clustering coefficient, and have larger maximal cliques than other like farms.”
Quote in the paperNot a substantial claim - Findingown data§ 2.4 Social Graph Analysis · p. 6
BoostLikes accounts have higher clustering coefficient than other like farms.
“BoostLikes accounts have higher degree, are part of more triangles, have higher clustering coefficient, and have larger maximal cliques than other like farms.”
Quote in the paperNot a substantial claim - Findingown data§ 5 Timeline-based Detection of Like Farms · p. 15
When like farm users target sets of 8 features including prominent ones, the F1-Score of the classifier decreases by between 26% and 56%.
“The F1-Score of our classifier decreases by between 26% to 56% when the like farm users target sets of 8 features including prominent ones (cf. Figure 10).”
Quote in the paperSubstantial claim- The authors state this as an assumption: Fractions of like farm users mimic all features of baseline users, and all like farm users mimic sets of baseline users' features.
- The authors state this as an assumption: In the latter case, all like farm users coordinate and select sets of features from randomly selected baseline users that they copy or mimic.
- Findingown data§ 4.3 Remarks · p. 10
Like farm accounts' posts have 43% fewer words than normal users' posts.
“In particular, we find that posts made by like farm accounts have 43% fewer words, a more limited vocabulary, and lower readability than normal users' posts.”
Quote in the paperNot a substantial claim - Findingown data§ 4.3 Remarks · p. 12
The two-class SVM is the most effective in detecting like farm users compared to Decision Tree, AdaBoost, kNN, Random Forest, and Naïve Bayes.
“We later compare this classifier with other well-known supervised classifiers such as Decision Tree [7], AdaBoost [20], kNN [1], Random Forest [6], and Na¨ ıve Bayes [55] and confirm that the two-class SVM is the most effective in detecting like farms users.”
Quote in the paperSubstantial claim0 of 3 sources checked- cites [7] [7] L. Breiman, J. Friedman, C. J. Stone, and R. A. Olshen. Classification and regression trees . CRC press, 1984. -
Not checked in the free run.
- cites [20] [20] Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. , 1997. - source
Not checked in the free run.
- cites [1] [1] A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM , 2008. - source
Not checked in the free run.
- Findingown data§ 7 Conclusion · p. 17
A large fraction of like farm posts consists of non-original and often redundant 'shared activity'.
“Moreover, like farm posts generated significantly more comments and likes, and a large fraction of their posts consists of non original and often redundant 'shared activity' (i.e., repeatedly sharing posts made by other users, articles, videos, and external URLs).”
Quote in the paperSubstantial claim - Findingown data§ 6 Related Work · p. 17
The paper's evaluation of graph co-clustering techniques shows that sophisticated like farms successfully evade detection by avoiding lockstep behavior and liking sets of seemingly random pages.
“In fact, our evaluation of graph co-clustering techniques shows that these farms successfully evade detection by avoiding lockstep behavior and liking sets of seemingly random pages.”
Quote in the paperSubstantial claim - Findingown data§ 4.2 Analysis of Lexical Features · p. 10
Baseline users have higher ARI than like farm users (20 vs. 15).
“In comparison to like farm users, baseline users post text with higher lexical richness (70% vs. 55%), ARI (20 vs. 15), and Flesch score (55 vs. 48), thus suggesting that normal users use a richer vocabulary and that their posts have higher readability.”
Quote in the paperSubstantial claim - Findingown data§ 5 Timeline-based Detection of Like Farms · p. 15
When only one feature is mimicked, the F1-Score of the approach decreases by between 1% and 8%.
“With this attack strategy, we observe that when only one feature is mimicked, the F1-Score of our approach (cf. Table 9) decreases by between 1% to 8%.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Fractions of like farm users mimic all features of baseline users, and all like farm users mimic sets of baseline users' features.
- The authors state this as an assumption: In the latter case, all like farm users coordinate and select sets of features from randomly selected baseline users that they copy or mimic.
- Findingown data§ 4.3 Remarks · p. 10
A large fraction of like farm users' posts consists of non-original and often redundant 'shared activity'.
“Moreover, like farm users generate significantly more comments and likes and a large fraction of their posts consists of non-original and often redundant 'shared activity'.”
Quote in the paperNot a substantial claim - Findingown data§ 4.2 Analysis of Lexical Features · p. 10
Baseline users have higher lexical richness than like farm users (70% vs. 55%).
“In comparison to like farm users, baseline users post text with higher lexical richness (70% vs. 55%), ARI (20 vs. 15), and Flesch score (55 vs. 48), thus suggesting that normal users use a richer vocabulary and that their posts have higher readability.”
Quote in the paperSubstantial claim - Findingown data§ 5 Timeline-based Detection of Like Farms · p. 13
The combined lexical and non-lexical classifier shows high accuracy for all like farms (F1-Score ≥ 96%).
“Results are summarized in Table 9, which shows high accuracy for all like farms (F1-Score ≥ 96%), thus confirming the effectiveness of our timeline-based features in detecting like farm users.”
Quote in the paperSubstantial claim - Findingown data§ 4.3 Remarks · p. 10
Like farm accounts' posts have lower readability than normal users' posts.
“In particular, we find that posts made by like farm accounts have 43% fewer words, a more limited vocabulary, and lower readability than normal users' posts.”
Quote in the paperNot a substantial claim - Findingown data§ 5 Timeline-based Detection of Like Farms · p. 14
Average word length and average number of words per post provide the most improvement in F1-Score for all campaigns.
“We observe that the average word length (cf. Figure 10(a)) and average number of words per post (cf. Figure 10(b)) provide the most improvement in the F1-Score for all campaigns.”
Quote in the paperSubstantial claim - Findingown data§ 7 Conclusion · p. 17
Like farm posts generated significantly more comments and likes than normal users' posts.
“Moreover, like farm posts generated significantly more comments and likes, and a large fraction of their posts consists of non original and often redundant 'shared activity' (i.e., repeatedly sharing posts made by other users, articles, videos, and external URLs).”
Quote in the paperSubstantial claim - Findingown data§ 5 Timeline-based Detection of Like Farms · p. 13
Approximately 3% to 22% of like farm users and 14% of baseline users do not have English language posts and are not considered in the lexical features based classification.
“We also note that approximately 3% to 22% of like farm users and 14% of baseline users do not have English language posts and are not considered in the lexical features based classification.”
Quote in the paperSubstantial claim - Findingown data§ 4.3 Remarks · p. 10
Like farm accounts' posts have a more limited vocabulary than normal users' posts.
“In particular, we find that posts made by like farm accounts have 43% fewer words, a more limited vocabulary, and lower readability than normal users' posts.”
Quote in the paperSubstantial claim - Findingown data§ 5 Timeline-based Detection of Like Farms · p. 13
Accuracy decreases by approximately 8% for SF-USA with lexical features.
“Although the accuracy decreases by approximately 8% for SF-USA, the overall performance suggests that lexical features are useful in automatically detecting like farm users.”
Quote in the paperNot a substantial claim - Findingown data§ 7 Conclusion · p. 17
The paper demonstrated that sophisticated like farms can successfully evade detection by existing graph-based fraud detection algorithms such as CopyCatch and SynchroTrap.
“We then evaluated the effectiveness of existing graph based fraud detection algorithms, such as CopyCatch [4] and SynchroTrap [10], and demonstrated that sophisticated like farms can successfully evade detection.”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [4] [4] A. Beutel, W. Xu, V. Guruswami, C. Palow, and C. Faloutsos. CopyCatch: Stopping Group Attacks by Spotting Lockstep Behavior in Social Networks. In WWW , 2013. - source
Not checked in the free run.
- cites [10] [10] Q. Cao, X. Yang, J. Yu, and C. Palow. Uncovering Large Groups of Active Malicious Accounts in Online Social Networks. In CCS , 2014. - source
Not checked in the free run.
- Findingown data§ 4.3 Remarks · p. 10
Like farm users generate significantly more comments and likes than normal users.
“Moreover, like farm users generate significantly more comments and likes and a large fraction of their posts consists of non-original and often redundant 'shared activity'.”
Quote in the paperNot a substantial claim - Findingown data§ 7 Conclusion · p. 17
The paper's demographic, temporal, and social graph analysis highlighted similar patterns between accounts across different like farms.
“Our demographic, temporal, and social graph analysis highlighted similar patterns between accounts across different like farms and revealed two main modi operandi: some farms seem to be operated by bots and do not really try to hide the nature of their operations, while others follow a stealthier approach, mimicking regular users' behavior.”
Quote in the paperSubstantial claim - Findingown data§ 6 Related Work · p. 17
The paper introduces an empirical evaluation demonstrating that temporal and social graph analysis can only be used to detect naive farms.
“we introduce an empirical evaluation demonstrating that temporal and social graph analysis can only be used to detect naive farms (Section 3)”
Quote in the paperSubstantial claim - Findingown data§ 5 Timeline-based Detection of Like Farms · p. 15
The approach has a low false positive ratio (≪ 1%).
“The low false positive ratio ( ≪ 1%, cf. Table 9) highlights the effectiveness of our approach as well as the limitations of prior graph co-clustering algorithms in detecting like farms users (cf. Section 3).”
Quote in the paperSubstantial claim - Findingown data§ 4.2 Analysis of Lexical Features · p. 10
Baseline users have higher Flesch score than like farm users (55 vs. 48).
“In comparison to like farm users, baseline users post text with higher lexical richness (70% vs. 55%), ARI (20 vs. 15), and Flesch score (55 vs. 48), thus suggesting that normal users use a richer vocabulary and that their posts have higher readability.”
Quote in the paperSubstantial claim - Premisecitation§ 1 Introduction · p. 1
An ecosystem of like farms has emerged that offers paid services to artificially inflate the number of likes on Facebook pages.
“At the same time, as the number of likes on a Facebook page is considered a measure of its popularity [11], an ecosystem of so-called 'like farms' has emerged that offers paid services to artificially inflate the number of likes on Facebook pages.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [50] [50] B. Viswanath, M. A. Bashir, M. Crovella, S. Guha, K. P. Gummadi, B. Krishnamurthy, and A. Mislove. Towards Detecting Anomalous User Behavior in Online Social Networks. In Usenix Security , 2014. -
Not checked in the free run.
- Premisecitation§ 2.1 Datasets · p. 3
A majority of Facebook users do not set the visibility of their age and location to public.
“Since a majority of Facebook users do not set the visibility of their age and location to public [13], we used these reports to collect statistics about likers' gender, age, country, home and current town.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [13] [13] A. Chaabane, G. Acs, and M. A. Kaafar. You Are What You Like! Information Leakage Through Users' Interests. In NDSS , 2012. -
Not checked in the free run.
- Interpretationown data§ Abstract · p. 1
Other like farms follow a stealthier approach, mimicking regular users' behavior.
“First, we analyze likes based on demographic, temporal, and social characteristics, and find that some farms seem to be operated by bots and do not really try to hide the nature of their operations, while others follow a stealthier approach, mimicking regular users' behavior.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Interpretationreasoning§ 1.1 Roadmap · p. 2
Stealthier like farms can successfully circumvent graph-based fraud detection methods by spreading likes over longer timespans and liking popular pages to mimic normal users.
“The issue with these methods, however, is that stealthier (and more expensive) like farms can successfully circumvent them by spreading likes over longer timespans and liking popular pages to mimic normal users.”
Quote in the paperSubstantial claim - Interpretationreasoning§ 2.3 Temporal Analysis · p. 5
The abrupt increase in cumulative number of likes during a short period of time might likely be due to automated scripts operating a set of fake profiles.
“On the one hand, the abrupt increase in the cumulative number of likes happening during a short period of time might likely be due to automated scripts operating a set of fake profiles.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Interpretationreasoning§ 2.3 Temporal Analysis · p. 5
Two different strategies may be adopted by like farms.
“This suggests that two different strategies may be adopted by like farms.”
Quote in the paperSubstantial claim - Interpretationreasoning§ 2.3 Temporal Analysis · p. 5
BoostLikes's strategy seems to rely on the underlying social graph, possibly constituted by fake profiles operated by humans.
“On the other hand, BoostLikes's strategy, which resembles the temporal evolution in Facebook campaigns, seems to rely on the underlying social graph, possibly constituted by fake profiles operated by humans.”
Quote in the paperNot a substantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Interpretationown data§ 1.1 Roadmap · p. 2
Different like farms may be managed by the same operator.
“Moreover, we find evidence that different like farms (with different pricing schemes) garner likes from overlapping sets of users and, thus, may be managed by the same operator.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
- Study design and conductown data§ 3.1 Re-Crawling · p. 8
The experiments use, as ground truth, the Facebook accounts gathered as part of the honeypot-based measurement of like farms.
“Our experiments use, as ground truth, the Facebook accounts gathered as part of the honeypot-based measurement of like farms.”
Quote in the paperSubstantial claim - Interpretationown data§ 2.5 Page Like Analysis · p. 7
The same fake profiles are used in multiple campaigns by a like farm (e.g., SF-ALL and SF-USA).
“These findings suggest that the same fake profiles are used in multiple campaigns by a like farm (e.g., SF-ALL and SFUSA).”
Quote in the paperSubstantial claim - Interpretationown data§ 3.2 Experimental Evaluation of Co-Clustering · p. 10
The results highlight the limitations of prior graph co-clustering algorithms in detecting fake likes by like farm accounts.
“Our results highlight the limitations of prior graph coclustering algorithms in detecting fake likes by like farm accounts.”
Quote in the paperSubstantial claim - Interpretationreasoning§ 2.5 Page Like Analysis · p. 6
A vast majority of the garnered likes are fake.
“Since our honeypot pages both for Facebook and like farm campaigns explicitly indicated they were not 'real', we argue that a vast majority of the garnered likes are fake.”
Quote in the paperSubstantial claim - Premisecitation§ 3 Limitations of Graph Co-Clustering Techniques · p. 8
These tools use graph co-clustering algorithms to detect large groups of malicious accounts that like similar pages around the same time frame.
“These tools use graph co-clustering algorithms to detect large groups of malicious accounts that like similar pages around the same time frame.”
Quote in the paperSubstantial claim - Interpretationreasoning§ 2.6 Discussion · p. 8
The findings do not necessarily imply that advertising on Facebook is ineffective, since the campaigns were specifically designed to avert real users.
“We stress that our findings do not necessarily imply that advertising on Facebook is ineffective, since our campaigns were specifically designed to avert real users.”
Quote in the paperNot a substantial claim - Premisecitation§ 3 Limitations of Graph Co-Clustering Techniques · p. 8
Facebook has recently deployed detection tools such as CopyCatch [4] and SynchroTrap [10].
“Aiming to counter fraudulent activities, including like farms, Facebook has recently deployed detection tools such as CopyCatch [4] and SynchroTrap [10].”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [4] [4] A. Beutel, W. Xu, V. Guruswami, C. Palow, and C. Faloutsos. CopyCatch: Stopping Group Attacks by Spotting Lockstep Behavior in Social Networks. In WWW , 2013. - source
Not checked in the free run.
- cites [10] [10] Q. Cao, X. Yang, J. Yu, and C. Palow. Uncovering Large Groups of Active Malicious Accounts in Online Social Networks. In CCS , 2014. - source
Not checked in the free run.
- Interpretationown data§ 2.4 Social Graph Analysis · p. 5
The observed tight connections and number of friends suggest that only a small part of these networks is visible.
“These tight connections, along with the number of their friends, suggest that we only see a small part of these networks.”
Quote in the paperNot a substantial claim - Interpretationown data§ 2.5 Page Like Analysis · p. 7
Some fake profiles seem to be shared by different like farms (e.g., AL-USA and MS-USA), suggesting that they are run by the same operator.
“Moreover, some fake profiles seem to be shared by different like farms (e.g., AL-USA and MS-USA), suggesting that they are run by the same operator.”
Quote in the paperNot a substantial claim - Premisecitation§ 4.2 Analysis of Lexical Features · p. 10
The word frequency approach to analyze short text on social media and blogs does not perform well.
“Indeed, [22] has shown that the word frequency approach to analyze short text on social media and blogs does not perform well.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [22] [22] A. Hogenboom, F. Frasincar, F. de Jong, and U. Kaymak. Using Rhetorical Structure in Sentiment Analysis. Communications of the ACM , 58(7), June 2015. - source
Not checked in the free run.
- Interpretationreasoning§ 3.2 Experimental Evaluation of Co-Clustering · p. 10
Fake liking activity is challenging to detect when only relying on monitoring the liking activity due to the increased sophistication of stealthier like farms.
“We argue that fake liking activity is challenging to detect when only relying on monitoring the liking activity due to the increased sophistication of stealthier like farms.”
Quote in the paperSubstantial claim - Interpretationown data§ 4.2 Analysis of Lexical Features · p. 10
English-based lexical analysis provides sufficient differences across different categories of users.
“While our analysis could be extended to other languages, we argue that English-based lexical analysis provides sufficient differences across different categories of users.”
Quote in the paperSubstantial claim - Interpretationown data§ 5 Timeline-based Detection of Like Farms · p. 13
Timeline-based features are effective in detecting like farm users.
“Results are summarized in Table 9, which shows high accuracy for all like farms (F1-Score ≥ 96%), thus confirming the effectiveness of our timeline-based features in detecting like farm users.”
Quote in the paperSubstantial claim - Interpretationreasoning§ 5 Timeline-based Detection of Like Farms · p. 15
Should the proposed techniques be deployed by Facebook, it will be challenging and costly for fraudsters to modify their behavior and evade detection, because this would require instructing automated scripts and/or cheap human labor to match the diversity and richness of real users' timeline posts.
“As a result, we argue that, should our proposed techniques be deployed by Facebook, it will be challenging, as well as costly, for fraudsters to modify their behavior and evade detection, since this would require instructing automated scripts and/or cheap human labor to match the diversity and richness of real users' timeline posts.”
Quote in the paperNot a substantial claim- Rests on an assumption: Like farms typically rely on pre-defined lists of comments, resulting in word repetition and lower lexical richness.
- Rests on an assumption: Like farms either heavily automate mechanisms or rely on manual input of cheap human labor.
- Interpretationreasoning§ 5 Timeline-based Detection of Like Farms · p. 14
Combining several features increases the workload required to appear real on like farm accounts.
“Therefore, combining several features increases the workload required to appear real on like farm accounts.”
Quote in the paperSubstantial claim - Interpretationreasoning§ 5 Timeline-based Detection of Like Farms · p. 14
Increasing word length or number of words per post in a way that is not readable or understandable will not improve the overall outlook of the account to appear real.
“That is, increasing word length and number of words on posts in a way that is not readable nor understandable, will not improve the overall outlook of the account to appear real.”
Quote in the paperSubstantial claim - Interpretationown data§ 5 Timeline-based Detection of Like Farms · p. 13
The poor classification performance for the stealthiest like farm (BL-USA) suggests that non-lexical features alone are not sufficient to accurately detect like farm users.
“The poor classification performance for the stealthiest like farm (BL-USA) suggests that non-lexical features alone are not sufficient to accurately detect like farm users.”
Quote in the paperSubstantial claim - Study design and conductreasoning§ 6 Related Work · p. 15
The paper's work differs from prior passive measurement studies by relying on deployment of several honeypot pages and paid campaigns to actively engage with fake profiles.
“Our work differs from these studies as they all conducted passive measurements, whereas we rely on the deployment of several honeypot pages and (paid) campaigns to actively engage with fake profiles.”
Quote in the paperSubstantial claim - Study design and conductnone given§ 6 Related Work · p. 15
Unlike prior honeypot studies, the paper leverages timeline-based features for detection of fake accounts.
“Unlike [30, 44], we leverage timeline-based features for the detection of fake accounts.”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [30] [30] K. Lee, J. Caverlee, and S. Webb. Uncovering Social Spammers: Social Honeypots + Machine Learning. In SIGIR , 2010. - source
Not checked in the free run.
- cites [44] [44] G. Stringhini, C. Kruegel, and G. Vigna. Detecting Spammers on Social Networks. In ACSAC , 2010. - source
Not checked in the free run.
- Interpretationown data§ 5 Timeline-based Detection of Like Farms · p. 13
Random Forest and Naïve Bayes show poor classification results due to overfitting on the dataset.
“Due to overfitting on our dataset, Random Forest and Na¨ ıve Bayes show poor results”
Quote in the paperNot a substantial claim - Interpretationown data§ 4.3 Remarks · p. 10
The analysis of user timelines highlights several differences in both lexical and non-lexical features of normal and like farm users.
“Our analysis of user timelines highlights several differences in both lexical and non-lexical features of normal and like farm users.”
Quote in the paperSubstantial claim - Interpretationreasoning§ 7 Conclusion · p. 18
The cost to interfere with lexical features would be even higher because it would entail modifying or imitating normal users' writing style.
“Even higher would be the cost to interfere with lexical features, since this would entail modifying or imitating normal users' writing style.”
Quote in the paperSubstantial claim - Interpretationown data§ 5 Timeline-based Detection of Like Farms · p. 15
It is possible to accurately detect like farm users from both sophisticated and naïve farms by incorporating additional account information, specifically timeline activities.
“Our results demonstrate that it is possible to accurately detect like farm users from both sophisticated and na¨ ıve farms by incorporating additional account information - specifically, timeline activities.”
Quote in the paperSubstantial claim - Interpretationreasoning§ 5 Timeline-based Detection of Like Farms · p. 15
The use of a variety of lexical and non-lexical features will make it difficult for like farm operators to circumvent detection.
“We also argue that the use of a variety of lexical and non-lexical features will make it difficult for like farm operators to circumvent detection.”
Quote in the paperSubstantial claim- Rests on an assumption: Like farms typically rely on pre-defined lists of comments, resulting in word repetition and lower lexical richness.
- Interpretationown data§ 5 Timeline-based Detection of Like Farms · p. 15
Prior graph co-clustering algorithms have limitations in detecting like farm users.
“The low false positive ratio ( ≪ 1%, cf. Table 9) highlights the effectiveness of our approach as well as the limitations of prior graph co-clustering algorithms in detecting like farms users (cf. Section 3).”
Quote in the paperSubstantial claim - Interpretationnone given§ 5 Timeline-based Detection of Like Farms · p. 15
Any feature used to identify fake like farm behavior can be circumvented or manipulated by like farm users by behaving more like real users.
“Note that any feature used to identify fake like farms behavior can be either circumvented or manipulated by the like farms users by behaving more like real users.”
Quote in the paperSubstantial claim - Interpretationown data§ 5 Timeline-based Detection of Like Farms · p. 13
Lexical features are useful in automatically detecting like farm users.
“Although the accuracy decreases by approximately 8% for SF-USA, the overall performance suggests that lexical features are useful in automatically detecting like farm users.”
Quote in the paperSubstantial claim - Interpretationown data§ 6 Related Work · p. 17
The paper presents a novel timeline-based classifier geared to detect accounts from stealthy like farms with a remarkably high degree of accuracy.
“we present a novel timeline-based classifier geared to detect accounts from stealthy like farms with a remarkably high degree of accuracy (Sections 4 and 5).”
Quote in the paperSubstantial claim - Interpretationreasoning§ 7 Conclusion · p. 18
Imitating normal users' behaviors will likely incur a remarkably higher cost because non-lexical features are extracted from users' interactions with timeline posts.
“Since non-lexical features are extracted from users' interactions with timeline posts, imitating normal users' behaviors will likely incur an remarkably higher cost.”
Quote in the paperSubstantial claim- Rests on an assumption: Like farms either heavily automate mechanisms or rely on manual input of cheap human labor.
- Premisecitation§ 6 Related Work · p. 15
Prior work has focused extensively on analysis and detection of sybil and/or fake accounts in online social networks by relying on tightly-knit community structures.
“Prior work has focused quite extensively on the analysis and the detection of sybil and/or fake accounts in online social networks by relying on tightly-knit community structures [54, 15, 53, 9, 52, 5].”
Quote in the paperSubstantial claim0 of 6 sources checked- cites [54] [54] H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. SybilGuard: Defending Against Sybil Attacks via Social Networks. In SIGCOMM , 2006. - source
Not checked in the free run.
- cites [15] [15] G. Danezis and P. Mittal. SybilInfer: Detecting Sybil Nodes using Social Networks. In NDSS , 2009. -
Not checked in the free run.
- cites [53] [53] Z. Yang, C. Wilson, X. Wang, T. Gao, B. Y. Zhao, and Y. Dai. Uncovering Social Network Sybils in the Wild. In ACM IMC , 2011. - source
Not checked in the free run.
- cites [9] [9] Q. Cao, M. Sirivianos, X. Yang, and T. Pregueiro. Aiding the Detection of Fake Accounts in Large Scale Social Online Services. In NSDI , 2012. -
Not checked in the free run.
- cites [52] [52] C. Yang, R. Harkreader, J. Zhang, S. Shin, and G. Gu. Analyzing Spammers' Social Networks for Fun and Profit. In WWW , 2012. - source
Not checked in the free run.
- cites [5] [5] Y. Boshmaf, D. Logothetis, G. Siganos, J. R. Leria, J. Lorenzo, M. Ripeanu, and K. Beznosov. Integro: Leveraging Victim Prediction for Robust Fake Account Detection in OSNs. In NDSS , 2015. - source
Not checked in the free run.
- May combine two claims. 63
- Classified as probably not a substantial claim. 22
- The quote only partly states this claim. 2
May combine two claims.
Findingown data§ 2.3 Temporal Analysis · p. 4With AuthenticLikes, we observed likes from more than 700 profiles within the first 4 hours of the second day of data collection, and no more likes were observed later on.
“With AuthenticLikes, we observed likes from more than 700 profiles within the first 4 hours of the second day of data collection. Interestingly, no more likes were observed later on.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ Abstract · p. 1A classifier using relevant lexical and non-lexical features detects like farm accounts with precision higher than 99% and recall of 93%.
“Using relevant lexical and non-lexical features, we build a classifier to detect like farms accounts that achieves a precision higher than 99% and a 93% recall.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 2.2 Location and Demographics Analysis · p. 3The other three farms delivered likes complying to our requests, e.g., for US-only campaigns, the pages received a majority of likes from US profiles.
“The other three farms delivered likes complying to our requests, e.g., for US-only campaigns, the pages received a majority of likes from US profiles.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 2.2 Location and Demographics Analysis · p. 4FB-IND, FB-EGY, and FB-ALL campaigns are biased toward younger users.
“The last column reports the KLdivergence between the age distribution of the campaign users and that of the entire Facebook population, highlighting large divergence for FB-IND, FB-EGY, and FB-ALL, which are biased toward younger users.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Findingown data§ 2.1 Datasets · p. 3BL-ALL and MS-ALL campaigns remained inactive, i.e., they did not result in any likes even though we were charged in advance.
“Note that the BL-ALL and MS-ALL campaigns remained inactive, i.e., they did not result in any likes even though we were charged in advance.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Findingown data§ 2.1 Datasets · p. 3The largest number of likes were garnered by AL-USA, the lowest (excluding inactive campaigns) by FB-USA.
“The largest number of likes were garnered by AL-USA, the lowest (excluding inactive campaigns) by FB-USA.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingnone given§ 1.1 Roadmap · p. 2Likers' profiles seem skewed toward males.
“When targeting Facebook users worldwide, we obtain likes from only a few countries, and that likers' profiles seem skewed toward males.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ 2.3 Temporal Analysis · p. 4The BoostLikes campaign targeting US users shows a temporal behavior comparable to Facebook Ads campaigns: the number of likes steadily increases during the observation period and no abrupt changes are observed.
“On the contrary, the BoostLikes campaign targeting US users shows a different temporal behavior: the trend is actually comparable to that observed in the Facebook Ads campaigns (see Figure 2(b)). The number of likes steadily increases during the observation period and no abrupt changes are observed.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 2.2 Location and Demographics Analysis · p. 4The demographics of likers from SocialFormula and, to a lesser extent, AuthenticLikes and MammothSocials, are much more similar to those of the entire Facebook network, even though male users are still over-represented.
“In contrast, the demographics of likers from SocialFormula and, to a lesser extent, AuhtenticLikes and MammothSocials, are much more similar to those of the entire network, even though male users are still over-represented.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ 2.1 Datasets · p. 3We identify more than 6.3 million total likes by users who liked our honeypot pages and more than 1 million friendship relations.
“Overall, we identify more than 6.3 million total likes by users who liked our honeypot pages and more than 1 million friendship relations.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 4.2 Analysis of Lexical Features · p. 10Baseline users and like farm users in USA (i.e., MS-USA, BL-USA, and AL-USA) mostly post in English, while users of worldwide campaigns (MS-ALL, BL-ALL, AL-ALL) have significantly fewer posts in English.
“Figure 9 shows that the baseline users and like farm users in USA (i.e., MS-USA, BL-USA, and AL-USA) mostly post in English, while users of worldwide campaigns (MS-ALL, BL-ALL, AL-ALL) have significantly fewer posts in English.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ 4.1 Analysis of Non-Lexical Features · p. 10Baseline users generate more original posts, and share fewer posts or links, compared to farm users.
“Figure 8(c) shows that baseline users generate more original posts, and share fewer posts or links, compared to farm users.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ 3.2 Experimental Evaluation of Co-Clustering · p. 9The graph co-clustering algorithm neatly separates users for AL-USA, but incurs false positives for other like farms.
“While the graph co-clustering algorithm neatly separates users for AL-USA, it incurs false positives for other like farms.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 3.1 Re-Crawling · p. 8Overall, the paper gathered information from 600K unique pages, liked by 3,670 like farm accounts and 1,408 baseline accounts, and around 270K posts.
“Overall, we gathered information from 600K unique pages, liked by 3,670 like farm accounts and 1,408 baseline accounts, and around 270K posts.”
Quote in the paperSubstantial claimMay combine two claims.
Findingcitation§ 4.2 Analysis of Lexical Features · p. 10The overall performance of the 'bag-of-words' approach was poor, which can be explained with the short nature of the posts.
“However, the overall performance of this 'bag-of-words' approach was poor, which can be explained with the short nature of the posts.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 2.6 Discussion · p. 8For BoostLikes, there is a high number of friends per profile and a 'reasonable' number of likes.
“For the latter, we also observed a high number of friends per profile and a 'reasonable' number of likes.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 3.2 Experimental Evaluation of Co-Clustering · p. 9The co-clustering algorithm fails to achieve a good separation for BL-USA, where it incurs a large number of false positives, resulting in 47% precision.
“In particular, the co-clustering algorithm fails to achieve a good separation for BL-USA, where it incurs a large number of false positives, resulting in 47% precision.”
Quote in the paperSubstantial claimMay combine two claims.
Findingreasoning§ 2.4 Social Graph Analysis · p. 5The number of likers reported for each campaign in Table 3 is different from the number of campaign likes (Table 1), since some users liked more than one page.
“Note that the number of likers reported for each campaign in Table 3 is different from the number of campaign likes (Table 1), since some users liked more than one page.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ 2.4 Social Graph Analysis · p. 5Many likers kept their friend lists private: almost 80% of likers in the Facebook campaigns, about 75% in the BoostLikes campaign, and much less frequently for the other like farm campaigns (~40-60%).
“Many likers kept their friend lists private: this occurred for almost 80% of likers in the Facebook campaigns, about 75% in the BoostLikes campaign, and much less frequently for the other like farm campaigns ( ∼ 40-60%).”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ 3.1 Re-Crawling · p. 8The paper garnered 5,918 likes from 5,616 unique users, specifically, 1,437 unique accounts from Facebook ad campaigns and 4,179 unique accounts from the like farm campaigns.
“Recall (from Section 2) that we garnered 5,918 likes from 5,616 unique users, specifically, 1,437 unique accounts from Facebook ad campaigns and 4,179 unique accounts from the like farm campaigns (note that some users liked more than one honeypot pages).”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 2.6 Discussion · p. 8A month after the campaigns, only one account associated with BoostLikes was terminated, as opposed to 9, 20, and 44 for the other like farms; 11 accounts from the regular Facebook campaigns were also terminated.
“A month after the campaigns, we checked whether or not likers' accounts were still active: as shown in Table 1, only one account associated with BoostLikes was terminated, as opposed to 9, 20, and 44 for the other like farms. 11 accounts from the regular Facebook campaigns were also terminated.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Findingown data§ 3.1 Re-Crawling · p. 853% of the baseline accounts had at least 10 visible posts on the timeline, and in total about 35K posts were collected.
“53% of the accounts had at least 10 visible posts on the timeline, and in total we collected about 35K posts.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ 2.5 Page Like Analysis · p. 6The median page like count ranged between 600 and 1000 for users from the Facebook campaigns and between 1200 and 1800 for those from like farm campaigns, with the exception of the BL-USA campaign (median was 63).
“The median page like count ranged between 600 and 1000 for users from the Facebook campaigns and between 1200 and 1800 for those from like farm campaigns, with the exception of the BL-USA campaign (median was 63).”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 2.4 Social Graph Analysis · p. 6The average degree of BoostLikes accounts is 18 while other like farms have average degrees of less than 5.
“For example, the average degree of BoostLikes accounts is 18 while other like farms have average degrees of less than 5.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ 3.2 Experimental Evaluation of Co-Clustering · p. 9The paper observes two distinct behaviors in the scatter plots: 'liking everything' (vertical streaks) and 'everyone liking a particular page' (horizontal streaks). Both like farm and normal users exhibit vertical and horizontal streaks.
“We observe two distinct behaviors in the scatter plots: (1) 'liking everything' (vertical streaks), and (2) 'everyone liking a particular page' (horizontal streaks). Both like farm and normal users exhibit vertical and horizontal streaks in the scatter plots.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 2.5 Page Like Analysis · p. 7The SF-USA and SF-ALL pair and the AL-USA and MS-USA pair also have relatively large Jaccard similarity.
“In addition, the SF-USA and SF-ALL pair and the AL-USA and MS-USA pair also have relatively large Jaccard similarity.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 3.1 Re-Crawling · p. 8The new dataset consists of 3,670 users (out of the initial 4,179), with more than 234K posts.
“In summary, our new dataset consists of 3,670 users (out of the initial 4,179), with more than 234K posts (messages, shared content, check-ins, etc) for these accounts.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 4.2 Analysis of Lexical Features · p. 10The median ratio of English posts for AL-ALL campaign is around 10% and that for SF-ALL around 15%.
“For example, the median ratio of English posts for AL-ALL campaign is around 10% and that for SF-ALL around 15%.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ 2.4 Social Graph Analysis · p. 6More than 25% of BoostLikes accounts make maximal cliques of size greater than 10 while less than 1% accounts of the other like farms make maximal cliques of size greater than 10.
“Moreover, more than 25% of BoostLikes accounts make maximal cliques of size greater than 10 while less than 1% accounts of the other like farms make maximal cliques of size greater than 10.”
Quote in the paperSubstantial claimThe quote only partly states this claim.
Findingown data§ 5 Timeline-based Detection of Like Farms · p. 13The classifier achieves very high precision and recall for MS-USA, BL-USA, and AL-USA with lexical features.
“We observe that our classifier achieves very high precision and recall for MS-USA, BL-USA, and AL-USA.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 7 Conclusion · p. 17Posts by like farm accounts have 43% fewer words, a more limited vocabulary, and lower readability than normal users' posts.
“We extracted lexical and non-lexical features from user timelines, finding that posts by like farm accounts have 43% fewer words, a more limited vocabulary, and lower readability than normal users' posts.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 7 Conclusion · p. 17The best classifier (SVM) achieved as high as 100% precision and 97% recall, and at least 99% precision and 93% recall across all campaigns, significantly higher than graph co-clustering techniques.
“By leveraging both lexical and non-lexical features, we experimented with several machine learning classifiers, with the best of our classifiers (SVM) achieving as high as 100% precision and 97% of recall, and at least 99% and 93% respectively across all campaigns significantly higher than graph co-clustering techniques.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ 5 Timeline-based Detection of Like Farms · p. 15When 30% of like farm users coordinate and mimic all features of baseline users, the classifier achieves at least 73% F1-Score and at most 17% false positive ratio, a decrease of 26% F1-Score compared to the approach in Table 9.
“When 30% of like farms users coordinate and mimic all features of baseline users, we observe that our classifier achieves at least 73% F1-Score and at most 17% false positive ratio, decreasing 26% F1-Score compared to our approach (cf. Table 9).”
Quote in the paperSubstantial claim- The authors state this as an assumption: Fractions of like farm users mimic all features of baseline users, and all like farm users mimic sets of baseline users' features.
- The authors state this as an assumption: In the first scenario, sets of like farm users randomly select baseline users and aggressively replace the values of all their features with that of the selected baseline users.
The quote only partly states this claim.
Findingown data§ 5 Timeline-based Detection of Like Farms · p. 13The SVM classifier achieves the highest F1-Scores across all campaigns compared with Decision Tree, AdaBoost, kNN, Random Forest, and Naïve Bayes when using both lexical and non-lexical features.
“Our results show that the SVM classifier achieves the highest F1-Scores across the board.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Interpretationown data§ 2.2 Location and Demographics Analysis · p. 3The location result potentially supports the claim that like farm accounts diversify their liking activities by liking pages promoted via Facebook ads to avoid Facebook's fraud detection algorithms.
“It also potentially supports the claim that like farm accounts diversify their liking activities by liking pages promoted via Facebook ads to avoid Facebook's fraud detection algorithms (we further explore this in section 2.5).”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim.
Premisecitation§ 1 Introduction · p. 1The number of likes on a Facebook page is considered a measure of its popularity.
“At the same time, as the number of likes on a Facebook page is considered a measure of its popularity [11], an ecosystem of so-called 'like farms' has emerged that offers paid services to artificially inflate the number of likes on Facebook pages.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [11] [11] B. Carter. The Like Economy: How Businesses Make Money with Facebook . QUE Publishing, 2013. -
Not checked in the free run.
May combine two claims.
Premisecitation§ 1 Introduction · p. 1Like farms rely on fake and compromised accounts as well as incentivized collusion networks where users are paid for actions from their account.
“These farms rely on fake and compromised accounts as well as incentivized collusion networks where users are paid for actions from their account [50].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [50] [50] B. Viswanath, M. A. Bashir, M. Crovella, S. Guha, K. P. Gummadi, B. Krishnamurthy, and A. Mislove. Towards Detecting Anomalous User Behavior in Online Social Networks. In Usenix Security , 2014. -
Not checked in the free run.
May combine two claims.
Interpretationown data§ 2.2 Location and Demographics Analysis · p. 3The location result supports Facebook's claim that the percentage of accounts that are duplicate or false is meaningfully lower in developed markets such as the United States or United Kingdom and higher in developing markets such as India and Turkey.
“The location result supports Facebook's claim that 'the percentage of accounts that are duplicate or false is meaningfully lower in developed markets such as the United States or United Kingdom and higher in developing markets such as India and Turkey.' 3”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [3] [3] P. R. Badri Satya, K. Lee, D. Lee, T. Tran, and J. J. Zhang. Uncovering fake likers in online social networks. In CIKM , 2016. - source
Not checked in the free run.
May combine two claims.
Interpretationown data§ Abstract · p. 1Some like farms seem to be operated by bots and do not really try to hide the nature of their operations.
“First, we analyze likes based on demographic, temporal, and social characteristics, and find that some farms seem to be operated by bots and do not really try to hide the nature of their operations, while others follow a stealthier approach, mimicking regular users' behavior.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
May combine two claims.
Interpretationown data§ 2.6 Discussion · p. 8Other farms, like BoostLikes, follow a much stealthier approach, aiming to mimic regular users' behavior, and rely on their large and well-connected network structure to disseminate the target likes while keeping a small count of likes per user.
“(2) other farms, like BoostLikes, follow a much stealthier approach, aiming to mimic regular users' behavior, and rely on their large and wellconnected network structure to disseminate the target likes while keeping a small count of likes per user.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationown data§ 2.4 Social Graph Analysis · p. 5Dense friendship relations among BoostLikes likers indicate an interconnected network of either real users or fake users who mimic complex ties to pose as real users.
“Dense relations between likers from BoostLikes point to an interconnected network of real users, or fake users who mimic complex ties to pose as real users;”
Quote in the paperSubstantial claimClassified as probably not a substantial claim. May combine two claims.
Premisecitation§ 1.1 Roadmap · p. 2SynchroTrap relies on the fact that malicious accounts usually perform loosely synchronized actions in a variety of social network context, and can cluster malicious accounts that act similarly at around the same time for a sustained period of time.
“Another one, SynchroTrap, relies on the fact that malicious accounts usually perform loosely synchronized actions in a variety of social network context, and can cluster malicious accounts that act similarly at around the same time for a sustained period of time [10].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [10] [10] Q. Cao, X. Yang, J. Yu, and C. Palow. Uncovering Large Groups of Active Malicious Accounts in Online Social Networks. In CCS , 2014. - source
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Study design and conductnone given§ 3.1 Re-Crawling · p. 8All data was encrypted at rest and has not been redistributed.
“Also, all data was encrypted at rest and has not been redistributed.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationreasoning§ 3.2 Experimental Evaluation of Co-Clustering · p. 9Stealthy like farms, such as BL-USA, use the tactic of liking popular pages aiming to mimic normal users, which reduces the accuracy of the graph co-clustering algorithm.
“We deduce that stealthy like farms, such as BL-USA, use the tactic of liking popular pages aiming to mimic normal users, which reduces the accuracy of the graph co-clustering algorithm.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Interpretationreasoning§ 2.4 Social Graph Analysis · p. 5The pairs and occasionally triplets characterizing SocialFormula likers might indicate a different strategy of constructing fake networks, mitigating the risk that identification of a user as fake would bring down the whole connected network of fake users.
“The pairs (and occasionally triplets) that characterize SocialFormula likers might indicate a different strategy of constructing fake networks, mitigating the risk that identification of a user as fake would consequently bring down the whole connected network of fake users;”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Study design and conductnone given§ 3.1 Re-Crawling · p. 8Data61's legal team classified the research as exempt and the ethics committee of UCL approved it.
“We also consulted Data61's legal team, which classified our research as exempt and likewise, received approval from the ethics committee of UCL.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationown data§ 2.6 Discussion · p. 8The accounts' termination might be indicative of the disposable nature of fake accounts on most like farms, where 'bot-like' patterns are actually easy to detect.
“Although occurring not so frequently, the accounts' termination might be indicative of the disposable nature of fake accounts on most like farms, where 'bot-like' patterns are actually easy to detect.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationown data§ 2.6 Discussion · p. 8Most fake likes exhibit some peculiar characteristics - including demographics, likes, temporal and social graph patterns - that can and should be exploited by like fraud detection algorithms.
“We also show that most fake likes exhibit some peculiar characteristics - including demographics, likes, temporal and social graph patterns - that can and should be exploited by like fraud detection algorithms.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationown data§ 2.6 Discussion · p. 8Some farms, like SocialFormula and AuthenticLikes, seem to be operated by bots and do not really try to hide the nature of their operations, as demonstrated by large bursts of likes and the limited number of friends per profile.
“Overall, we identified two main modi operandi : (1) some farms, like SocialFormula and AuthenticLikes, seem to be operated by bots and do not really try to hide the nature of their operations, as demonstrated by large bursts of likes and the limited number of friends per profile;”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Interpretationown data§ 2.4 Social Graph Analysis · p. 5Friendship relations between AuthenticLikes and MammothSocials likers might indicate that the same operator manages both services.
“The friendship relations between AuthenticLikes and MammothSocials likers might indicate that the same operator manages both services.”
Quote in the paperNot a substantial claimMay combine two claims.
Premisecitation§ 3.2 Experimental Evaluation of Co-Clustering · p. 9The clusters identified in the user-page bipartite graph represent near-bipartite cores, and the set of users in a near-bipartite core like the same set of pages.
“Similar to CopyCatch [4] and SynchroTrap [10], the clusters identified in the user-page bipartite graph represent near-bipartite cores, and the set of users in a near-bipartite core like the same set of pages.”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [4] [4] A. Beutel, W. Xu, V. Guruswami, C. Palow, and C. Faloutsos. CopyCatch: Stopping Group Attacks by Spotting Lockstep Behavior in Social Networks. In WWW , 2013. - source
Not checked in the free run.
- cites [10] [10] Q. Cao, X. Yang, J. Yu, and C. Palow. Uncovering Large Groups of Active Malicious Accounts in Online Social Networks. In CCS , 2014. - source
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Premisecitation§ 1.1 Roadmap · p. 2Facebook reports that 'false' accounts are less prevalent in developed markets and more in developing markets.
“The other three target one developed and two developing countries, as Facebook reports that 'false' accounts are less prevalent in developed markets and more in developing markets. 1”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [1] [1] A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM , 2008. - source
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Study design and conductown data§ 3.1 Re-Crawling · p. 8Besides some accounts having become inactive (376), the paper could not crawl the timeline of 24 users who had restricted visibility, and in Fall 2015 Facebook blocked all crawling accounts, so they missed further 109 users.
“Besides some accounts having become inactive (376), we also could not crawl the timeline of 24 users who had restricted the visibility of their timeline. Moreover, in Fall 2015, Facebook blocked all the accounts we were using for crawling, and so we stopped our data collection before we could completely finish our data collection, hence, we missed further 109 users.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.
Interpretationnone given§ 2.5 Page Like Analysis · p. 6These users like a large number of pages because they are probably reused for multiple 'jobs' and also like 'normal' pages to mimic real users.
“We argue that these users like a large number of pages because they are probably reused for multiple 'jobs' and also like 'normal' pages to mimic real users.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductown data§ 3.1 Re-Crawling · p. 8The paper collected openly available data such as public profile and timeline information, as well as page likes.
“Again, note that we collected openly available data such as (public) profile and timeline information, as well as page likes.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationreasoning§ 2.6 Discussion · p. 8Like farms such as BoostLikes exhibit patterns closely resembling real users' behavior, thus making fake like detection quite difficult.
“It also mirrors the challenge Facebook is confronted by, with like farms such as BoostLikes that exhibit patterns closely resembling real users' behavior, thus making fake like detection quite difficult.”
Quote in the paperSubstantial claimMay combine two claims.
Study design and conductown data§ 3.2 Experimental Evaluation of Co-Clustering · p. 9The crawlers were restricted to crawl the behavior of all like farms and baseline users on daily basis, so the paper does not have fine-grained features to further analyze CopyCatch and SynchroTrap.
“Given that our crawlers were restricted to crawl the behavior of all like farms and baseline users on daily basis, we do not have fine-grained features to further analyze CopyCatch and SynchroTrap.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationown data§ 3 Limitations of Graph Co-Clustering Techniques · p. 8Some stealthy like farms seem to deliberately modify their behavior in order to avoid synchronized patterns, which might reduce the effectiveness of these detection tools.
“However, as shown in Section 2, some stealthy like farms seem to deliberately modify their behavior in order to avoid synchronized patterns, which might reduce the effectiveness of these detection tools.”
Quote in the paperSubstantial claimClassified as probably not a substantial claim.
Premisecitation§ 1.1 Roadmap · p. 2CopyCatch detects lockstep page like patterns by analyzing the social graph between users and pages, and the times at which the edges in the graph are created.
“One currently deployed tool is CopyCatch, which detects lockstep page like patterns by analyzing the social graph between users and pages, and the times at which the edges in the graph are created [4].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [4] [4] A. Beutel, W. Xu, V. Guruswami, C. Palow, and C. Faloutsos. CopyCatch: Stopping Group Attacks by Spotting Lockstep Behavior in Social Networks. In WWW , 2013. - source
Not checked in the free run.
May combine two claims.
Study design and conductreasoning§ 4.2 Analysis of Lexical Features · p. 10The analysis is limited to English-only content and may be statistically biased toward non-native English speakers, i.e., non-USA campaign users.
“We acknowledge that our analysis is limited to English-only content and may be statistically biased toward non-native English speakers i.e., nonUSA campaign users.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationreasoning§ 4.1 Analysis of Non-Lexical Features · p. 10Posts produced by like farm users gather more likes and have lower lexical richness, which might indicate their attempt to mask suspicious activities.
“Therefore, posts produced by the former gather more likes (and also have lower lexical richness as shown later on in Table 6), which might actually indicate their attempt to mask suspicious activities.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductreasoning§ 3.1 Re-Crawling · p. 8No personal information was extracted as only aggregated statistics were analyzed.
“No personal information was extracted as we only analyzed aggregated statistics.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim.
Premisecitation§ 3.1 Re-Crawling · p. 8The experiments rely on a baseline of 1,408 random accounts from Chen et al. [14] used to form a baseline of 'normal' accounts.
“In our experiments, we will also rely on a baseline of 1,408 random accounts from Chen et al. [14] which we use to form a baseline of 'normal' accounts.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [14] [14] T. Chen, A. Chaabane, P. U. Tournoux, M.-A. Kaafar, and R. Boreli. How Much is too Much? Leveraging Ads Audience Estimation to Evaluate Public Profile Uniqueness. In PETS , 2013. - source
Not checked in the free run.
May combine two claims.
Interpretationreasoning§ 3 Limitations of Graph Co-Clustering Techniques · p. 8While several farms use a large number of accounts (possibly fake or compromised) liking target pages within a short timespan, some spread likes over longer timespans and onto popular pages aiming to circumvent fraud detection algorithms.
“Specifically, while several farms use a large number of accounts (possibly fake or compromised) liking target pages within a short timespan, some spread likes over longer timespans and onto popular pages aiming to circumvent fraud detection algorithms.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Study design and conductreasoning§ 2.4 Social Graph Analysis · p. 5Some friendship relations may be hidden, e.g., if a friend chose to be invisible in friend lists, thus, these numbers only represent a lower bound.
“Some friendship relations may be hidden, e.g., if a friend chose to be invisible in friend lists, thus, these numbers only represent a lower bound .”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationown data§ 2.6 Discussion · p. 8The paper provides strong evidence that likers attracted on honeypot pages, even when using legitimate Facebook campaigns, are significantly different from typical Facebook users, which confirms concerns about the genuineness of these likes.
“However, we do provide strong evidence that likers attracted on our honeypot pages, even when using legitimate Facebook campaigns, are significantly different from typical Facebook users, which confirms the concerns about the genuineness of these likes.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationreasoning§ 6 Related Work · p. 17The paper uses timeline features, relying on both lexical and non-lexical features, to build a classifier that detects stealthy like farm users with high accuracy.
“As a result, we use timeline features, relying on both lexical and non-lexical features to build a classifier that detects stealthy like farm users with high accuracy.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationown data§ 7 Conclusion · p. 17The paper's analysis revealed two main modi operandi: some farms seem to be operated by bots and do not really try to hide their operations, while others follow a stealthier approach, mimicking regular users' behavior.
“Our demographic, temporal, and social graph analysis highlighted similar patterns between accounts across different like farms and revealed two main modi operandi: some farms seem to be operated by bots and do not really try to hide the nature of their operations, while others follow a stealthier approach, mimicking regular users' behavior.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationown data§ 5 Timeline-based Detection of Like Farms · p. 14Like farm users use shorter words and fewer words in their timeline posts than baseline users.
“This finding suggests that like farm users use shorter words and fewer number of words in their timeline posts as compared to baseline users.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationown data§ 6 Related Work · p. 17While some farms seem to be operated by bots and do not try to hide their activities, other stealthier farms exhibit behavior that may be challenging to detect with tools like CopyCatch and SynchroTrap.
“However, as discussed earlier, while some farms seem to be operated by bots (producing large bursts of likes and having limited numbers of friends) that do not really try to hide their activities, other stealthier farms exhibit behavior that may be challenging to detect with tools like CopyCatch and SynchroTrap.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Premisenone given§ 6 Related Work · p. 16Twitter follower markets differ from Facebook like farms because Twitter entails a follower-followee relationship while Facebook friendships are bidirectional, and there is no equivalent of liking a Facebook page in the Twitter ecosystem.
“Note that Twitter follower markets differ from Facebook like farms as Twitter entails a follower-followee relationship among users, while Facebook friendships imply a bidirectional relationships. Also, there is no equivalent of liking a Facebook page in the Twitter ecosystem.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Interpretationnone given§ 6 Related Work · p. 17The paper's work can complement other methods used in prior work to detect fake and compromised accounts, such as unsupervised anomaly detection, temporal features, IP addresses, and generic supervised learning.
“Finally, we highlight that our work can complement other methods used in prior work to detect fake and compromised accounts, such as using unsupervised anomaly detection techniques [50], temporal features [23, 24], IP addresses [45], as well as generic supervised learning [3].”
Quote in the paperNot a substantial claim0 of 4 sources checked- cites [50] [50] B. Viswanath, M. A. Bashir, M. Crovella, S. Guha, K. P. Gummadi, B. Krishnamurthy, and A. Mislove. Towards Detecting Anomalous User Behavior in Online Social Networks. In Usenix Security , 2014. -
Not checked in the free run.
- cites [23] [23] M. Jiang, P. Cui, A. Beutel, C. Faloutsos, and S. Yang. CatchSync: Catching Synchronized Behavior in Large Directed Graphs. In KDD , 2014. - source
Not checked in the free run.
- cites [24] [24] M. Jiang, P. Cui, A. Beutel, C. Faloutsos, and S. Yang. Inferring Strange Behavior from Connectivity Pattern in Social Networks. In PAKDD , 2014. - source
Not checked in the free run.
- cites [45] [45] G. Stringhini, P. Mourlanne, G. Jacob, M. Egele, C. Kruegel, and G. Vigna. EvilCohort: Detecting Communities of Malicious Accounts on Online Services. In Usenix Security , 2015. -
Not checked in the free run.
May combine two claims.
Interpretationown data§ 4.2 Analysis of Lexical Features · p. 10Normal users use a richer vocabulary and their posts have higher readability than like farm users.
“In comparison to like farm users, baseline users post text with higher lexical richness (70% vs. 55%), ARI (20 vs. 15), and Flesch score (55 vs. 48), thus suggesting that normal users use a richer vocabulary and that their posts have higher readability.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationown data§ 6 Related Work · p. 15The paper's analysis confirms some insights used by sybil detection algorithms and reveals new patterns that could complement them.
“In fact, our analysis does not only confirm a few insights used by sybil detection algorithms but also reveals new patterns that could complement them.”
Quote in the paperNot a substantial claimMay combine two claims.
Study design and conductnone given§ 6 Related Work · p. 15The paper's honeypot pages explicitly indicated they were not 'real' to deflect real profiles, and actively attracted fake profiles by means of paid campaigns, as opposed to passive honeypot profiles.
“Our work also differs from theirs in that (1) their honeypot profiles were designed to look legitimate, while our honeypot pages explicitly indicated they were not 'real' (to deflect real profiles), and (2) our honeypot pages actively attracted fake profiles by means of paid campaigns, as opposed to passive honeypot profiles.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based).
Study design and conductnone given§ 5 Timeline-based Detection of Like Farms · p. 13Lexical features may be affected by geographical location especially if one set of users who write in English are native speakers while the other set is not.
“While building a classifier based on lexical features performs very well in detecting fake accounts, we acknowledge that lexical features may be affected by geographical location especially if one set of users who write in English are native speakers while the other set is not.”
Quote in the paperNot a substantial claim
The paper relies on this without support.
There has been little work that systematically analyzes and compares Facebook page promotion methods.
“However, even though the understanding of fake likes is crucial to improve fraud mitigation in social networks, there has been little work to systematically analyze and compare Facebook page promotion methods.”
The authors state this as an assumption.
Likers from farms that like empty honeypot pages are either fake or compromised real users (fake likes).
“we start our study with the assumption that likers from farms that like our empty honeypot pages are either fake or compromised real users (i.e., fake likes) as shown in [50].”
The authors state this as an assumption.
Selling likes may yield significant profits for fraudsters.
“it is not far fetched to assume that selling likes may yield significant profits for fraudsters.”
The paper relies on this without support.
Like farms typically rely on pre-defined lists of comments, resulting in word repetition and lower lexical richness.
“Like farms typically rely on pre-defined lists of comments, resulting in word repetition and lower lexical richness.”
The paper relies on this without support.
Like farms either heavily automate mechanisms or rely on manual input of cheap human labor.
“However, like farms either heavily automate mechanisms or rely on manual input of cheap human labor.”
The authors state this as an assumption.
Fractions of like farm users mimic all features of baseline users, and all like farm users mimic sets of baseline users' features.
“we assume two worst case attacking scenarios: (i) fractions of like farms users mimic all features of baseline users; and (ii) all like farm users mimic sets of baseline users' features”
The authors state this as an assumption.
In the first scenario, sets of like farm users randomly select baseline users and aggressively replace the values of all their features with that of the selected baseline users.
“We simulate the first scenario by assuming that sets of like farm users randomly select baseline users and aggressively replace the values of all their features with that of the selected baseline users.”
The authors state this as an assumption.
In the latter case, all like farm users coordinate and select sets of features from randomly selected baseline users that they copy or mimic.
“For the latter case, we assume that all like farms users coordinate and select sets of features from randomly selected baseline users that they copy or mimic.”
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?
Malicious actors continuously evolve their behaviors to evade platform detection.
“malicious actors continuously evolve their behaviors to evade platform detection [40, 58]”
From Six Million (Suspected) Fake Stars on GitHub: A Growing Spiral of Popularity Contests, Spams, and Malware (2026) · cites this paper as [58]
The Roadmap (p. 2) says stealthier like farms circumvent detection by spreading likes over longer periods and mimicking normal users. Timeline-based Detection (p. 15) describes evasion as an arms race, but the paper does not establish that malicious actors generally or continuously evolve their behavior over time. (LLM, conf=0.86)
Experimental — accuracy not yet measuredSome providers generate fake popularity signals using automated bots, while others use realistic accounts and even crowdsourced real humans.
“some providers generate fake popularity signals using automated bots (aka. sybils), but some others use realistic accounts and even crowdsourced real humans (aka. crowdturfing) [58, 83, 84, 93, 100].”
From Six Million (Suspected) Fake Stars on GitHub: A Growing Spiral of Popularity Contests, Spams, and Malware (2026) · cites this paper as [58]
Facebook Like farms are still able to maneuver through detection techniques by mimicking realistic user activities and violating the techniques' built-in assumptions.
“Ikram et al. [58] show that the Facebook Like farms are still able to maneuver through these techniques by mimicking realistic user activities and violating the techniques' built-in assumptions (e.g., assuming that fake Likes happen in bursts [30]).”
From Six Million (Suspected) Fake Stars on GitHub: A Growing Spiral of Popularity Contests, Spams, and Malware (2026) · cites this paper as [58]
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.
AL-USA non-lexical recall is miscalculated
MajorTable 7's 113 true positives and four false negatives give approximately 97% recall, rather than 69%.
Reported 69 · recomputed 96.581197
“| AL-USA | 827 | 662 | 164 | 113 | 51 | 278 | 4 | 97% | 69% | 88% | 81% |”
BL-USA non-lexical recall is miscalculated
MajorWith 37 true positives and 12 false negatives, recall is about 76%, not the reported 32%.
Reported 32 · recomputed 75.510204
“| BL-USA | 583 | 466 | 117 | 37 | 80 | 270 | 12 | 76% | 32% | 77% | 45% |”
SF-USA non-lexical precision is miscalculated
MajorTable 7's 110 true positives and 21 false positives give approximately 84% precision, rather than 96%.
Reported 96 · recomputed 83.969466
“| SF-USA | 653 | 522 | 131 | 110 | 21 | 277 | 5 | 96% | 84% | 94% | 90% |”
AL-USA non-lexical precision is miscalculated
MajorTable 7's 113 true positives and 51 false positives give approximately 69% precision, rather than 97%.
Reported 97 · recomputed 68.902439
“| AL-USA | 827 | 662 | 164 | 113 | 51 | 278 | 4 | 97% | 69% | 88% | 81% |”
SF-ALL non-lexical precision is miscalculated
MajorTable 7's 139 true positives and 35 false positives give approximately 80% precision, rather than 94%.
Reported 94 · recomputed 79.885057
“| SF-ALL | 870 | 696 | 174 | 139 | 35 | 273 | 9 | 94% | 80% | 90% | 86% |”
Conflicting totals for the original honeypot campaigns
MajorSection 2 reports 6,222 likes from the campaigns, but Section 3 says those campaigns garnered 5,918 likes. The latter is presented as a recap of the original measurement, not as the result of the later re-crawl.
“Overall, we collected a total of 6,222 likes (4,453 from like farms and 1,769 from Facebook ads).”
“Recall (from Section 2) that we garnered 5,918 likes from 5,616 unique users”
BL-USA non-lexical precision is miscalculated
MajorTable 7 reports 37 true positives and 80 false positives. Under the paper's stated definition, precision is 37/(37+80), or about 32%, not 76%.
Reported 76 · recomputed 31.623932
“| BL-USA | 583 | 466 | 117 | 37 | 80 | 270 | 12 | 76% | 32% | 77% | 45% |”
English-post ratio has two different denominators
MinorThe method defines the ratio as English posts divided by all posts, whereas the figure caption calls it English posts divided by non-English posts. Those are different quantities.
“For each user, we count the number of English-language posts and calculate its ratio with respect to the total number of posts.”
“Figure 9: Distributions of the ratio of English posts to non-English posts.”
Posts attributed to inactive worldwide campaigns
MinorThe language analysis refers to users of MS-ALL and BL-ALL, although the campaign summary says neither campaign produced any likes.
“while users of worldwide campaigns (MS-ALL, BL-ALL, AL-ALL) have significantly fewer posts in English.”
“Note that the BL-ALL and MS-ALL campaigns remained inactive, i.e., they did not result in any likes even though we were charged in advance.”
Reported minimum F1-score decrease omits a 20% result
MinorThe text says the eight-feature attack reduces F1-score by 26% to 56%, but Table 11 gives a 20% decrease for AL-USA.
“The F1-Score of our classifier decreases by between 26% to 56% when the like farm users target sets of 8 features including prominent ones (cf. Figure 10).”
“| AL-USA | 2% | 4% | 5% | 10% | 20% |”
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538 · cited 6× · see citing works
“Due to overfitting on our dataset, Random Forest and Na¨ıve Bayes show poor results and require mechanism such as pruning, detailed analysis of parameters, as well as selection of the optimal set of prominent features to improve classification performance [26, 6].”
MethodInfluentialClassification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 21,028 · see citing works
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466 · see citing works
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 9,743 · see citing works
Estimating the Support of a High-Dimensional Distribution
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168 · cited 1× · see citing works
“Appropriate values for parameters γ (radial basis function kernel parameter (Schölkopf et al. 2001)) and υ (SVM parameter) are set empirically by performing a greedy grid search on ranges 2−10 ≤ γ ≤ 2 and 2−10 ≤ υ ≤ 2, respectively, on each training group.”
MethodFlesch, R. (1948) · Journal of Applied Psychology · doi:10.1037/h0057532 · Cited by 5,391 · cited 1× · see citing works
“, emoticons), and measure the lexical richness, as well as the Automated Readability Index (ARI) [38] and Flesch score [19].”
An introduction to kernel-based learning algorithms
Müller, K. R., Mika, S., Rätsch, G., Tsuda, K., & Schölkopf, B. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.914517 · Cited by 3,485 · cited 12× · see citing works
“Aiming to automatically distinguish like farm users from normal (baseline) users, we use a supervised two-class SVM classifier [33], implemented using scikit-learn [8] (an open source machine learning library for Python).”
MethodInfluentialAPI design for machine learning software: experiences from the scikit-learn projectPreprint
Buitinck, L., Louppe, G., Blondel, M., Pedregosa, F., Mueller, A., Grisel, O., Niculae, V., Prettenhofer, P., Gramfort, A., Grobler, J., et al. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.0238 · Cited by 2,387 · see citing works
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM · doi:10.1145/1327452.1327494 · Cited by 1,437 · cited 2× · see citing works
“Finally, we generalize our approach using other classification algorithms, namely, decision tree [7], AdaBoost [20], kNN [1], random forest [6], and naı̈ve Bayes [55], and empirically confirm that the SVM classifier achieves higher accuracy across the board.”
MethodThe Optimality of Naive Bayes.
Zhang, H. (2004) · Cited by 1,391 · see citing works
Detecting spammers on social networks
Stringhini, G., Kruegel, C., & Vigna, G. (2010) · Proceedings of the 26th Annual Computer Security Applications Conference · doi:10.1145/1920261.1920263 · Cited by 791 · cited 2× · see citing works
“[44] created honeypot profiles in Facebook, MySpace, and Twitter to detect spammers while we use accounts attracted by our honeypot Facebook pages that actively engage like farms.”
MethodYu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. D. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159945 · Cited by 734 · see citing works
Spectral Biclustering of Microarray Data: Coclustering Genes and ConditionsPreprint
Kluger, Y., Basri, R., Chang, J. T., & Gerstein, M. (2003) · Genome Research · doi:10.1101/gr.648603 · Cited by 726 · cited 1× · see citing works
“We use the labeled dataset of 3,670 users from six different like farms and the 1,408 baseline users and employ a graph co-clustering algorithm to divide the user-page bipartite graph into distinct clusters (Kluger et al. 2003).”
MethodUncovering social spammers: social honeypots + machine learning
Lee, K., Caverlee, J., & Webb, S. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835522 · Cited by 619 · cited 1× · see citing works
“Unlike [30, 44], we leverage timeline-based features for the detection of fake accounts.”
MethodArabic Natural Language Processing: Challenges and Solutions
Farghaly, A., & Shaalan, K. (2009) · ACM Transactions on Asian Language Information Processing · doi:10.1145/1644879.1644881 · Cited by 557 · cited 1× · see citing works
“We constrain our analysis to only English language and argue that lexical features extractions and analysis could be extended for other non-English Language such as Chinese [56, 57], French [39], and Arabic [18], and Hindi/Urdu [49].”
Smith, E. A., & Senter, R. J. (1967) · PubMed · Cited by 544 · see citing works
HHMM-based Chinese lexical analyzer ICTCLAS
Zhang, H., Yu, H., Xiong, D., et al. (2003) · doi:10.3115/1119250.1119280 · Cited by 455 · cited 1× · see citing works
“We constrain our analysis to only English language and argue that lexical features extractions and analysis could be extended for other non-English Language such as Chinese [56, 57], French [39], and Arabic [18], and Hindi/Urdu [49].”
Aiding the detection of fake accounts in large scale social online services
Cao, Q., Sirivianos, M., Yang, X., & Pregueiro, T. (2012) · Cited by 449 · see citing works
Suspended accounts in retrospect: an analysis of twitter spam
Thomas, K., Grier, C., Song, D., & Paxson, V. (2011) · Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference · doi:10.1145/2068816.2068840 · Cited by 439 · cited 1× · see citing works
“Nazir et al. [34] studied phantom profiles in Facebook gaming applications, while Thomas et al. [47] analyzed over 1.1 million accounts suspended by Twitter.”
BackgroundInfluentialDetecting and characterizing social spam campaigns
Gao, H., Hu, J. S., Wilson, C., Li, Z., Chen, Y., & Zhao, B. Y. (2010) · ACM Internet Measurement Conference (IMC) · doi:10.1145/1879141.1879147 · Cited by 420 · see citing works
SybilInfer: Detecting Sybil Nodes using Social Networks.
Danezis, G., & Mittal, P. (2009) · Cited by 407 · see citing works
CopyCatch: stopping group attacks by spotting lockstep behavior in social networks
Beutel, A., Xu, W., Guruswami, V., Palow, C., & Faloutsos, C. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488400 · Cited by 335 · cited 6× · see citing works
“We then evaluated the effectiveness of existing graph based fraud detection algorithms, such as CopyCatch [4] and SynchroTrap [10], and demonstrated that sophisticated like farms can successfully evade detection.”
MethodResultInfluentialYang, C., Harkreader, R., Zhang, J., Shin, S., & Gu, G. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187847 · Cited by 299 · see citing works
Uncovering Large Groups of Active Malicious Accounts in Online Social Networks
Cao, Q., Yang, X., Yu, J., & Palow, C. (2014) · Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2660267.2660269 · Cited by 274 · cited 6× · see citing works
“Another one, SynchroTrap, relies on the fact that malicious accounts usually perform loosely synchronized actions in a variety of social network context, and can cluster malicious accounts that act similarly at around the same time for a sustained period of time [10].”
BackgroundMethodResultInfluentialFeature subset selection using the wrapper method: overfltting and dynamic search space topology
Kohavi, R., & Sommerfield, D. (1995) · Knowledge Discovery and Data Mining · Cited by 260 · see citing works
SybilGuard: defending against sybil attacks via social networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. (2006) · Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1159913.1159945 · Cited by 260 · cited 1× · see citing works
“Prior work has focused quite extensively on the analysis and the detection of sybil and/or fake accounts in online social networks by relying on tightly-knit community structures [54, 15, 53, 9, 52, 5].”
BackgroundTrafficking fraudulent accounts: the role of the underground market in Twitter spam and abuse
Thomas, K., McCoy, D., Grier, C., Kolcz, A., & Paxson, V. (2013) · Cited by 239 · see citing works
Towards Detecting Anomalous User Behavior in Online Social Networks
Viswanath, B., Gummadi, K. P., Bashir, M. A., Krishnamurthy, B., Crovella, M. E., Guha, S., & Mislove, A. E. (2014) · Cited by 236 · see citing works
Stringhini, G., Wang, G., Egele, M., Kruegel, C., Vigna, G., Zheng, H., & Zhao, B. Y. (2013) · Proceedings of the 2013 conference on Internet measurement conference · doi:10.1145/2504730.2504731 · Cited by 169 · cited 1× · see citing works
“In a similar study, Stringhini et al. [43, 46] The difference in F1-Score obtained when all like farm users coordinate and mimic sets of lexical and non-lexical features of baseline users.”
ResultUncovering social network sybils in the wild
Yang, Z., Wilson, C., Wang, X., Gao, T., Zhao, B. Y., & Dai, Y. (2011) · Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference · doi:10.1145/2068816.2068841 · Cited by 164 · cited 1× · see citing works
“Prior work has focused quite extensively on the analysis and the detection of sybil and/or fake accounts in online social networks by relying on tightly-knit community structures [54, 15, 53, 9, 52, 5].”
BackgroundCatchSync: catching synchronized behavior in large directed graphs
Jiang, M., Cui, P., Beutel, A., Faloutsos, C., & Yang, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623632 · Cited by 151 · cited 1× · see citing works
“Finally, we highlight that our work can complement other methods used in prior work to detect fake and compromised accounts, such as using unsupervised anomaly detection techniques [50], temporal features [23, 24], IP addresses [45], as well as generic supervised learning [3].”
MethodMan vs. machine: practical adversarial detection of malicious crowdsourcing workers
Wang, G., Wang, T., Zhang, H., & Zhao, B. Y. (2014) · Cited by 142 · see citing works
Integro: Leveraging Victim Prediction for Robust Fake Account Detection in OSNs
Boshmaf, Y., Logothetis, D., Siganos, G., Leria, J., Lorenzo, J., Ripeanu, M., & Beznosov, K. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23260 · Cited by 134 · cited 1× · see citing works
“Prior work has focused quite extensively on the analysis and the detection of sybil and/or fake accounts in online social networks by relying on tightly-knit community structures [54, 15, 53, 9, 52, 5].”
BackgroundYou Are What You Like! Information Leakage Through Users' Interests
Chaabane, A., Acs, G., & Kâafar, M. A. (2012) · Cited by 128 · see citing works
Self-citationChinese lexical analysis using hierarchical hidden Markov model
Zhang, H., Liu, Q., Cheng, X., et al. (2003) · doi:10.3115/1119250.1119259 · Cited by 122 · cited 1× · see citing works
“We constrain our analysis to only English language and argue that lexical features extractions and analysis could be extended for other non-English Language such as Chinese [56, 57], French [39], and Arabic [18], and Hindi/Urdu [49].”
Measuring and fingerprinting click-spam in ad networks
Dave, V., Guha, S., & Zhang⋆, Y. (2012) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/2342356.2342394 · Cited by 113 · cited 1× · see citing works
“[16] proposed a methodology to measure and fingerprint click-spam in ad networks.”
MethodDe Cristofaro, E., Friedman, A., Jourjon, G., Kaafar, M. A., & Shafiq, M. Z. (2014) · Proceedings of the 2014 Conference on Internet Measurement Conference · doi:10.1145/2663716.2663729 · Cited by 85 · cited 2× · see citing works
“∗A preliminary version of this paper, titled “Paying for Likes? Understanding Facebook Like Fraud Using Honeypots” [17], appeared in the proceedings of the 2014 ACM Internet Measurement Conference (IMC).”
BackgroundResultSelf-citationInferring Strange Behavior from Connectivity Pattern in Social Networks
Jiang, M., Cui, P., Beutel, A., Faloutsos, C., & Yang, S. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-06608-0_11 · Cited by 82 · cited 1× · see citing works
“Finally, we highlight that our work can complement other methods used in prior work to detect fake and compromised accounts, such as using unsupervised anomaly detection techniques [50], temporal features [23, 24], IP addresses [45], as well as generic supervised learning [3].”
MethodStringhini, G., Egele, M., Kruegel, C., & Vigna, G. (2012) · doi:10.1145/2342549.2342551 · Cited by 74 · see citing works
Using rhetorical structure in sentiment analysis
Hogenboom, A., Frasincar, F., de Jong, F., & Kaymak, U. (2015) · Communications of the ACM · doi:10.1145/2699418 · Cited by 71 · cited 1× · see citing works
“Indeed, [22] has shown that the word frequency approach to analyze short text on social media and blogs does not perform well.”
BackgroundEVILCOHORT: detecting communities of malicious accounts on online services
Stringhini, G., Mourlanne, P., Jacob, G., Egele, M., Kruegel, C., & Vigna, G. (2015) · Cited by 66 · see citing works
Natural Language Processing and Information Retrieval
Tiwary, U. S., & Siddiqui, T. J. (2008) · Medical Entomology and Zoology · Cited by 58 · see citing works
You are a Game Bot!: Uncovering Game Bots in MMORPGs via Self-similarity in the Wild
Lee, E., Woo, J., Kim, H., et al. (2016) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2016.23436 · Cited by 55 · cited 1× · see citing works
“In this context, [29] rely on self-similarity to effectively measure the frequency of repeated activities per player over time, and use it to identify bots.”
BackgroundCrowdTarget: Target-based Detection of Crowdturfing in Online Social Networks
Song, J., Lee, S., & Kim, J. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813661 · Cited by 50 · cited 1× · see citing works
“[42] also looked at crowdturfing services that manipulate account popularity on Twitter through artificial retweet and developed “CrowdTarget” to detect such tweets.”
BackgroundCrime Scene Reconstruction: Online Gold Farming Network Analysis
Kwon, H., Mohaisen, A., Woo, J., et al. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2623586 · Cited by 49 · cited 1× · see citing works
“Also, [27] analyze the characteristics of the ecosystem of multiplayer online role-playing games (MMORPGs), and devise a method for detecting gold farming groups (GFGs), based on graph techniques.”
MethodUncovering Fake Likers in Online Social Networks
Badri Satya, P. R., Lee, K., Lee, D., Tran, T., & Zhang, J. (. (2016) · Proceedings of the 25th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2983323.2983695 · Cited by 46 · cited 1× · see citing works
“Finally, we highlight that our work can complement other methods used in prior work to detect fake and compromised accounts, such as using unsupervised anomaly detection techniques [50], temporal features [23, 24], IP addresses [45], as well as generic supervised learning [3].”
MethodNazir, A., Raza, S., Chuah, C., & Schipper, B. C. (2010) · Cited by 35 · see citing works
Measuring and fingerprinting click-spam in ad networks
Dave, V., Guha, S., & Zhang⋆, Y. (2012) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2377677.2377715 · Cited by 31 · see citing works
The Like Economy: How Businesses Make Money With Facebook
Carter, B. S. (2011) · CERN Document Server (European Organization for Nuclear Research) · Cited by 24 · see citing works
The Lexical Analysis of Natural Languages
Silberztein, M. D. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/3007.003.0008 · Cited by 22 · see citing works
How Much Is Too Much? Leveraging Ads Audience Estimation to Evaluate Public Profile Uniqueness
Chen, T., Chaabane, A., Tournoux, P. U., Kaafar, M.-A., & Boreli, R. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39077-7_12 · Cited by 21 · cited 2× · see citing works
“[14] which we use to form a baseline of “normal” accounts.”
MethodSelf-citationThe lexical analysis of French
Silberztein, M. D. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51465-1_7 · Cited by 6 · cited 1× · see citing works
“to errors. We constrain our analysis to only English language and argue that lexical features extractions and analysis could be extended for other non-English Language such as Chinese [56,57], French [39], and Arabic [18], and Hindi/Urdu [49]. We refer the reader to [40] for more details about lexical features used in…”
Background
Flagged first, then by citations
1 of the 53 references couldn’t be matched to a known paper.
Research works printed but not linked: 12
- Buitinck Lars, 2013, Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases Workshop (ECML/PKDD LML’13)
- 10.5555/2228298.2228319 · DOI
- Chaabane A., 2012, Proceedings of the 19th Annual Network and Distributed System Security Symposium (NDSS’12)
- Danezis George, 2009, Proceedings of the 16th Annual Network and Distributed System Security Symposium (NDSS’09)
- Kohavi Ron, 1995, Proceedings of the 1st International Conference on Knowledge Discovery and Data Mining (KDD’95)
- Metzger Richard, 2012, Facebook: I Want My Friends Back.
- Nazir Atif, 2010, Proceedings of the 3rd Wonference on Online Social Networks (WOSN’10)
- Silberztein Max, Proceedings of the LITP Spring School on Theoretical Computer Science: Electronic Dictionaries and Automata in Computational Linguistics
- Thomas Kurt, 2013, Proceedings of the 22nd USENIX Conference on Security (SEC’13)
- Viswanath Bimal, 2014, Proceedings of the 23rd USENIX Security Symposium (USENIX Security’14)
- Wang Gang, Proceedings of the 23rd USENIX Security Symposium (USENIX Security’14)
- Zhang Harry, 2004, Proceedings of the Seventeenth International Florida Artificial Intelligence Research Society Conference (FLAIRS’04)
Cited by
Sorted by citations
‘Fake news’ as infrastructural uncanny
Gray, J., Bounegru, L., & Venturini, T. (2020) · New Media & Society · doi:10.1177/1461444819856912 · Cited by 107 · see citing works
“This has given rise to concerns about fabricated, manipulated and misleading engagement scores to spread ‘fake’, spammy and scammy content through ‘like farms’, ‘like fraud’ and ‘fake likes’ (De Cristofaro et al., 2014; Farooqi et al., 2017; Ikram et al., 2017).”
BackgroundSmoke Screener or Straight Shooter: Detecting Elite Sybil Attacks in User-Review Social Networks
Zheng, H., Xue, M., Lu, H., Hao, S., Zhu, H., Liang, X., & Ross, K. (2018) · Proceedings 2018 Network and Distributed System Security Symposium · doi:10.14722/ndss.2018.23009 · Cited by 61 · see citing works
LOBO: Evaluation of Generalization Deficiencies in Twitter Bot Classifiers
Echeverra, J., De Cristofaro, E., Kourtellis, N., Leontiadis, I., Stringhini, G., & Zhou, S. (2018) · Proceedings of the 34th Annual Computer Security Applications Conference · doi:10.1145/3274694.3274738 · Cited by 61 · see citing works
Self-citationBig data in cybersecurity: a survey of applications and future trends
Alani, M. M. (2021) · Journal of Reliable Intelligent Environments · doi:10.1007/s40860-020-00120-3 · Cited by 62 · see citing works
Systematic Literature Review of Social Media Bots Detection Systems
Ellaky, Z., Benabbou, F., & Ouahabi, S. (2023) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2023.04.004 · Cited by 38 · see citing works
“This work (Ikram, et al., 2017) provided a honeypot-based detection system using SVM and the co-clustering method.”
InfluentialLiked on Facebook, liked for real?: Nonprofits' online popularity and financial performance
Lee, Y. (2020) · Nonprofit Management and Leadership · doi:10.1002/nml.21447 · Cited by 31 · see citing works
Computational Mining of Social Media to Curb Terrorism
Almoqbel, M. Y., & Xu, S. (2019) · ACM Computing Surveys · doi:10.1145/3342101 · Cited by 28 · see citing works
“The model leverages both lexical and non-lexical features and achieves a detection precision of more than 99% with 93% recall (Ikram et al. 2017).”
BackgroundMaking up Audience: Media Bots and the Falsification of the Public Sphere
Santini, R. M., Salles, D., Tucci, G., Ferreira, F., & Grael, F. (2020) · Communication Studies · doi:10.1080/10510974.2020.1735466 · Cited by 22 · see citing works
“Similarly, on Facebook, a growing industry of “ like farms ” can be used to arti fi cially in fl ate the number of likes of a page or pro fi le (Ikram et al., 2017).”
BackgroundInfluentialDetecting and Analyzing Collusive Entities on YouTube
Dutta, H. S., Jobanputra, M., Negi, H., & Chakraborty, T. (2021) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3477300 · Cited by 24 · see citing works
A Decade of Mal-Activity Reporting
Zhao, B. Z. H., Ikram, M., Asghar, H. J., Kâafar, M. A., Chaabane, A., & Thilakarathna, K. (2019) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/3321705.3329834 · Cited by 22 · see citing works
Self-citationUnderstanding Incentivized Mobile App Installs on Google Play Store
Farooqi, S., Feal, Á., Lauinger, T., McCoy, D., Shafiq, Z., & Vallina-Rodriguez, N. (2020) · Proceedings of the ACM Internet Measurement Conference · doi:10.1145/3419394.3423662 · Cited by 22 · see citing works
“and Instagram [25–27, 32, 57, 58, 61, 63].”
Self-citationSocial media ills and evolutionary mismatches: a conceptual framework
Lim, A. J., & Tan, E. (2024) · Evolutionary Psychological Science · doi:10.1007/s40806-024-00398-z · Cited by 18 · see citing works
“…incentives to be prioritized by the algorithm, some businesses and content creators are also known to purchase underground services that artificially inflate “Likes” and following counts (Ikram et al., 2017), further diluting the quality of “Likes” and followers as a metric of social approval.”
CanaryTrap: Detecting Data Misuse by Third-Party Apps on Online Social Networks
Farooqi, S., Musa, M. B., Shafiq, Z., et al. (2020) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2020-0076 · Cited by 14 · see citing works
“Popular online social networks such as Facebook and Twitter have millions of third-party apps that are used by hundreds of millions of users [8, 20, 39].”
BackgroundInfluentialSelf-citationDeepMUI : A novel method to identify malicious users on online social network platforms
Shah, A., Varshney, S., & Mehrotra, M. (2023) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.7917 · Cited by 11 · see citing works
Understanding Promotion-as-a-Service on GitHub
Du, K., Yang, H., Zhang, Y., Duan, H., Wang, H., Hao, S., Li, Z., & Yang, M. (2020) · Annual Computer Security Applications Conference · doi:10.1145/3427228.3427258 · Cited by 9 · see citing works
“Similarly, the underground market for boosting page likes has emerged in Facebook and attracted considerable attentions [24, 28, 33].”
BackgroundResearch on relation extraction of named entity on social media in smart cities
Liu, Z., & Chen, X. (2020) · Soft Computing · doi:10.1007/s00500-020-04742-w · Cited by 8 · see citing works
BotDMM: Dual-channel multi-modal learning for LLM-driven bot detection on social media
Duan, J., Wu, S., Li, W., Bai, Q., Nguyen, M., & Jiang, J. (2025) · Information Fusion · doi:10.1016/j.inffus.2025.103758 · Cited by 7 · see citing works
Measurement and Early Detection of Third-Party Application Abuse on Twitter
Farooqi, S., & Shafiq, Z. (2019) · International World Wide Web Conference (WWW) · doi:10.1145/3308558.3313515 · Cited by 6 · see citing works
“There is a large body of prior work on the detection of fake or compromised accounts in online social networks [21, 24, 25, 28, 34, 40, 42, 43, 49, 53, 54, 59, 61, 62].”
BackgroundSelf-citationBotICC: enhancing social bot detection through implicit connection computation
Guo, S., Wang, J., Wang, Z., Yu, G., & Wu, S. (2025) · Multimedia Systems · doi:10.1007/s00530-025-01822-5 · Cited by 5 · see citing works
“A variety of features, ranging from simple to complex, have been developed to train classifiers such as Random Forests [9, 10] and Support Vector Machine(SVM) [11, 12].”
Zhao, B. Z. H., Ikram, M., Asghar, H. J., Kâafar, M. A., Chaabane, A., & Thilakarathna, K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.10629 · Cited by 5 · see citing works
Self-citationScalable Similarity Joins of Tokenized Strings
Metwally, A., & Huang, C.-H. (2019) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2019.00193 · Cited by 4 · see citing works
“Filtering abusive ads traffic was studied in [15], [16], [41], [44], [46], [58], and fake likes and promotion on social networks was studied in [17], [28].”
BackgroundHe, 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 2 · see citing works
“For the latter scenario, a recurring observation from prior research is that some providers generate fake popularity signals using automated bots (aka. sybils), but some others use realistic accounts and even crowdsourced real humans (aka. crowdturfing) [57, 80, 81, 90, 97].”
InfluentialZombie Follower Recognition Based on Industrial Chain Feature Analysis
Tang, J., Xu, H., Cheng, P., Liu, J., Huang, C., & Tang, X. (2021) · Security and Communication Networks · doi:10.1155/2021/6656470 · Cited by 1 · see citing works
“Although the features and detection of zombie followers have been extensively studied, zombie followers are continuously increasing in online social networks and gradually developing into an industry [26, 32].”
BackgroundTowards Automatic Annotation and Detection of Fake News
Akhtar, M. M., Karunanayake, I., Sharma, B., Masood, R., Ikram, M., & Kanhere, S. S. (2023) · Conference on Local Computer Networks · doi:10.1109/lcn58197.2023.10223359 · Cited by 2 · see citing works
Self-citationExploring Interactional Metadiscourse in Content Farms and Formal News Agencies
Chang, Y. (2024) · International Journal of Applied Linguistics · doi:10.1111/ijal.12657 · Cited by 1 · see citing works
Scalable Similarity Joins of Tokenized StringsPreprint
Metwally, A., & Huang, C.-H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.09238
“Filtering abusive ads traffic was studied in [15], [16], [41], [44], [46], [58], and fake likes and promotion on social networks was studied in [17], [28].”
BackgroundListeria monocytogenes y mecanismo de caballo de Troya a través de la barrera hematoencefálica
Pineda, R. A., & Prieto, A. D. (2024) · Revista Digital de Postgrado · doi:10.37910/rdp.2024.13.1.e389
- Authors
- Ikram, M., Onwuzurike, L., Farooqi, S., Cristofaro, E. D., Friedman, A., Jourjon, G., Kaafar, M. A., & Shafiq, M. Z.
- Affiliations
- Commonwealth Scientific and Industrial Research Organisation (AU)
- University College London (GB)
- University of Iowa (US)
- Atlassian (United Kingdom) (GB)
- Data61-CSIRO
- Venue
- ACM Transactions on Privacy and Security
- Published
- 2017-09-20
- Volume
- 20
- Issue
- 4
- Pages
- 1-28
- ISSN
- 2471-2566 (ISSN-L)
- 2471-2574
- OpenAlex
- W2727710601
- Semantic Scholar
- 1565e42601a0a23af3183b5ca0dd988e7089fc3f
- Cited by
- 27
- References
- 53
- Citations by year
- 2026: 2 · 2025: 2 · 2024: 3 · 2023: 3 · 2021: 3 · 2020: 7 · 2019: 5 · 2018: 2
- FWCI
- 7.15
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- ACM Transactions on Privacy and Security (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Spam and Phishing Detection
- Social Sciences › Sociology and Political Science › Misinformation and Its Impacts
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Keywords
- Facebook, fake accounts, honeypots, lexical features, bot detection, social media marketing, targeted advertising, user-generated content
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.
Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-09.
Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-09.
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