MRR is an unsupervised algorithm based on the concept of graph centrality to identify relevant documents in a set of documents.
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
data
.gitignore
DYNAMIC_THRESHOLD_ANALYSIS.ipynb
MHR.py
MHR_graph_export.ipynb
MHR_parameter_estimation.ipynb
MHR_sentence.ipynb
MHR_time_performance.ipynb
MHR_vs_SVM-revisited.ipynb
MHR_vs_SVM.ipynb
MHR_vs_SVM_books-revisited.ipynb
MHR_vs_SVM_books.ipynb
MHRs_assessment.ipynb
NDCG.py
PR_HS_LEN.ipynb
PR_HS_LEN_Assessment.ipynb
PR_HS_LEN_Assessment_book.ipynb
PR_HS_LEN_book.ipynb
PR_HS_LEN_combined.ipynb
PR_HS_LEN_combined_book.ipynb
README.md
RevRank_based_on_OrenTsur.ipynb
RevRank_books.ipynb
extract_sample_from_dataset.py
feature_selection_linearSVM.ipynb
fix_locale.sh
full_grid_search.ipynb
parameter_estimation.py
presentation.pdf
print_performance_chart.ipynb
sample_counts.ipynb
sample_stats.ipynb
test.py
woloszyn2017mrr.bib

README.md

MRR

Author: Vinicius Woloszyn, Henrique D. P. dos Santos, Leandro Krug Wives, and Karin Becker

Abstract: The automatic detection of relevant reviews plays a major role in tasks such as opinion summarization, opinion-based recommendation, and opinion retrieval. Supervised approaches for ranking reviews by relevance rely on the existence of a significant, domain-dependent training data set. In this work, we propose MRR (Most Relevant Reviews), a new unsupervised algorithm that identifies relevant revisions based on the concept of graph centrality. The intuition behind MRR is that central reviews highlight aspects of a product that many other reviews frequently mention, with similar opinions, as expressed in terms of ratings. MRR constructs a graph where nodes represent reviews, which are connected by edges when a minimum similarity between a pair of reviews is observed, and then employs PageRank to compute the centrality. The minimum similarity is graph-specific, and takes into account how reviews are written in specific domains. The similarity function does not require extensive pre-processing, thus reducing the computational cost.
Using reviews from books and electronics products, our approach has outperformed the two unsupervised baselines and shown a comparable performance with two supervised regression models in a specific setting. MRR has also achieved a significantly superior run-time performance in a comparison with the unsupervised baselines.

Keywords: opinion retrieval, unsupervised algorithm, relevant reviews.

Full text , Slides

Complete Reference: Vinicius Woloszyn, Henrique D. P. dos Santos, Leandro Krug Wives, and Karin Becker. 2017. MRR: an Unsupervised Algorithm to Rank Reviews by Rel-evance. InProceedings of WI ’17, Leipzig, Germany, August 23-26, 2017,7 pages.DOI: 10.1145/3106426.3106444

Bibtex