Cited by 141Spam and Phishing DetectionMisinformation and Its ImpactsHate Speech and Cyberbullying Detection

Bimodal Distribution and Co-Bursting in Review Spam Detection

Open access
Li, Huayi, Fei, Geli, Wang, Shuai, Liu, Bing, Shao, Weixiang, Mukherjee, Arjun, Shao, Jidong·2017·Proceedings of the 26th International Conference on World Wide Web

Abstract

Online reviews play a crucial role in helping consumers evaluate and compare products and services. This critical importance of reviews also incentivizes fraudsters (or spammers) to write fake or spam reviews to secretly promote or demote some target products and services. Existing approaches to detecting spam reviews and reviewers employed review contents, reviewer behaviors, star rating patterns, and reviewer-product networks for detection. In this research, we further discovered that reviewers' posting rates (number of reviews written in a period of time) also follow an interesting distribution pattern, which has not been reported before. That is, their posting rates are bimodal. Multiple spammers also tend to collectively and actively post reviews to the same set of products within a short time frame, which we call co-bursting. Furthermore, we found some other interesting patterns in individual reviewers' temporal dynamics and their co-bursting behaviors with other reviewers. Inspired by these findings, we first propose a two-mode Labeled Hidden Markov Model to model spamming using only individual reviewers' review posting times. We then extend it to the Coupled Hidden Markov Model to capture both reviewer posting behaviors and co-bursting signals. Our experiments show that the proposed model significantly outperforms state-of-the-art baselines in identifying individual spammers. Furthermore, we propose a co-bursting network based on co-bursting relations, which helps detect groups of spammers more effectively than existing approaches.

Integrity signals

Registry

Crossref · 10.1145/3038912.3052582

Cites

44 of 44 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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 [51]

  • The paper found rapid review bursts in both qualitative and quantitative investigations, consistent with assumptions in prior fraud-detection work, and interview participants revealed adaptive rate control as an avoidance technique.

    “We found ASO workers who post fake reviews in rapid bursts in both our qualitative and quantitative investigations.This is consistent with assumptions made in previous fraud detection work, e.g., [26, 28, 32, 36-38, 40, 42, 43, 51, 52, 59-61, 63, 65, 92, 95, 96, 100].”

    From The Art and Craft of Fraudulent App Promotion in Google Play (2019) · cites this paper as [32]

  • 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].”

    From Fraud De-Anonymization for Fun and Profit (2018) · cites this paper as [33]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Li, H., Fei, G., Wang, S., Liu, B., Shao, W., Mukherjee, A., & Shao, J.
Affiliations
  • University of Illinois Chicago (US)
  • University of Houston (US)
  • Dianping Inc., Shanghai, China
Venue
Proceedings of the 26th International Conference on World Wide Web
Published
2017-04-03
Pages
1063-1072
OpenAlex
W2604992511
Cited by
141
References
44
Citations by year
2026: 2 · 2025: 10 · 2024: 9 · 2023: 18 · 2022: 13 · 2021: 24 · 2020: 25 · 2019: 19 · 2018: 17 · 2017: 4
FWCI
13.65
Type
conference paper
Language
en
Open access
Locations
International World Wide Web Conference (WWW) (publishedVersion, cc-by)
Funders
National Science Foundation (NSF) (IIS-1650900, IIS-1407927, CNS-1527364)
Topics
  • Physical Sciences › Computer Science › Information Systems › Spam and Phishing Detection
  • Social Sciences › Sociology and Political Science › Misinformation and Its Impacts
  • Physical Sciences › Computer Science › Artificial Intelligence › Hate Speech and Cyberbullying Detection
Keywords
spam review detection, spammer detection, coupled hidden Markov models, online reviews

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.

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