TY - JOUR
T1 - Detecting spammers using review graph
AU - Gu, Chonglin
AU - He, Zhixiang
AU - Chen, Shi
AU - Huang, Hejiao
AU - Jia, Xiaohua
PY - 2017
Y1 - 2017
N2 - 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.
AB - 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.
KW - Review spam
KW - Similarity graph
KW - Spammer detection
UR - http://www.scopus.com/inward/record.url?scp=85029503863&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85029503863&origin=recordpage
U2 - 10.1504/IJHPCN.2017.086531
DO - 10.1504/IJHPCN.2017.086531
M3 - RGC 21 - Publication in refereed journal
SN - 1740-0562
VL - 10
SP - 269
EP - 278
JO - International Journal of High Performance Computing and Networking
JF - International Journal of High Performance Computing and Networking
IS - 4/5
ER -