CoChat

Astroturfing detection in social media: a binary n‐gram–based approach

Peng, Jian, Detchon, Sam, Choo, Kim‐Kwang Raymond, Ashman, Helen · 2017 · Concurrency and Computation: Practice and Experience
Cited by 40

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Abstract

Summary: Astroturfing is appearing in numerous contexts in social media, with individuals posting product reviews or political commentary under a number of different names, and is of concern because of the intended deception. An astroturfer works with the aim of making it seem that a large number of people hold the same opinion, promoting a consensus based on the astroturfer's intentions. It is generally done for commercial or political advantage, often by paid writers or ideologically motivated writers. This paper brings the notion of authorship attribution to bear on the astroturfing problem, collecting quantities of data from public social media sites and analyzing the putative individual authors to see if they appear to be the same person. The analysis comprises a binary n‐gram method, which was previously shown to be effective at accurately identifying authors on a training set from the same authors, while this paper shows how authors on different social media turn out to be the same author. The method has identified numerous instances where multiple accounts are apparently being operated by a single individual.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1002/cpe.4013

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 5 references

Cited by

See all 40

Metadata

Authors
Peng, J., Detchon, S., Choo, K. R., & Ashman, H.
Venue
Concurrency and Computation: Practice and Experience
Publisher
Wiley
Published
2016-10-14
Volume
29
Issue
17
ISSN
  • 1532-0626 (ISSN-L)
  • 1532-0634
OpenAlex
W2535992137
Cited by
40
References
5
FWCI
5.81
Type
journal article
Language
en
Open access
closed

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Astroturfing detection in social media: a binary n‐gram–based approach. https://app.cochat.ai/papers/10.1002/cpe.4013
The paper
Peng, J., Detchon, S., Choo, K. R., & Ashman, H. (2017). Astroturfing detection in social media: a binary n‐gram–based approach. Concurrency and Computation: Practice and Experience. https://doi.org/10.1002/cpe.4013

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.