Battling the internet water army: detection of hidden paid posters
The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
We initiate a systematic study to help distinguish a special group of online users, called hidden paid posters, or termed "Internet water army" in China, from the legitimate ones. On the Internet, the paid posters represent a new type of online job opportunities. They get paid for posting comments or articles on different online communities and websites for hidden purposes, e.g., to influence the opinion of other people towards certain social events or business markets. While being an interesting strategy in business marketing, paid posters may create a significant negative effect on the online communities, since the information from paid posters is usually not trustworthy. When two competitive companies hire paid posters to post fake news or negative comments about each other, normal netizens may feel overwhelmed and find it difficult to put any trust in the information they acquire from the Internet. In this paper, we thoroughly investigate the behavioral pattern of online paid posters based on real-world trace data. We design and validate a new detection mechanism, using both non-semantic analysis and semantic analysis, to identify potential online paid posters. Our test results with real-world datasets show a very promising performance.
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.
Integrity signals
Registry
Cites
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.
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
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855
What is Twitter, a social network or a news media?
Kwak, H., Lee, C., Park, H., & Moon, S. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772751 · Cited by 6,652
Beyond Accuracy, F-Score and ROC: A Family of Discriminant Measures for Performance Evaluation
Sokolova, M., Japkowicz, N., & Szpakowicz, S. (2006) · Lecture Notes in Computer Science · doi:10.1007/11941439_114 · Cited by 1,974
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
Finding Deceptive Opinion Spam by Any Stretch of the Imagination
Ott, M., Choi, Y., Cardie, C., & Hancock, J. T. (2011) · arXiv · doi:10.48550/arxiv.1107.4557 · Cited by 1,008
Sentence similarity based on semantic nets and corpus statistics
Li, Y., McLean, D., Bandar, Z. A., O'Shea, J. D., & Crockett, K. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.130 · Cited by 819 · cited 1×
“While there are many other complex semantic analysis methods to represent the similarity between two texts [15] [12] [1] [16], we believe that comments are much shorter than articles and therefore a simple method as above would be good enough.”
BackgroundSpotting 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
Tweeting is believing?: understanding microblog credibility perceptions
Morris, M. R., Counts, S., Roseway, A., Hoff, A., & Schwarz, J. (2012) · Proceedings of the ACM 2012 conference on Computer Supported Cooperative Work · doi:10.1145/2145204.2145274 · Cited by 411
Serf and turf: crowdturfing for fun and profit
Wang, G., Wilson, C., Zhao, X., Zhu, Y., Mohanlal, M., Zheng, H., & Zhao, B. Y. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187928 · Cited by 197
Quantifying the trustworthiness of social media content
Moturu, S. T., & Liu, H. (2011) · Distributed and Parallel Databases · doi:10.1007/s10619-010-7077-0 · Cited by 56
Cited by
Defining “Fake News”: A typology of scholarly definitions
Tandoc, E. C., Lim, Z. W., & Ling, R. (2018) · Digital Journalism · doi:10.1080/21670811.2017.1360143 · Cited by 2,172
Tucker, J. A., Guess, A., Barbera, P., Vaccari, C., Siegel, A., Sanovich, S., Stukal, D., & Nyhan, B. (2018) · doi:10.2139/ssrn.3144139 · Cited by 1,222
REV2: Fraudulent User Prediction in Rating Platforms
Kumar, S., Hooi, B., Makhija, D., Kumar, M., Faloutsos, C., & Subrahmanian, V. S. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159729 · Cited by 372
A trust-based collaborative filtering algorithm for E-commerce recommendation system
Jiang, L., Cheng, Y., Yang, L., Li, J., Yan, H., & Wang, X. (2019) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-018-0928-7 · Cited by 229
“In addition, the emergence of fraudulent internet users (Chen et al. 2013) has lead to many untrusted ratings.”
BackgroundThe Web of False Information: Rumors, Fake News, Hoaxes, Clickbait, and Various Other Shenanigans
Zannettou, S., Sirivianos, M., Blackburn, J., & Kourtellis, N. (2019) · Journal of Data and Information Quality · doi:10.1145/3309699 · Cited by 86
Combating Product Review Spam Campaigns via Multiple Heterogeneous Pairwise Features
Xu, C., & Zhang, J. (2015) · Proceedings of the 2015 SIAM International Conference on Data Mining · doi:10.1137/1.9781611974010.20 · Cited by 51
Can We Spot the "Fake News" Before It Was Even Written?
Nakov, P. (2020) · arXiv · doi:10.48550/arxiv.2008.04374 · Cited by 15
“This includes challenging the truthiness of claims [6,52,81], of news [17,33,36,37,42,60,61], of news sources [8], of social media users [3,26,49,50,51,59], and of social media [18,19,64,82], as well as studying credibility, influence, and bias [7,8,20,45,49,51].”
BackgroundSurvey on Astroturfing Detection and Analysis from an Information Technology Perspective
Chen, T., Liu, J., Wu, Y., Tian, Y., Tong, E., Niu, W., Li, Y., Xiang, Y., & Wang, W. (2021) · Security and Communication Networks · doi:10.1155/2021/3294610 · Cited by 10
“[55], the fundamental architecture and the design of a detection system that identifies malicious behaviors and potential paid posters in real time are discussed.”
Background
Metadata
- Authors
- Chen, C., Wu, K., Srinivasan, V., & Zhang, X.
- Venue
- Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
- Publisher
- ACM
- Published
- 2013-08-25
- Pages
- 116-120
- OpenAlex
- W2068138600
- Cited by
- 182
- References
- 10
- FWCI
- 16.41
- Type
- conference paper
- 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
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.