Title: Detecting sparse rating spammer for accurate ranking of online recommendation

Authors: Hong Wang; Xiaomei Yu; Jun Zhao; Yuanjie Zheng

Addresses: School of Information Science and Engineering, Shandong Normal University, No. 88 Wenhua East Road, Jinan, Shandong, China; Institute of Life Sciences, Shandong Normal University, No. 88 Wenhua East Road, Jinan, Shandong, China; Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology, No. 88 Wenhua East Road, Jinan, Shandong, China ' School of Information Science and Engineering, Shandong Normal University, No. 88 Wenhua East Road, Jinan, Shandong, China; Institute of Life Sciences, Shandong Normal University, No. 88 Wenhua East Road, Jinan, Shandong, China; Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology, No. 88 Wenhua East Road, Jinan, Shandong, China ' School of Information Science and Engineering, Shandong Normal University, No. 88 Wenhua East Road, Jinan, Shandong, China; Institute of Life Sciences, Shandong Normal University, No. 88 Wenhua East Road, Jinan, Shandong, China; Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology, No. 88 Wenhua East Road, Jinan, Shandong, China ' School of Information Science and Engineering, Shandong Normal University, No. 88 Wenhua East Road, Jinan, Shandong, China; Institute of Life Sciences, Shandong Normal University, No. 88 Wenhua East Road, Jinan, Shandong, China; Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology, No. 88 Wenhua East Road, Jinan, Shandong, China

Abstract: Ranking method for online recommendation system is challenging due to the rating sparsity and the spam rating attacks. The former can cause the well-known cold start problem while the latter complicates the recommendation task by detecting these unreasonable or biased ratings. In this paper, we treat the spam ratings as 'corruptions' which spatially distribute in a sparse pattern and model them with a L1 norm and a L2,1 norm. We show that these models can characterise the property of the original ratings by removing spam ratings and help to resolve the cold start problem. Furthermore, we propose a group-reputation-based method to re-weight the rating matrix and an iterative programming-based technique for optimising the ranking for online recommendation. We show that our optimisation methods outperform other recommendation approaches. Experimental results on four famous datasets reveal the superior performances of our methods.

Keywords: ranking; group-based reputation; sparsity; collaborative recommendation; spam rating.

DOI: 10.1504/IJCSE.2019.099646

International Journal of Computational Science and Engineering, 2019 Vol.19 No.1, pp.121 - 131

Received: 15 May 2016
Accepted: 13 Nov 2016

Published online: 02 May 2019 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article