Review scores collect users’ opinions in a simple and intuitive manner. However, review scores are also easily manipulable, hence they are often accompanied by explanations. A substantial amount of research has been devoted to ascertaining the quality of reviews, to identify the most useful and authentic scores through explanation analysis. In this paper, we advance the state of the art in review quality analysis. We introduce a rating system to identify review arguments and to define an appropriate weighted semantics through formal argumentation theory. We introduce an algorithm to construct a corresponding graph, based on a selection of weighted arguments, their semantic distance, and the supported ratings. We also provide an algorithm to identify the model of such an argumentation graph, maximizing the overall weight of the admitted nodes and edges. We evaluate these contributions on the Amazon review dataset by McAuley et al. (2015), by comparing the results of our argumentation assessment with the upvotes received by the reviews. Also, we deepen the evaluation by crowdsourcing a multidimensional assessment of reviews and comparing it to the argumentation assessment. Lastly, we perform a user study to evaluate the explainability of our method, i.e., to test whether the automated method we use to assess reviews is understandable by humans. Our method achieves two goals: (1) it identifies reviews that are considered useful, comprehensible, and complete by online users, and does so in an unsupervised manner, and (2) it provides an explanation of quality assessments.

, ,
SWI-Prolog Solutions b.v., Amsterdam, The Netherlands
doi.org/10.1016/j.is.2022.102107
Information Systems
The eye of the beholder: Transparent pipelines for assessing online information quality
Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands

Ceolin, D., Primiero, G., Soprano, M., & Wielemaker, J. (2022). Transparent assessment of information quality of online reviews using formal argumentation theory. Information Systems, 110, 102107:1–102107:14. doi:10.1016/j.is.2022.102107