Positive Unlabeled Learning for Deceptive Reviews Detection
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Deceptive reviews detection has attracted significant attention from both business and research communities.However, due to the difficulty of human labeling needed for supervised learning, the problem remains to be highly challenging.This paper proposed a novel angle to the problem by modeling PU (positive unlabeled) learning.A semi-supervised model, called mixing population and individual property PU learning (MPIPUL), is proposed.Firstly, some reliable negative examples are identified from the unlabeled dataset.Secondly, some representative positive examples and negative examples are generated based on LDA (Latent Dirichlet Allocation).Thirdly, for the remaining unlabeled examples (we call them spy examples), which can not be explicitly identified as positive and negative, two similarity weights are assigned, by which the probability of a spy example belonging to the positive class and the negative class are displayed.Finally, spy examples and their similarity weights are incorporated into SVM (Support Vector Machine) to build an accurate classifier.Experiments on gold-standard dataset demonstrate the effectiveness of MPIPUL which outperforms the state-of-the-art baselines.
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
Opinion mining and sentiment analysis
Pang, B., & Lee, L. (2008) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000011 · Cited by 6,372
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
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 · cited 2×
“(2012) proposed detecting group spammers (a group of reviewers who work collaboratively to write deceptive reviews) in product reviews (Mukherjee et al., 2012).”
BackgroundSpotting 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
Cited by
Learning from positive and unlabeled data: a survey
Bekker, J., & Davis, J. (2020) · Machine Learning · doi:10.1007/s10994-020-05877-5 · Cited by 651
“ich are dishonest positive or negative reviews. These reviews should therefore be ltered out. Some positive examples of such reviews can be provided, but all other reviews to be checked are unlabeled [88]. Learning From Positive and Unlabeled Data: A Survey 35 Focused web crawlers search for relevant web pages given a…”
BackgroundCredibility in social media: opinions, news, and health information—a survey
Viviani, M., & Pasi, G. (2017) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1209 · Cited by 221
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
Metadata
- Authors
- ren, Y., ji, D., & zhang, H.
- Venue
- Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)
- Published
- 2014
- Pages
- 488-498
- OpenAlex
- W2251470557
- Cited by
- 95
- References
- 5
- FWCI
- 3.95
- Type
- conference paper
- Language
- en
- Open access
- hybrid
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: Positive Unlabeled Learning for Deceptive Reviews Detection. https://app.cochat.ai/papers/10.3115/v1/d14-1055
- The paper
- ren, Y., ji, D., & zhang, H. (2014). Positive Unlabeled Learning for Deceptive Reviews Detection. Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP). https://doi.org/10.3115/v1/d14-1055
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.