RevRank: A Fully Unsupervised Algorithm for Selecting the Most Helpful Book Reviews
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
We present an algorithm for automatically ranking user-generated book reviews according to review helpfulness. Given a collection of reviews, our RevRank algorithm identifies a lexicon of dominant terms that constitutes the core of a virtual optimal review. This lexicon defines a feature vector representation. Reviews are then converted to this representation and ranked according to their distance from a "virtual core" review vector. The algorithm is fully unsupervised and thus avoids costly and error-prone manual training annotations. Our experiments show that RevRank clearly outperforms a baseline imitating the Amazon user vote review ranking system.
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
Mining and summarizing customer reviews
Hu, M., & Liu, B. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014073 · Cited by 7,793
Thumbs up?: sentiment classification using machine learning techniques
Pang, B., Lee, L., & Vaithyanathan, S. (2002) · Proceedings of the ACL-02 conference on Empirical methods in natural language processing - EMNLP '02 · doi:10.3115/1118693.1118704 · Cited by 7,024
Wiebe, J., Wilson, T., Bruce, R., Bell, M., & Martin, M. (2004) · Computational Linguistics · doi:10.1162/0891201041850885 · Cited by 748
Evaluating Content Selection in Summarization: The Pyramid Method
Nenkova, A., & Passonneau, R. (2004) · Columbia University · doi:10.7916/d80r9xvd · Cited by 527
Cited by
Sentiment Analysis and Opinion Mining
Liu, B. (2012) · Synthesis Lectures on Human Language Technologies · doi:10.1007/978-3-031-02145-9 · Cited by 3,281
Sentiment Analysis and Opinion Mining
Zhang, L., & Liu, B. (2017) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7687-1_907 · Cited by 3,260
Ghose, A., & Ipeirotis, P. G. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.188 · Cited by 1,400
Sentiment Analysis: Mining Opinions, Sentiments, and Emotions
Liu, B. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108639286 · Cited by 362
Helpfulness of Online Product Reviews as Seen by Consumers: Source and Content Features
Li, M., Huang, L., Tan, C.-H., & Wei, K.-K. (2013) · International Journal of Electronic Commerce · doi:10.2753/jec1086-4415170404 · Cited by 352
Metadata
- Authors
- Tsur, O., & Rappoport, A.
- Venue
- Proceedings of the International AAAI Conference on Web and Social Media
- Published
- 2009-03-19
- Volume
- 3
- Issue
- 1
- Pages
- 154-161
- ISSN
- 2162-3449 (ISSN-L)
- 2334-0770
- OpenAlex
- W73370836
- Cited by
- 134
- References
- 4
- FWCI
- 5.17
- Type
- conference paper
- Language
- en
- Open access
- diamond
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: RevRank: A Fully Unsupervised Algorithm for Selecting the Most Helpful Book Reviews. https://app.cochat.ai/papers/10.1609/icwsm.v3i1.13945
- The paper
- Tsur, O., & Rappoport, A. (2009). RevRank: A Fully Unsupervised Algorithm for Selecting the Most Helpful Book Reviews. Proceedings of the International AAAI Conference on Web and Social Media. https://doi.org/10.1609/icwsm.v3i1.13945
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.