Detecting spammers using review graph

Chonglin Gu, Zhixiang He, Shi Chen, Hejiao Huang*, Xiaohua Jia

*Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

2 Citations (Scopus)

Abstract

In recent years, e-commerce is so popular that many consumers make transactions online. In order to make more profit, some merchants hire spammers to give high ratings to promote certain products, or to give malicious negative reviews to defame products of competitors. Those misleading reviews are destructive to the fairness of e-commerce environment. Therefore, it is very important to detect spammers who are always posting deceptive reviews. However, existing methods have low recognition rate for detecting spam reviews. In this paper, we first propose to use SCTD to reduce the whole dataset, so that we can focus on the periods when spammers are more likely to happen. And then, a similarity graph is built to describe the relationships between those reviewers who post reviews on the same products. Finally, we propose an iterative algorithm to calculate the spam score for each reviewer using the edge weight and key features of adjacent reviewers in the graph. Experiment results show that our proposed method is much more effective in spammers detection.
Original languageEnglish
Pages (from-to)269-278
JournalInternational Journal of High Performance Computing and Networking
Volume10
Issue number4/5
Online published13 Sept 2017
DOIs
Publication statusPublished - 2017
Externally publishedYes

Research Keywords

  • Review spam
  • Similarity graph
  • Spammer detection

Fingerprint

Dive into the research topics of 'Detecting spammers using review graph'. Together they form a unique fingerprint.

Cite this