Fraud De-Anonymization for Fun and Profit
Open accessAbstract
The persistence of search rank fraud in online, peer-opinion systems, made possible by crowdsourcing sites and specialized fraud workers, shows that the current approach of detecting and filtering fraud is inefficient. We introduce a fraud de-anonymization approach to disincentivize search rank fraud: attribute user accounts flagged by fraud detection algorithms in online peer-opinion systems, to the human workers in crowdsourcing sites, who control them. We model fraud de-anonymization as a maximum likelihood estimation problem, and introduce UODA, an unconstrained optimization solution. We develop a graph based deep learning approach to predict ownership of account pairs by the same fraudster and use it to build discriminative fraud de-anonymization (DDA) and pseudonymous fraudster discovery algorithms (PFD). To address the lack of ground truth fraud data and its pernicious impacts on online systems that employ fraud detection, we propose the first cheating-resistant fraud de-anonymization validation protocol, that transforms human fraud workers into ground truth, performance evaluation oracles. In a user study with 16 human fraud workers, UODA achieved a precision of 91%. On ground truth data that we collected starting from other 23 fraud workers, our co-ownership predictor significantly outperformed a state-of-the-art competitor, and enabled DDA and PFD to discover tens of new fraud workers, and attribute thousands of suspicious user accounts to existing and newly discovered fraudsters.
AI snapshot
Written from the paper’s full text.
TL;DR
The paper proposes fraud de-anonymization to attribute fraudulent peer-opinion accounts to the human crowdsourcing fraud workers who control them, using MLE-based UODA, a DeepWalk/DeepCluster co-ownership predictor, DDA, PFD, and the Detego system. In a user study with 16 fraud workers, UODA reached 91% precision, and on 942 ground-truth accounts from 23 workers DDA reached 94.5% F1 while the co-ownership predictor reached 96.67% F1 versus Elsiedet’s 84.13%.
Key findings
- In the user study, 16 human fraud workers revealed 230 Google Play accounts; UODA achieved 91% precision, with 7 unconfirmed accounts among 77 predicted, and for 3 of those 7 the participants did not remember whether they controlled them.
- On 942 ground-truth attributed accounts from 23 fraud workers, DDA’s MLP achieved 94.50% F1, while UODA achieved 83.83% F1 for Top 1, 91.11% for Top 2, and 93.57% for Top 3; DDA attributed 3,547 accounts to the 23 workers, leaving only 134 unassigned.
- The co-ownership predictor cowPred achieved 96.67% F1 versus Elsiedet’s 84.13% F1; PFD identified 129 components over 5,548 user accounts and 97,448 edges, and analysis of 1.1 billion Jaccard pairs from 118,281 reviews belonging to 5,364 accounts found 15 components with more than 80% of accounts suspected of review-text plagiarism.
- The 640 selected fraud apps received 159,469 reviews, of which 17,575 were written from the 942 attributed fraud accounts.
Methods
- Design: fraud de-anonymization is modeled as maximum likelihood estimation; UODA solves an unconstrained optimization problem, DeepCluster uses DeepWalk features on co-review/union fraud graphs, cowPred predicts account co-ownership from 16 features, DDA trains a classifier for attribution, PFD partitions a co-ownership graph via a Karger-style weighted min-cut, and Detego iterates attribution and discovery.
- Data: a user study with 16 fraud workers (m=10, n=5, q=5) revealed 230 Google Play accounts; an additional 23 fraud workers revealed 942 attributed accounts; 640 fraud apps were crawled every 2 days over 6 months; the union fraud graph had 56,950 nodes and 34,742,730 edges (5,858,940 unique) across 202 disconnected components.
- Analysis: precision, recall, and F1 were evaluated with 10 random ground-truth/testing splits and stratified 10-fold cross-validation; DeepWalk parameters were grid-searched to d=300, t=100, γ=80, w=5; validation also used Jaccard similarity with k=3 shingles.
Limitations
- Paper-stated: Detego requires seed ground truth about accounts controlled by known fraudsters; fraudsters may evade by using disjoint account sets; underground fraud markets may emerge; recruitment was limited (320 contacted, 16 participated); account memorability is a caveat because only 5 test accounts were presented; UODA assumes review histories are independent and identically distributed.
- Text-evident: UODA was evaluated with only two features, so its performance may depend on that limited instantiation; PFD validation relies on orthogonal evidence such as plagiarism/Jaccard similarity rather than confirmed ownership; DDA and PFD depend on fraud detection filtering and seed clusters, which may affect attribution and discovery.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
0 of 38 cited sources checked · 0 supported · 0 flagged
- Findingown data
Jobs assigned to a single worker were less frequent than jobs awarded to two workers.
“We found that jobs assigned to a single worker occurred less frequently than jobs awarded to 2 workers.”
Quote in the paperSubstantial claim - Findingown data
UODA reached 91% precision in a study involving 16 human fraud workers.
“In a user study with 16 human fraud workers, UODA achieved a precision of 91%.”
- Also stated in: § 1 INTRODUCTION · plain
“The participants confirmed control of 91% of the user accounts newly discovered by UODA.”
Quote in the paperSubstantial claim - Also stated in: § 1 INTRODUCTION · plain
- Findingown data
On 942 ground truth attributed accounts from 23 fraud workers, both DDA and UODA achieved precision and recall above 90%.
“Further, on 942 ground truth attributed user accounts that we collected from other 23 fraud workers, both DDA and UODA achieved precision and recall that exceed 90%, and attributed thousands of new accounts to these fraudsters.”
Quote in the paperSubstantial claim - Findingown data
In a separate Upwork dataset experiment, 161 search rank fraud jobs and 533 bidding workers were collected.
“In a separate Upwork data set experiment, we collected 161 search rank fraud jobs and their 533 bidding workers.”
Quote in the paperSubstantial claim - Findingown data
A single job was assigned by some developers to up to 12 workers.
“Furthermore, some developers assigned a single job to as many as 12 workers.”
Quote in the paperSubstantial claim
- Findingown data
The training set consisted of 17,695 pairs of user accounts, 79.5% of which were controlled by the same fraudster.
“Our training set consists of 17,695 pairs of user accounts, 79.5% of which are controlled by the same fraudster.”
Quote in the paperSubstantial claim - Findingown data
For cowPred, GBM and RF achieved the best overall results.
“For cowPred, GBM and RF achieved the best overall results.”
Quote in the paperNot a substantial claim - Findingown data
DDA and UODA attributed thousands of new accounts to the 23 fraudsters.
“and attributed thousands of new accounts to these fraudsters.”
Quote in the paperSubstantial claim - Findingown data
The Jaccard similarity experiment generated 1.1 billion Jaccard pairs from 118,281 reviews belonging to 5,364 accounts.
“This experiment generated a total of 1.1 billion Jaccard pairs from 118,281 reviews belonging to 5,364 accounts.”
Quote in the paperNot a substantial claim - Findingown data
Rating features have the least significant effect among the features.
“However, we notice that rating features have the least significant effect.”
Quote in the paperNot a substantial claim - Findingown data
In the study, participants were able to correctly detect ground truth controlled and non-controlled accounts.
“However, in our study, participants were able to correctly detect ground truth controlled and non-controlled accounts.”
Quote in the paperNot a substantial claim - Findingnone given
The unique lockstep feature uL has a negative effect: larger values make it less likely that both accounts belong to the same worker.
“However, the unique lockstep feature u L shows a negative effect, i.e., the larger its value, the less likely it is that both accounts belong to the same worker.”
Quote in the paperNot a substantial claim - Findingnone given
The mean rating difference feature mean(LRij) negatively impacts the probability of co-ownership.
“Further, mean(L R i j ) impacts negatively the probability of co-ownership.”
Quote in the paperNot a substantial claim - Findingown data
The co-review and co-cluster features have a strong positive effect on the probability that two accounts are controlled by the same worker.
“We observe that the co-review and co-cluster features have a strong positive effect on the probability of two accounts being controlled by the same worker.”
Quote in the paperSubstantial claim - Findingown data
A user account posted a review for 40 apps in two days.
“A user account posted the review:”
Quote in the paperNot a substantial claim - Findingnone given
The time differences for all reviews in common are rarely similar, contrary to the burstiness assumption.
“Equivalently, contrary to the burstiness assumption, the time difference for all reviews in common are rarely similar.”
Quote in the paperSubstantial claim - Findingown data
In the validation protocol user study, 16 human fraud workers revealed control of 230 Google Play accounts.
“We conducted the fraud de-anonymization validation protocol, through a user study with 16 human fraud workers, who revealed control of a total of 230 Google Play accounts.”
Quote in the paperSubstantial claim - Findingown data
cowPred significantly outperformed Elsiedet, with an F1 measure of 96.67% versus 84.13%.
“cowPred significantly outperformed Elsiedet, with an F1-measure of 96.67% vs. 84.13%.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [87]
Not checked in the free run.
- Findingown data
The authors' methods substantially exceed a state-of-the-art baseline.
“We show that our solutions achieve high precision and recall on ground truth data, significantly outperform a state-of-the-art approach and are able to attribute thousands of new accounts to known crowdsourced fraudsters.”
Quote in the paperSubstantial claim - Findingown data
Using just two features, UODA attains an F1 score of 83%.
“However, with only 2 features, UODA reaches an F1 of 83%.”
Quote in the paperSubstantial claim - Findingown data
The authors' methods can assign thousands of additional accounts to identified crowdsourced fraudsters.
“We show that our solutions achieve high precision and recall on ground truth data, significantly outperform a state-of-the-art approach and are able to attribute thousands of new accounts to known crowdsourced fraudsters.”
Quote in the paperSubstantial claim - Findingown data
DDA assigned 3,547 accounts to the 23 fraudsters, a number 3.7 times larger than the seed set.
“DDA attributed 3,547 accounts to these fraudsters, 3.7 times more than the size of the seed set.”
Quote in the paperSubstantial claim - Findingown data
The study used 279,431 links from 5,690 unknown (un-attributed) user accounts that reviewed 640 suspicious apps.
“We used 279,431 links from 5,690 unknown (un-attributed) user accounts that reviewed 640 suspicious apps.”
Quote in the paperSubstantial claim - Findingown data
In 15 of the 71 fraudster communities found by PFD, at least 80% of user accounts are suspected of plagiarism.
“15 communities have at least 80% of their user accounts suspected of plagiarism.”
Quote in the paperNot a substantial claim - Findingown data
The authors' methods attain high precision and recall when evaluated on ground truth data.
“We show that our solutions achieve high precision and recall on ground truth data, significantly outperform a state-of-the-art approach and are able to attribute thousands of new accounts to known crowdsourced fraudsters.”
Quote in the paperSubstantial claim- Rests on an assumption: Responses from fraudsters are a valid source of ground truth for assessing de-anonymization methods.
- Findingown data
PFD identified 71 communities of fraudsters.
“Scatterplot for 71 fraudster communities (shown as dots) discovered by PFD”
Quote in the paperSubstantial claim - Findingown data
The authors' co-ownership predictor is significantly more accurate than the predictor of Zheng et al. [87].
“In Section 11.4 we show that our co-ownership predictor significantly outperforms the accuracy of Zheng et al. [87]'s predictor.”
- Also stated in: § 14 CONCLUSIONS · plain
“cowPred significantly outperforms ELSIEDET.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites Zheng et al. [87]
Not checked in the free run.
- Also stated in: § 14 CONCLUSIONS · plain
- Findingown data
Among 13 of the 23 fraud workers, at least 90% of accounts newly attributed to them contain self-plagiarized reviews.
“Almost all (≥ 90%) of the newly attributed accounts for 13 out of 23 fraud workers have self-plagiarized reviews.”
Quote in the paperSubstantial claim - Findingown data
On data validated by 16 human fraud workers, UODA reaches an overall precision of 91%.
“Results of UODA on data validated by 16 human fraud worker participants.UODA achieves an overall precision of 91%.”
Quote in the paperSubstantial claim - Premisecitation
Earlier academic work created gold-standard fraud datasets using rule-based heuristics that assume fraudsters post reviews within short intervals, from one IP address, or with skewed rating distributions.
“academic work has built gold standard fraud datasets using rule-based heuristics, assuming that e.g., fraudsters post reviews in a short period of time [32,33,40,44,87], from the same IP address [40], or have a skewed rating distribution [58,87].”
Quote in the paperSubstantial claim0 of 6 sources checked - Interpretationreasoning
Increasing account reuse exposes the fraud operation to Detego detection and attribution.
“Increasing account reuse exposes the fraud operation to Detego detection and attribution.”
Quote in the paperSubstantial claim - Interpretationreasoning
Accounts controlled by the same worker tend to award similar star ratings to their commonly reviewed apps.
“Hence, accounts controlled by the same worker tend to award similar star rating to their commonly reviewed apps.”
Quote in the paperSubstantial claim - Interpretationreasoning
The worker most likely to control a suspect account has a family of Ω sets for which most q_i are large and P_i are small.
“The first term of Equation ( 4) reveals that the F W associated worker most likely to control the suspect account has a family of Ω sets for which most of q i are large and P i are small; that is, many of the subjects in the account's review history appear in the worker's sets Ω i that are neither too big or popular.”
Quote in the paperSubstantial claim - Interpretationreasoning
Detego's data collection, or variations of it, can blend in with regular recruitment of fraud.
“Thus, Detego's data collection (or variations) can blend in with regular recruitment of fraud.”
Quote in the paperSubstantial claim - Interpretationreasoning
Detego's ground truth collection and solution validation approach identifies and leverages intrinsic vulnerabilities in developer-to-fraudster interactions.
“Further, we observe that Detego's ground truth collection and solution validation approach, identifies and leverages intrinsic vulnerabilities in the developer-to-fraudster interactions, i.e., developers need to verify claimed fraudster expertise and fraudsters need to make a profit.”
Quote in the paperSubstantial claim - Interpretationown data
The result suggests that even in large components, users who generated very dissimilar reviews are also engaged in review manipulation that reuses high amounts of text.
“This result suggests that, even for large components, users that generated very dissimilar reviews are in fact also engaged in review manipulation that reuse high amounts of text.”
Quote in the paperSubstantial claim - Interpretationreasoning
The information collected cannot be used to personally identify fraudsters.
“We believe that this information cannot be used to personally identify fraudsters: recruited fraudsters control between 40 and 500 accounts each (M=211, SD=166) thus any such account is unlikely to contain PII.”
Quote in the paperSubstantial claim - Interpretationreasoning
Because multiple fraud workers usually target one subject, binary classification of fraud is insufficient to understand and model fraud.
“The insight that multiple fraud workers usually target a single subject suggests that a binary classification of fraud, e.g., fake vs. honest reviews, fraudulent vs. honest accounts [17,26,27,31,32,44,47,80], is insufficient to understand and model fraud.”
Quote in the paperSubstantial claim0 of 8 sources checked- cites [17]
Not checked in the free run.
- cites [26] source
Not checked in the free run.
- cites [27]
Not checked in the free run.
- cites [31]
Not checked in the free run.
- cites [32]
Not checked in the free run.
- cites [44]
Not checked in the free run.
- cites [47] source
Not checked in the free run.
- cites [80]
Not checked in the free run.
- Interpretationreasoning
Subjects targeted by search rank fraud usually receive fake reviews from multiple fraud workers.
“This observation reveals that subjects targeted by search rank fraud will usually receive fake reviews from multiple fraud workers.”
Quote in the paperSubstantial claim - Interpretationreasoning
Detego introduces a tradeoff between the fraud operation's efficiency and its detectability.
“We observe however that Detego introduces a tradeoff between the fraud operation's efficiency and its detectability.”
Quote in the paperSubstantial claim - Interpretationown data
Reward-driven participation is enough for certain fraudsters.
“Our results suggest that reward driven participation is enough for certain fraudsters.”
Quote in the paperSubstantial claim - Interpretationreasoning
A pair of accounts with high co-review and co-cluster weights is more likely to share a fraudster owner.
“Accounts with high co-review and co-cluster weights are more likely to be controlled by the same fraudster.”
Quote in the paperSubstantial claim - Interpretationown data
Higher co-review and co-cluster values make it more likely that two accounts are owned by the same underlying worker.
“The higher their values the more likely it is that two accounts are owned by the same underlying worker.”
Quote in the paperSubstantial claim - Interpretationreasoning
Under the probabilistic review-posting model, the maximum likelihood estimates of r and F_W are given by equations (3) and (4).
“Given a review history R 1 (F W , r), R 2 (F W , r), . .., R n (F W , r) suspected to be fraudulent, the maximum likelihood estimates r and F W are:”
Quote in the paperSubstantial claim- The authors state this as an assumption: Accounts run by fraudsters tend to promote items within a pre-specified partition of the product space.
- The authors state this as an assumption: A fraudulent account's review history can be modeled as a sequence of independent and identically distributed random variables over subjects.
- Study design and conductnone given
The paper introduces the first cheating-resistant fraud de-anonymization validation protocol.
“We introduce the first cheating-resistant, fraud de-anonymization validation protocol, to obtain ground truth confirmation on the performance of developed solutions.”
Quote in the paperSubstantial claim - Interpretationnone given
Detego can effectively provide fraud de-anonymization only when seed ground truth information about accounts controlled by known fraudsters is present.
“Detego can effectively provide fraud de-anonymization only in the presence of seed ground truth information about accounts controlled by known fraudsters.”
Quote in the paperNot a substantial claim - Premisecitation
Fraudsters synchronize the activities of accounts they control, producing lockstep behavior.
“For the inter-review features, the statistics computed over L i j leverage the observation that fraudsters synchronize the activities of the accounts that they control, e.g., in a”
Quote in the paperSubstantial claim0 of 3 sources checked - Interpretationreasoning
cowPred's advantage stems from its use of features extracted from common review behaviors exhibited by Sybil accounts.
“While Elsiedet was designed for a different type of social network (i.e., Dianping, Yelp), and a different adversary type (elite reviewer), we believe that cowPred's advantage stems from its use of features extracted from common review behaviors exhibited by Sybil accounts.”
Quote in the paperSubstantial claim - Interpretationown data
The observed job assignment distribution likely occurs because one worker has limited ability to significantly affect a subject's search rank.
“We conjecture that this assignment distribution occurs due to the limited ability of a single worker to effect a significant impact over a subject's search rank.”
Quote in the paperSubstantial claim - Study design and conductown data
The validation protocol includes multiple checks of participant attention and honesty, such as confirmations for accounts whose answers are already known and email/token verifications.
“We introduce multiple verifications of participant attention and honesty, including asking confirmations for accounts for which we already know the answer, as well as e-mail and token based verifications.”
Quote in the paperSubstantial claim - Interpretationnone given
Search rank fraud de-anonymization is a distinct problem from the established tasks of fraud or spammer detection.
“In this paper we study the search rank fraud de-anonymization problem and show that it is different from the well studied fraud or spammer detection problem.”
Quote in the paperSubstantial claim - Premisenone given
For peer-opinion platforms without strong social ties among users, co-activity graphs like the paper's co-review graphs can serve in place of social graphs.
“In peer-opinion systems that lack strong social links between user accounts, social graphs can be replaced by co-activity graphs, such as our co-review graphs.”
Quote in the paperSubstantial claim
- May combine two claims. 32
- The quote only partly states this claim. 4
- Classified as probably not a substantial claim. 14
May combine two claims.
Findingown dataPFD found thousands of accounts that had not been known as fraudulent and clustered them by shared ownership by fraudsters.
“Further, the PFD algorithm identified thousands of accounts not previously known to be fraudulent, grouped into communities according to common ownership by fraudsters.”
Quote in the paperSubstantial claimMay combine two claims.
FindingcitationFraudulent activity is profitable, with advertised prices ranging from a few cents (average $0.56 on Zeerk) to up to $10 per review on Freelancer.
“For instance, we identified 44 fraud workers in Facebook groups, Zeerk, Peopleperhour, Freelancer and Upwork that advertised prices ranging from a few cents ($0.56 on average from Zeerk.com) to several dollars per review (up to $10 in Freelancer.com) [56].”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [56]
Not checked in the free run.
May combine two claims.
Findingown dataAnalysis of 1.1 billion review pairs from PFD communities found orthogonal evidence of fraud, including communities where more than 80% of accounts were involved in review text plagiarism.
“We analyzed 1.1 billion pairs of reviews from these communities and report orthogonal evidence of fraud, including communities with more than 80% of accounts involved in review text plagiarism.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataDDA and PFD found dozens of previously unknown fraud workers and linked thousands of suspicious accounts to both known and newly found fraudsters.
“and enabled DDA and PFD to discover tens of new fraud workers, and attribute thousands of suspicious user accounts to existing and newly discovered fraudsters.”
Quote in the paperSubstantial claimThe quote only partly states this claim.
Findingown dataOn ground truth data collected from 23 other fraud workers, the co-ownership predictor outperformed Elsiedet's Sybil social link builder by more than 12 percentage points in F1.
“On ground truth data that we collected starting from other 23 fraud workers, our co-ownership predictor significantly outperformed a state-of-theart competitor”
- Also stated in: § 1 INTRODUCTION · plain
“Our predictor outperformed the F1-measure of state-of-the-art, Elsiedet's Sybil social link builder [87] by more than 12 percentage points, on ground truth attributed data.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [87]
Not checked in the free run.
- Also stated in: § 1 INTRODUCTION · plain
May combine two claims.
Findingown data15 of 16 participants answered all 5 test accounts correctly; the remaining participant answered 'I don't remember' for one test account not controlled by them.
“Figure 4 shows that 15 of the 16 participants have provided correct responses to all 5 test accounts.The remaining participant answered”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataFifteen components containing 1,967 users had a ratio greater than 0.8, and very few components had a ratio below 0.3.
“Figure 8 highlights fifteen components (1967 users) with ratio greater than 0.8.Very few components have a ratio below 0.3.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data13 of 23 fraudulent workers had around 90% of their newly attributed accounts with reviews similar to their seed accounts, and 22 of 23 had at least 50% similar.
“We observe that 13 out of 23 fraudulent workers have around 90% of their new attributed accounts with similar reviews to the ones written by its seed accounts.Likewise, 22 out of 23 fraudsters have at least 50% of their accounts with similar reviews.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataTop 2 UODA achieved an average F1 of 91.11%, and Top 3 UODA achieved 93.57%.
“Specifically, Top 2 UODA achieves an average F1 of 91.11% while Top 3 UODA achieves an average F1 of 93.57%.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S1 (asserted), S3 (load-bearing), S4 (based).
Findingnone givenA review was posted from three different accounts in the same component for three different apps on the same date.
“The review”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataExperiments showed that DeepCluster clusters often contain accounts controlled by different fraudsters, because fraudsters tend to collaborate in search rank fraud jobs.
“However, our experiments revealed that clusters often contain accounts controlled by different fraudsters, as fraudsters tend to collaborate in search rank fraud jobs.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataDDA achieved an F1 measure of 94.5%, outperforming UODA's top 1 choice.
“We observe that DDA achieves an F1 measure of 94.5%, outperforming UODA's top 1 choice.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataDDA attributed 3,547 of 3,681 accounts to the 23 fraud workers, leaving 134 accounts unassigned.
“Figure 5 (top) shows the distribution of 3,547 of these accounts attributed to the 23 fraud workers.Only 134 accounts were not assigned to any fraud worker.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataThe co-ownership graph consisted of 5,548 user accounts and 97,448 edges, and PFD identified 129 components.
“The resulting co-ownership graph consists of 5,548 user accounts and 97,448 edges.Figure 7 shows 129 components identified by PFD.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown datacowPred's results were very similar for no sampling and oversampling strategies, and both outperformed undersampling.
“cowPred's results were very similar for the no sampling and oversampling strategies, outperforming the undersampling strategy.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataThe 16 participants were honest, with a single 'I don't remember' response among 80 test accounts.
“We note that the 16 participants were honest (a single”
Quote in the paperNot a substantial claimThe quote only partly states this claim.
Findingown data12 accounts in one component used a review template to post reviews for 8 apps.
“We found 12 accounts in one component that used the review”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataUODA's precision is 91%, with 7 unconfirmed accounts among 77 predicted.
“UODA's precision ( T P T P +F P , where TP is the number of true positives and FP is the number of false positives) is thus 91%, i.e., 7 unconfirmed accounts among 77 predicted.”
Quote in the paperSubstantial claim- The authors state this as an assumption: UODA assumes that the review history of a fraudulent user account is independent and identically distributed.
May combine two claims.
Findingown data10 of 16 participants confirmed control of all UODA proposed accounts, 5 confirmed 4 of 5, and 1 confirmed 3 of 5.
“We observe that 10 out of 16 participants have confirmed control (and passed our verification) of all UODA proposed accounts.5 participants confirmed control of 4 out of 5 UODA recommended accounts and 1 participant confirmed control of only 3 accounts out of 5 UODA recommended accounts.”
Quote in the paperSubstantial claim- Rests on an assumption: Fraud workers know the user accounts that they control.
The quote only partly states this claim.
Findingown dataOn the ground truth data set, DDA outperforms UODA.
“DDA performs better.”
Quote in the paperSubstantial claimMay combine two claims. The quote only partly states this claim.
Findingown dataAn additional 23 fraud workers were recruited and revealed a total of 942 attributed fraud accounts.
“We have recruited an additional set of 23 fraud workers and performed only the first step of the fraud de-anonymization validation protocol of § 9, where we asked each participant to reveal at least 15 accounts that they control in Google Play.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataThe study recruited 16 fraud workers from India, Bangladesh, UK, Egypt, USA, Pakistan, Indonesia, and Morocco; 12 were male and 4 female; they claimed to control between 40 and 500 accounts (M=211, SD=166).
“We have recruited 16 fraud workers from India (4), Bangladesh (4), UK (2), Egypt (2), USA (1), Pakistan (1), Indonesia (1), and Morocco (1), 12 male and 4 female, who claimed to control between 40 to 500 accounts (M=211, SD=166).”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataThe 640 apps received 159,469 reviews, of which 17,575 were written from the 942 attributed fraud accounts.
“On the whole, the 640 apps have received 159,469 reviews, of which 17,575 were written from the above 942 attributed fraud accounts.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingown dataTo recruit 16 participants, the study contacted 320 fraud workers.
“To recruit 16 participants for the user study of Section 10, we have contacted 320 fraud workers.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataThe union fraud graph had 56,950 nodes and 34,742,730 edges (5,858,940 unique edges) and consisted of 202 disconnected components.
“The resulting union fraud graph has 56,950 nodes and 34,742,730 edges (5,858,940 unique edges) and consists of 202 disconnected components.”
Quote in the paperNot a substantial claimMay combine two claims.
PremisecitationSpecialized fraud workers control multiple user accounts and seek employment from product developers to post fake reviews or activities.
“Specialized fraud workers (also referred to as fraud freelancers, or fraudsters) control multiple user accounts and seek employment by product developers to post fake reviews or activities for their products.”
Quote in the paperSubstantial claim0 of 8 sources checked- cites [13] source
Not checked in the free run.
- cites [23] source
Not checked in the free run.
- cites [40] source
Not checked in the free run.
- cites [45] source
Not checked in the free run.
- cites [81]
Not checked in the free run.
- cites [84]
Not checked in the free run.
- cites [85]
Not checked in the free run.
- cites [87]
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationA one-star rating boost was shown to increase restaurant revenue by 5-9%.
“For example, a one star boost in rating was shown to help restaurants increase revenue by a 5-9% margin [46].”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [46] source
Not checked in the free run.
May combine two claims.
InterpretationreasoningThose rule-based assumptions are difficult to validate and easy for experienced fraudsters to circumvent.
“However, such assumptions are also difficult to validate, especially as they are straightforward to bypass by experienced fraudsters (e.g., using proxies, better distributing the post time and rating of reviews).”
Quote in the paperSubstantial claimMay combine two claims.
InterpretationreasoningCurrent fraud detection and filtering methods are ineffective at preventing search rank fraud, as shown by the continued profitability of fraud on online services and crowdsourcing platforms.
“The persistence of search rank fraud in online, peer-opinion systems, made possible by crowdsourcing sites and specialized fraud workers, shows that the current approach of detecting and filtering fraud is inefficient.”
- Also stated in: § 1 INTRODUCTION · plain
“Fraud detection solutions however are not only (1) ineffective in preventing fraud, as observed from the continued profitability of fraud in online services and crowdsourcing platforms”
Quote in the paperSubstantial claim- Also stated in: § 1 INTRODUCTION · plain
Classified as probably not a substantial claim.
Interpretationnone givenEvaluating the accuracy of fraud detection is difficult because obtaining ground truth fraud data is very hard.
“their accuracy is difficult to evaluate, given that collecting ground truth fraud data is a notoriously hard task.”
Quote in the paperSubstantial claim- Rests on an assumption: Collecting ground truth fraud data is notoriously hard.
Probably not a substantial claim: may not pass S3 (load-bearing).
InterpretationreasoningMost workers post either positive or negative reviews.
“This observation implies that most workers post either positive or negative reviews.”
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 givenThe study used IRB-approved protocols to ethically interact with participants and collect data.
“We have developed IRB-approved protocols to ethically interact with participants and collect data.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based).
Interpretationnone givenSome fraudster-controlled accounts may not be controlled by any known fraudster in W*.
“However, some accounts in U * may not be controlled by any of the known fraudsters in W * .”
Quote in the paperNot a substantial claimMay combine two claims.
InterpretationreasoningDetego forces fraudsters to minimize account reuse and reduces review fraud incentives.
“Thus, Detego forces fraudsters to minimize account reuse and reduces review fraud incentives.”
Quote in the paperSubstantial claimMay combine two claims.
PremisecitationDecreasing account reuse decreases profits, because reputable accounts are often preferred in search rank fraud jobs.
“Decreasing account reuse decreases profits, as reputable accounts are often preferred in search rank fraud jobs [22,68,87].”
Quote in the paperSubstantial claim0 of 3 sources checkedProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
PremisecitationElsiedet was designed for a different type of social network (Dianping, Yelp) and a different adversary type (elite reviewer).
“While Elsiedet was designed for a different type of social network (i.e., Dianping, Yelp), and a different adversary type (elite reviewer), we believe that cowPred's advantage stems from its use of features extracted from common review behaviors exhibited by Sybil accounts.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [87]
Not checked in the free run.
Classified as probably not a substantial claim.
InterpretationreasoningEquation (4) assigns a user account to the worker profile in W* that is most likely to have produced that account's review history.
“Equation ( 4) from Theorem 4.1 attributes a user account to the worker profile in W * most likely responsible for the account's review history”
Quote in the paperSubstantial claimMay combine two claims.
InterpretationcitationSuch behavior affects the temporal distribution of the app's reviews, making it detectable through Detego's interreview-time and rating-difference features.
“Such behavior however affects the temporal distribution of the app's reviews [55], which makes it detectable, i.e., through the interreview-time and rating-difference features of Detego.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [55]
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationAn adversarial developer who wants to boost the average rating of an app needs to commission a number of fake reviews that is linear in the number of the app's honest reviews.
“Further, an adversarial developer who wants to boost the average rating of her app, needs to commission a number of fake reviews that is linear in the number of the app's honest reviews [55].”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [55]
Not checked in the free run.
Classified as probably not a substantial claim. May combine two claims.
Study design and conductnone givenThe study restricted volatile handling of emails and photos to the validation process and discarded them immediately after validation.
“We restricted the volatile handling of emails and photos of accounts revealed by participants, to the validation process.We have immediately discarded them after validation.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S4 (based).
Premisenone givenUnlike Twitter and Facebook, sites for crowdsourcing and peer opinions lack explicit mechanisms for linking accounts.
“This problem is also more challenging: unlike Twitter and Facebook, crowdsourcing and peer-opinion sites do not facilitate explicit forms of inter-connection.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductnone givenA caveat is that participants were only presented with 5 test accounts.
“The caveat is that we only presented participants with 5 test accounts.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Study design and conductreasoningThe authors did not compare with Kumar et al. [40]'s predictor, since it relies on community feedback features not available on sites such as Google Play.
“We did not compare against the predictor of Kumar et al. [40], that uses community feedback features that are unavailable in sites like Google Play.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites Kumar et al. [40]
Not checked in the free run.
May combine two claims.
Interpretationown dataThese results confirm DDA's outcome and previous work on crowdsourced review manipulation.
“These results confirm DDA's outcome and previous work on crowdsourced review manipulation, e.g., [36].”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [36] source
Not checked in the free run.
May combine two claims.
Study design and conductown dataThe authors used responses from fraudsters for live validation of their methods and to link accounts in the peer-opinion system to the crowdsourcing worker controlling them.
“In this paper we use fraudster responses to conduct a live validation of our solutions, and map accounts in the online peer-opinion system to the controlling crowdsourcing worker.”
Quote in the paperSubstantial claim
The paper relies on this without support.
Crowdsourcing site accounts contain uniquely identifying payment information, such as bank or PayPal accounts, that can be used to link them to real identities.
“Specifically, we leverage the observation that crowdsourcing site accounts contain uniquely identifying payment information, e.g., bank, Paypal accounts, to take steps toward de-anonymizing fraud”
The paper relies on this without support.
A crowdsourcing account must have a bank account linked to it so that escrow funds can be deposited and worker earnings withdrawn.
“These crowdsourcing accounts have a unique identifier and require a linked bank account for depositing employer's escrow money or withdrawing worker's earnings.”
The authors state this as an assumption.
Accounts run by fraudsters tend to promote items within a pre-specified partition of the product space.
“We propose a general theoretical framework for the fraud deanonymization problem via Maximum Likelihood Estimation (MLE) and assume a generative review-posting model wherein fraudstercontrolled accounts are more likely to endorse products in a predefined partition of the product space.”
The authors state this as an assumption.
A fraudulent account's review history can be modeled as a sequence of independent and identically distributed random variables over subjects.
“Further, we assume that the review history of a user account is described by a sequence of independent and identically distributed random variables R 1 , R 2 , . . ., R n where R k ∈ S represents the k-th subject reviewed from the account.”
The authors state this as an assumption.
Fake reviews exhibit burstiness: accounts controlled by the same worker post reviews closer in time.
“Since fraudsters need to meet tight deadlines [64], we expect ∆ T i j (s k ) to be lower for user accounts controlled by the same worker (fake review”
The paper relies on this without support.
Accounts controlled by the same fraudster form a densely connected subgraph or cluster in the union fraud graph.
“We exploit the intuition that in DeepCluster, accounts in a union fraud graph that are controlled by the same fraudster, form a densely connected subgraph, or cluster.”
The paper relies on this without support.
Collecting ground truth fraud data is notoriously hard.
“their accuracy is difficult to evaluate, given that collecting ground truth fraud data is a notoriously hard task.”
The paper relies on this without support.
The unique lockstep feature is lower for pairs of accounts governed by the same fraudster.
“Further, we expect the unique lockstep u L to be lower for pair of accounts governed by the same fraudster.”
The paper relies on this without support.
The number of unique rating differences is lower for pairs of accounts controlled by the same worker.
“For the rating difference features, we expect u R to be lower for pair of accounts controlled by the same worker, which would imply that both accounts tend to post the same rating for their common subjects.”
The authors state this as an assumption.
UODA assumes that the review history of a fraudulent user account is independent and identically distributed.
“I.i.d.assumption.UODA assumes that the review history of a fraudulent user account is independent and identically distributed, i.e., that an element in the sequence of reviews is independent of the element that came before it.”
The paper relies on this without support.
Fraud workers know the user accounts that they control.
“We leverage the observation that fraud workers know the user accounts that they control, to introduce a novel approach to validate fraud de-anonymization solutions, that converts human fraud workers into FDA oracles.”
The authors state this as an assumption.
The number of workers who targeted each subject is known a priori.
“We have used K-means as clustering algorithm in DeepCluster (see § 1) considering that we have prior knowledge about the number of workers who targeted each subject.”
The paper relies on this without support.
Responses from fraudsters are a valid source of ground truth for assessing de-anonymization methods.
“In this paper we use fraudster responses to conduct a live validation of our solutions, and map accounts in the online peer-opinion system to the controlling crowdsourcing worker.”
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?
Identifying organic ASO activities is an open problem due to the ability of such workers to evade existing detection solutions.
“Identifying organic ASO activities is an open problem due to the ability of such workers to evade existing detection solutions, e.g., that leverage lockstep behaviors [32, 43, 51, 72, 73, 78, 85, 86, 89, 92, 93] or review bursts [27, 28, 35, 39, 40, 42, 44, 45, 50-53, 53, 5759, 65, 66, 84, 87, 88, 92].”
From RacketStore (2021) · cites this paper as [43]
The Abstract says persistent search-rank fraud shows that current detection and filtering are inefficient. The ‘Fraud detection’ passage identifies bursty activity and lockstep behavior as assumptions used by existing approaches. The paper does not specifically discuss organic ASO activities or establish that their workers evade those approaches. (LLM, conf=0.83)
Experimental — accuracy not yet measured
Cites
SMOTE synthetic minority over-sampling technique
Chawla, N. V., Bowyer, K. W., Hall, L. O., & Kegelmeyer, W. P. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.953 · Cited by 32,865 · see citing works
Regularization Paths for Generalized Linear Models via Coordinate Descent
Friedman, J., Hastie, T., & Tibshirani, R. (2010) · Journal of Statistical Software · doi:10.18637/jss.v033.i01 · Cited by 19,927 · see citing works
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123 · see citing works
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · see citing works
Robust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372 · see citing works
On the resemblance and containment of documents
Broder, A. (2002) · Compression and Complexity of Sequences (SEQUENCES) · doi:10.1109/sequen.1997.666900 · Cited by 1,734 · see citing works
Jindal, N., & Liu, B. (2008) · Proceedings of the international conference on Web search and web data mining - WSDM '08 · doi:10.1145/1341531.1341560 · Cited by 1,542 · see citing works
Fake It Till You Make It: Reputation, Competition, and Yelp Review Fraud
Luca, M., & Zervas, G. (2016) · Management Science · doi:10.1287/mnsc.2015.2304 · Cited by 1,263 · see citing works
Spotting fake reviewer groups in consumer reviews
Mukherjee, A., Liu, B., & Glance, N. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187863 · Cited by 773 · see citing works
Collective Opinion Spam Detection: Bridging Review Networks and Metadata
Rayana, S., & Akoglu, L. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783370 · Cited by 604 · see citing works
What Yelp Fake Review Filter Might Be Doing?
Mukherjee, A., Venkataraman, V., Liu, B., & Glance, N. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v7i1.14389 · Cited by 564 · see citing works
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
Spotting opinion spammers using behavioral footprints
Mukherjee, A., Kumar, A., Liu, B., Wang, J., Hsu, M., Castellanos, M., & Ghosh, R. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487580 · Cited by 426 · see citing works
Connecting users across social media sites
Zafarani, R., & Liu, H. (2013) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2487575.2487648 · Cited by 408 · see citing works
SybilGuard: Defending Against Sybil Attacks via Social Networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. D. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.923723 · Cited by 408 · see citing works
SybilInfer: Detecting Sybil Nodes using Social Networks.
Danezis, G., & Mittal, P. (2009) · Cited by 407 · see citing works
Opinion Fraud Detection in Online Reviews by Network Effects
Akoglu, L., Chandy, R., & Faloutsos, C. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v7i1.14380 · Cited by 398 · see citing works
Review Graph Based Online Store Review Spammer Detection
Wang, G., Xie, S., Liu, B., & Yu, P. S. (2011) · Proceedings · doi:10.1109/icdm.2011.124 · Cited by 390 · see citing works
Netprobe: a fast and scalable system for fraud detection in online auction networks
Pandit, S., Chau, D. H., Wang, S., & Faloutsos, C. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242600 · Cited by 382 · see citing works
Kumar, S., Hooi, B., Makhija, D., Kumar, M., Faloutsos, C., & Subrahmanian, V. S. (2018) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3159652.3159729 · Cited by 373 · see citing works
Exploiting Burstiness in Reviews for Review Spammer Detection
Fei, G., Mukherjee, A., Liu, B., Hsu, M., Castellanos, M., & Ghosh, R. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v7i1.14400 · Cited by 352 · 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 · see citing works
FRAUDAR: Bounding Graph Fraud in the Face of Camouflage
Hooi, B., Song, H. A., Beutel, A., Shah, N., Shin, K., & Faloutsos, C. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939747 · Cited by 305 · see citing works
Uncovering social network Sybils in the wild
Yang, Z., Wilson, C., Wang, X., Gao, T., Zhao, B. Y., & Dai, Y. (2014) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2556609 · Cited by 290 · see citing works
On the Feasibility of Internet-Scale Author Identification
Narayanan, A., Paskov, H., Gong, N. Z., Bethencourt, J., Stefanov, E., Shin, E. C. R., & Song, D. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.46 · Cited by 261 · see citing works
Sybil-resilient online content voting
Tran, N. H. K., Min, B., Li, J., & Subramanian, L. (2009) · Cited by 256 · see citing works
Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm
Karger, D. R. (1993) · doi:10.5555/313559.313605 · Cited by 247 · see citing works
Sybillimit: a near-optimal social network defense against sybil attacks
Yu, H., Gibbons, P. B., Kaminsky, M., & Xiao, F. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2009.2034047 · Cited by 246 · see citing works
Exploiting innocuous activity for correlating users across sites
Goga, O., Lei, H., Parthasarathi, S. H. K., Friedland, G. H., Sommer, R., & Teixeira, R. (2013) · International World Wide Web Conference (WWW) · doi:10.1145/2488388.2488428 · Cited by 246 · see citing works
Trafficking 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
Stein, T., Chen, E., & Mangla, K. (2011) · Proceedings of the 4th Workshop on Social Network Systems · doi:10.1145/1989656.1989664 · Cited by 219 · see citing works
An Army of Me: Sockpuppets in Online Discussion Communities
Kumar, S., Cheng, J., Leskovec, J., & Subrahmanian, V. S. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052677 · Cited by 178 · 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 2× · see citing works
“Decreasing account reuse decreases profits, as reputable accounts are often preferred in search rank fraud jobs [22, 68, 87].”
BackgroundAutomated Crowdturfing Attacks and Defenses in Online Review Systems
Yao, Y., Viswanath, B., Cryan, J., Zheng, H., & Zhao, B. Y. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133990 · Cited by 150 · see citing works
Man 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
Bimodal Distribution and Co-Bursting in Review Spam Detection
Li, H., Fei, G., Wang, S., Liu, B., Shao, W., Mukherjee, A., & Shao, J. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052582 · Cited by 141 · see citing works
@i seek 'fb.me': identifying users across multiple online social networks
Jain, P., Kumaraguru, P., & Joshi, A. (2013) · Proceedings of the 22nd International Conference on World Wide Web · doi:10.1145/2487788.2488160 · Cited by 128 · see citing works
BIRDNEST: Bayesian Inference for Ratings-Fraud Detection
Hooi, B., Shah, N., Beutel, A., Günnemann, S., Akoglu, L., Kumar, M., Makhija, D., & Faloutsos, C. (2016) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611974348.56 · Cited by 118 · see citing works
Detection of fake opinions using time series
Heydari, A., Tavakoli, M. A., & Salim, N. B. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.03.020 · Cited by 117 · see citing works
Analyzing and Detecting Opinion Spam on a Large-scale Dataset via Temporal and Spatial Patterns
Li, H., Chen, Z., Mukherjee, A., Liu, B., & Shao, J. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v9i1.14652 · Cited by 116 · see citing works
Detecting social network profile cloning
Kontaxis, G., Polakis, I., Ioannidis, S., & Markatos, E. P. (2011) · IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) · doi:10.1109/percomw.2011.5766886 · Cited by 110 · see citing works
De-anonymizing Web Browsing Data with Social Networks
Su, J., Shukla, A., Goel, S., & Narayanan, A. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052714 · Cited by 95 · see citing works
Uncovering Crowdsourced Manipulation of Online Reviews
Fayazi, A., Lee, K., Caverlee, J., & Squicciarini, A. (2015) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2766462.2767742 · Cited by 94 · see citing works
Wang, B., Gong, N. Z., & Fu, H. (2017) · Proceedings · doi:10.1109/icdm.2017.56 · Cited by 92 · see citing works
Detecting Singleton Review Spammers Using Semantic Similarity
Sandulescu, V., & Ester, M. (2015) · International World Wide Web Conference (WWW) · doi:10.1145/2740908.2742570 · Cited by 91 · see citing works
De 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 1× · see citing works
“[24] deployed Facebook honeypot pages and analyzed like farms based on demographic, temporal and social dimensions.”
MethodExploring Linkability of User Reviews
Almishari, M., & Tsudik, G. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33167-1_18 · Cited by 80 · see citing works
Crowd Fraud Detection in Internet Advertising
Tian, T., Zhu, J., Xia, F., Zhuang, X., & Zhang, T. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741136 · Cited by 67 · see citing works
EVILCOHORT: 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
A Case Study of Sockpuppet Detection in Wikipedia
Solorio, T., Hasan, R., & Mizan, M. (2013) · Cited by 65 · see citing works
Smoke 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
Combating Crowdsourced Review Manipulators: A Neighborhood-Based Approach
Kaghazgaran, P., Caverlee, J., & Squicciarini, A. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159726 · Cited by 59 · see citing works
Temporal Opinion Spam Detection by Multivariate Indicative Signals
Ye, J., Kumar, S., & Akoglu, L. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v10i1.14801 · Cited by 51 · see citing works
CrowdTarget: 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 · see citing works
Uncovering 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 · see citing works
Lee, K., Webb, S., & Ge, H. (2014) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v8i1.14528 · Cited by 39 · see citing works
Exploiting Temporal Dynamics in Sybil Defenses
Liu, C., Gao, P., Wright, M., & Mittal, P. (2015) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2810103.2813693 · Cited by 33 · see citing works
Linking accounts across social networks: The case of StackOverflow, Github and Twitter
Silvestri, G., Yang, J., Bozzon, A., & Tagarelli, A. (2015) · Archive of Doctoral Theses and Digital Collections (University of Calabria) · Cited by 33 · see citing works
Behavioral Analysis of Review Fraud: Linking Malicious Crowdsourcing to Amazon and Beyond
Kaghazgaran, P., Caverlee, J., & Alfifi, M. (2017) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v11i1.14953 · Cited by 31 · see citing works
Identity vs. Attribute Disclosure Risks for Users with Multiple Social Profiles
Andreou, A., Goga, O., & Loiseau, P. (2017) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/3110025.3110046 · Cited by 31 · see citing works
Proceedings of the Workshop on Language Analysis in Social Media
Danescu-Niculescu-Mizil, C., Farzindar, A., Gamon, M., Inkpen, D. Z., & Nagarajan, M. (2013) · Cited by 31 · see citing works
Turning the Tide: Curbing Deceptive Yelp Behaviors
Rahman, M., Cărbunar, B., Ballesteros, J., Burri, G. J., & Chau, D. H. (2014) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611973440.28 · Cited by 24 · see citing works
Self-citationOn Profile Linkability despite Anonymity in Social Media Systems
Michael Backes, A., Berrang, P., Goga, O., Gummadi, K. P., & Manoharan, P. (2016) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/2994620.2994629 · Cited by 23 · see citing works
GroupTie: toward hidden collusion group discovery in app stores
Xie, Z., & Zhu, S. (2014) · Proceedings of the 2014 ACM conference on Security and privacy in wireless & mobile networks · doi:10.1145/2627393.2627409 · Cited by 19 · see citing works
Strengthening Weak Identities Through Inter-Domain Trust Transfer
Venkatadri, G., Goga, O., Zhong, C., Viswanath, B., Gummadi, K. P., & Sastry, N. (2016) · International World Wide Web Conference (WWW) · doi:10.1145/2872427.2883015 · Cited by 18 · see citing works
You can promote, but you can't hide
Xie, Z., Zhu, S., Li, Q., & Wang, W. (2016) · Annual Computer Security Applications Conference · doi:10.1145/2991079.2991099 · Cited by 12 · see citing works
Search Rank Fraud De-Anonymization in Online Systems
Rahman, M., Hernandez, N., Carbunar, B., & Chau, D. H. (2018) · Proceedings of the 29th on Hypertext and Social Media · doi:10.1145/3209542.3209555 · Cited by 8 · see citing works
Self-citationStateless Puzzles for Real Time Online Fraud Preemption
Rahman, M., Recabarren, R., Carbunar, B., & Lee, D. (2017) · Proceedings of the 2017 ACM on Web Science Conference · doi:10.1145/3091478.3091507 · Cited by 4 · see citing works
Self-citation
Flagged first, then by citations
3 of the 71 references couldn’t be matched to a known paper.
Research works printed but not linked: 14
- Qurishi Muhammad, 2017, Sk Md Mizanur Rahman, and M Hossain
- 10.5555/829502.830043 · DOI
- 10.5555/1622407.1622416 · DOI
- Confessore Nicholas, 2018, The Follower Factory. The New York Times (Jan
- Kaghazgaran Parisa, 2017, Proceedings of ICWSM.
- Karger David R, 1993, SODA, 93
- Mukherjee Arjun, 2013, Proceedings of the International Conference on Weblogs and Social Media.
- Reigh Brian, 2017, Fake reviews on the Play Store reportedly growing and getting smarter. Android Authority (April
- Rosenberg Eli, 2017, The Shed at Dulwich' was London's top-rated restaurant. Just one problem: It didn't exist. The Washington Post (Dec
- Thomas Kurt, 2013, Proceedings of the 22Nd USENIX Conference on Security (SEC'13)
- 10.5555/1558977.1558979 · DOI
- Wamback Colleen, 2017, WPI Research Detects When Online Reviews and News Are a Paid-for Pack of Lies
- Wang Binghui, 2017, Neil Zhenqiang Gong, and Hao Fu
- Woollacott Emma, 2017, Study Suggests. Forbes (September.
Cited by
Sorted by citations
Olszewski, D., Lu, A., Stillman, C., Warren, K., Kitroser, C., Pascual, A., Ukirde, D., Butler, K. R. B., & Traynor, P. (2023) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3576915.3623130 · Cited by 33 · see citing works
SoK: Managing risks of linkage attacks on data privacy
Powar, J., & Beresford, A. R. (2023) · Proceedings on Privacy Enhancing Technologies · doi:10.56553/popets-2023-0043 · Cited by 31 · see citing works
The Art and Craft of Fraudulent App Promotion in Google Play
Rahman, M., Hernandez, N., Recabarren, R., Ahmed, S. I., & Carbunar, B. (2019) · Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3319535.3345658 · Cited by 24 · see citing works
Self-citationComposite Behavioral Modeling for Identity Theft Detection in Online Social Networks
Wang, C., Zhu, H., & Yang, B. (2021) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2021.3092007 · Cited by 27 · see citing works
Understanding 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
“Prior work has also interviewed fraudsters selling fake installs, reviews, and ratings in Google Play Store to reveal their operational characteristics [31, 48].”
BackgroundDFraud³: Multi-Component Fraud Detection Free of Cold-Start
Shehnepoor, S., Togneri, R. B., Liu, W., & Bennamoun, M. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3081258 · Cited by 15 · see citing works
Misleading Repurposing on Twitter
Elmas, T., Overdorf, R., & Aberer, K. (2023) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v17i1.22139 · Cited by 12 · see citing works
Not All Money Is the Same: The Meanings of Money in Online Fraud
Wang, F., Dickinson, T., & Ghazi-Tehrani, A. K. (2025) · Crime & Delinquency · doi:10.1177/00111287251321442 · Cited by 8 · see citing works
Jettisoning Junk Messaging in the Era of End-to-End Encryption: A Case Study of WhatsApp
Agarwal, P., Raman, A., Ibosiola, D., Sastry, N., Gareth Tyson, A., & Garimella, K. (2022) · International World Wide Web Conference (WWW) · doi:10.1145/3485447.3512130 · Cited by 4 · see citing works
“This include tools for detecting unwanted videos in social media [7, 19, 38, 44].”
MethodHernandez, N., Recabarren, R., Carbunar, B., & Ahmed, S. I. (2021) · Proceedings of the 21st ACM Internet Measurement Conference · doi:10.1145/3487552.3487837 · Cited by 3 · see citing works
“…organic ASO activities is an open problem due to the ability of such workers to evade existing detection solutions, e.g., that leverage lockstep behaviors [32, 43, 51, 72, 73, 78, 85, 86, 89, 92, 93] or review bursts [27, 28, 35, 39, 40, 42, 44, 45, 50–53, 53, 57– 59, 65, 66, 84, 87, 88, 92].”
BackgroundSelf-citationProvably Secure Decisions Based on Potentially Malicious Information
Wang, D., Muller, T., & Sun, J. (2024) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2024.3353295 · Cited by 1 · see citing works
“Hernandez et al. propose a method of fraud de-anonymisation based on the maximum likelihood estimation method, to uncover real identities of malicious workers that control the fraud accounts in online review platforms [62].”
MethodTUBERAIDER: Attributing Coordinated Hate Attacks on YouTube Videos to Their Source Communities
Saeed, M. H., Papadamou, K., Blackburn, J., Cristofaro, E. D., & Stringhini, G. (2024) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v18i1.31394 · Cited by 3 · see citing works
Social Fraud Detection Review: Methods, Challenges and AnalysisPreprint
Shehnepoor, S., Togneri, R. B., Liu, W., & Bennamoun, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.05645 · Cited by 4 · see citing works
“[30] to deal with fraudsters with multiple accounts on social review platforms.”
BackgroundSearch Rank Fraud Prevention in Online Systems
Rahman, M. M. (2018) · doi:10.25148/etd.fidc006998
Self-citationSecure Distributed Systems Over Satoshi Blockchains
Recabarren, R. (2021) · doi:10.25148/etd.fidc009559
- Authors
- Hernandez, N., Rahman, M., Recabarren, R., & Carbunar, B.
- Affiliations
- Florida International University (US)
- Florida International University, Miami, FL, USA
- Venue
- Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2018-10-15
- Pages
- 115-130
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2890697686
- Semantic Scholar
- 7301d1984d709c7c7ab5135c08e07513a15ec8ad
- Cited by
- 16
- References
- 71
- Citations by year
- 2025: 1 · 2024: 2 · 2023: 4 · 2022: 1 · 2021: 5 · 2020: 1 · 2019: 1 · 2018: 1
- FWCI
- 1.57
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM SIGSAC Conference on Computer and Communications Security (CCS) (publishedVersion)
- Funders
- Division of Computer and Network Systems (1527153)
- Topics
- Physical Sciences › Computer Science › Information Systems › Spam and Phishing Detection
- Social Sciences › Sociology and Political Science › Misinformation and Its Impacts
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Keywords
- graph-based deep learning, maximum likelihood estimation
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