Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

ORFEL: Efficient detection of defamation or illegitimate promotion in online recommendation

Full text
Author(s):
Gimenes, Gabriel ; Cordeiro, Robson L. F. ; Rodrigues-, Jr., Jose F.
Total Authors: 3
Document type: Journal article
Source: INFORMATION SCIENCES; v. 379, p. 274-287, FEB 10 2017.
Web of Science Citations: 4
Abstract

What if a successful company starts to receive a torrent of low-valued (one or two stars) recommendations in its mobile apps from multiple users within a short (say one month) period of time? Is it legitimate evidence that the apps have lost in quality, or an intentional plan (via lockstep behavior) to steal market share through defamation? In the case of a systematic attack to one's reputation, it might not be possible to manually discern between legitimate and fraudulent interaction within the huge universe of possibilities of user-product recommendation. Previous works have focused on this issue, but none of them took into account the context, modeling, and scale that we consider in this paper. Here, we propose the novel method Online-Recommendation Fraud ExcLuder (ORFEL) to detect defamation and/or illegitimate promotion of online products by using vertex-centric asynchronous parallel processing of bipartite (users-products) graphs. With an innovative algorithm, our results demonstrate both efficacy and efficiency over 95% of potential attacks were detected, and ORFEL was at least two orders of magnitude faster than the state-of-the-art. Over a novel methodology, our main contributions are: (1) a new algorithmic solution; (2) one scalable approach; and (3) a novel context and modeling of the problem, which now addresses both defamation and illegitimate promotion. Our work deals with relevant issues of the Web 2.0, potentially augmenting the credibility of online recommendation to prevent losses to both customers and vendors. (C) 2016 Elsevier Inc. All rights reserved. (AU)

FAPESP's process: 13/10026-7 - Graph analysis based on vertex-centric asynchronous parallel processing: applications on planetary scale data
Grantee:Gabriel Perri Gimenes
Support Opportunities: Scholarships in Brazil - Master
FAPESP's process: 14/21483-2 - The Similarity-aware relational division database operator
Grantee:Robson Leonardo Ferreira Cordeiro
Support Opportunities: Regular Research Grants
FAPESP's process: 16/02557-0 - Analytic processing of large graphs: identification of patterns for decision support in the Web 2.0
Grantee:José Fernando Rodrigues Júnior
Support Opportunities: Regular Research Grants