Securing recommender systems against shilling attacks using social-based clustering
Type
ArticleKAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) DivisionComputer Science Program
Applied Mathematics and Computational Science Program
Machine Intelligence & kNowledge Engineering Lab
Date
2013-07-05Online Publication Date
2013-07-05Print Publication Date
2013-07Permanent link to this record
http://hdl.handle.net/10754/562844
Metadata
Show full item recordAbstract
Recommender systems (RS) have been found supportive and practical in e-commerce and been established as useful aiding services. Despite their great adoption in the user communities, RS are still vulnerable to unscrupulous producers who try to promote their products by shilling the systems. With the advent of social networks new sources of information have been made available which can potentially render RS more resistant to attacks. In this paper we explore the information provided in the form of social links with clustering for diminishing the impact of attacks. We propose two algorithms, CluTr and WCluTr, to combine clustering with "trust" among users. We demonstrate that CluTr and WCluTr enhance the robustness of RS by experimentally evaluating them on data from a public consumer recommender system Epinions.com. © 2013 Springer Science+Business Media New York & Science Press, China.Citation
Zhang, X.-L., Lee, T. M. D., & Pitsilis, G. (2013). Securing Recommender Systems Against Shilling Attacks Using Social-Based Clustering. Journal of Computer Science and Technology, 28(4), 616–624. doi:10.1007/s11390-013-1362-0Publisher
Springer Natureae974a485f413a2113503eed53cd6c53
10.1007/s11390-013-1362-0