基于用户声誉的鲁棒协同推荐算法

张燕平; 张顺; 钱付兰; 张以文

doi:10.16383/j.aas.2015.c140073

基于用户声誉的鲁棒协同推荐算法

doi: 10.16383/j.aas.2015.c140073

张燕平^1,2,
张顺^1,2,
钱付兰^1,2, ,,
张以文^1,2

1.
安徽大学计算机科学与技术学院合肥 230601;
2.
安徽大学智能计算与信号处理教育部重点实验室合肥 230601

基金项目:

国家自然科学基金 (61175046), 安徽大学青年科学基金 (KJQN1116), 安徽省自然科学基金项目(1408085MF132),教育部人文社科青年基金(14YJC860020)资助

详细信息

作者简介:
张燕平安徽大学计算机科学与技术学院教授. 主要研究方向为商空间与智能计算.E-mail: zhangyp2@gmail.com

通讯作者:
钱付兰安徽大学计算机科学与技术学院博士研究生. 2005 年获得安徽大学硕士学位. 主要研究方向为社交网络与个性化推荐. E-mail: qianfulan@hotmail.com

计量
- 文章访问数: 2012
- HTML全文浏览量: 100
- PDF下载量: 1146
- 被引次数: 0
出版历程
- 收稿日期: 2014-01-28
- 修回日期: 2014-12-03
- 刊出日期: 2015-05-20

Robust Collaborative Recommendation Algorithm Based on User's Reputation

1.
School of Computer Science and Technology, Anhui University, Hefei 230601;
2.
Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei 230601

Funds:

Supported by National Natural Science Foundation of China (61175046), Youth Science Fund of Anhui University (KJQN1116), Natural Science Found of Anhui Province (1408085MF132), and Humanities and Social Science Youth Fund of Ministry of Education (14YJC860020)

摘要

摘要: 随着推荐系统在电子商务界的快速发展以及取得的巨大经济收益, 有目的性的托攻击是目前协同过滤系统面临的重大安全威胁, 研究一种可抵御攻击的鲁棒推荐技术已成为目前推荐系统领域的重要课题.本文利用历史记录得到用户声誉, 建立声誉推荐系统, 并结合协同过滤推荐领域内的隐语义模型, 提出基于用户声誉的隐语义模型鲁棒协同算法.本文提出的算法从人为攻击和自然噪声两个方面对系统的鲁棒性进行了改善.在真实的数据集 Movielens 1M 上的实验表明, 与现有的鲁棒性推荐算法相比, 这种算法具有形式简单、可解释性强、稳定的特点, 且在精度得到一定提升的情况下大大增强了系统抵御攻击的能力.
- 推荐系统 /
- 协同过滤 /
- 声誉 /
- 托攻击
Abstract: With the rapid development of recommender systems in e-commerce industry, such systems bring huge economic profits. As a consequence, shilling attacks pose a significant threat to the security of collaborative filtering recommender systems. Developing a kind of robust recommendation technology which can resist attacks has become an important issue in the field of the recommender system at present. In this paper, a reputation recommender system is built by user reputations which are obtained from the user historical records. Utilizing the latent factor model in the field of collaborative filtering recommendation, a novel robust collaborative recommendation algorithm based on user reputations is proposed. The algorithm improves the system's robustness from two aspects of shilling attack and natural noise. Empirical results on Movielens 1M dataset demonstrate that compared with the existing robust recommendation, this algorithm is very effective. Characterized by simplicity, interpretability and stability, the algorithm has strong ability to resist the system attack along with the accuracy getting a certain improvement.
- Recommender system /
- collaborative filtering /
- reputation /
- shilling attack

HTML全文

参考文献(26)

[1]	Resnick P, Iakovou N, Sushak M, Bergstrom P, Riedl J. GroupLens: an open architecture for collaborative filtering of netnews. In: Proceedings of the 1994 Computer Supported Cooperative Work. Chapel Hill: ACM, 1994. 175-186
[2]	[2] Hill W C, Stead L, Rosenstein M, Furnas G W. Recommending and evaluating choices in a virtual community of use. In: Proceedings of the 1995 SIGCHI Conference on Human Factors in Computing Systems. Denver: ACM, 1995. 194-201
[3]	[3] Lam S K, Riedl J. Shilling recommender systems for fun and profit. In: Proceedings of the 13th International Conference on World Wide Web. New York, USA: ACM, 2004. 393-402
[4]	[4] O'Mahony M P, Hurley N J, Kushmerick N, Silvestre G C M. Collaborative recommendation: a robustness analysis. ACM Transactions on Internet Technology (TOIT), 2004, 4(4): 344-377
[5]	[5] Mobasher B, Burke R, Sandvig J J. Model-based collaborative filtering as a defense against profile injection attacks. In: Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference. Boston, Massachusetts, USA: AAAI, 2006.
[6]	[6] Gunes I, Kaleli C, Bilge A, Polat H. Shilling attacks against recommender systems: a comprehensive survey. Artificial Intelligence Review, 2014, 42(4): 767-799
[7]	[7] Mobasher B, Burke R, Williams C, Bhaumik R. Analysis and detection of segment-focused attacks against collaborative recommendation. In: Proceedings of the 7th International Workshop on Knowledge Discovery on the Web. Chicago, IL: Springer Berlin Heidelberg, 2006. 96-118
[8]	[8] Burke R D, Mobasher B, Williams C, Bhaumik R. Classification features for attack detection in collaborative recommender systems. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Philadelphia, PA, USA: ACM, 2006. 542-547
[9]	[9] Mehta B, Nejdl W. Attack resistant collaborative filtering. In: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. New York, USA: ACM, 2008. 75-82
[10]	Li Cong, Luo Zhi-Gang. A metadata-enhanced variational Bayesian matrix factorization model for robust collaborative recommendation. Acta Automatica Sinica, 2011, 37(9): 1067-1076 (李聪, 骆志刚. 用于鲁棒协同推荐的元信息增强变分贝叶斯矩阵分解模型. 自动化学报, 2011, 37(9): 1067-1076)
[11]	O'Mahony M P, Hurley N J, Silvestre G C M. Efficient and secure collaborative filtering through intelligent neighbor selection. In: Proceedings of the 16th European Conference on Artificial Intelligence. Valencia, Spain: IOS Press, 2004. 383-387
[12]	Mehta B, Hofmann T, Nejdl W. Robust collaborative filtering. In: Proceedings of the 2007 ACM Conference on Recommender Systems. New York, USA: ACM, 2007. 49-56
[13]	Huber P J. Robust estimation of a location parameter. The Annals of Mathematical Statistics, 1964, 35(1): 73-101
[14]	Rich E. User modeling via stereotypes. Cognitive Science, 1979, 3(4): 329-354
[15]	Liu Jian-Guo, Zhou Tao, Wang Bing-Hong. The research progress of personalized recommendation system. Progress in Natural Science, 2009, 19(1): 1-15 (刘建国, 周涛, 汪秉宏. 个性化推荐系统的研究进展. 自然科学进展, 2009, 19(1): 1-15)
[16]	Koren Y. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Las Vegas, Nevada, USA: ACM, 2008: 426-434
[17]	Koren Y, Robert B, Chris V. Matrix factorization techniques for recommender systems. Computer, 2009, 42(8): 30-37
[18]	Vozalis M G, Margaritis K G. Applying SVD on item-based filtering. In: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications. Greece: IEEE, 2005. 464-469
[19]	Xiang Liang. Recommendation System Practice. Beijing: Posts and Telecom Press, 2012.(项亮. 推荐系统实践. 北京: 人民邮电出版社, 2012.)
[20]	Li R H, Yu J X, Huang X, Cheng H. Robust reputation-based ranking on bipartite rating networks. In: Proceedings of the 2012 SDM International Conference on Data Mining. Hong Kong, China: SIAM, 2012. 612-623
[21]	De Alfaro L, Kulshreshtha A, Pye I, Adler T. Reputation systems for open collaboration. Communications of the ACM, 2011, 54(8): 81-87
[22]	Tang J L, Hu X, Gao H J, Liu H. Exploiting local and global social context for recommendation. In: Proceedings of the 12nd International Joint Conference on Artificial Intelligence. Bellevue, Washington, USA: AAAI Press, 2013. 2712-2718
[23]	Liao H, Cimini G, Medo M. Measuring quality, reputation and trust in online communities. In: Proceedings of the 20th International Symposium on Foundations of Intelligent Systems. Macau, China: Springer Berlin Heidelberg, 2012. 405-414
[24]	Zhou Y B, Lei T, Zhou T. A robust ranking algorithm to spamming. EPL (Europhysics Letters), 2011, 94(4): 48002
[25]	Mobasher B, Burke R, Bhaumik R, Williams C. Toward trustworthy recommender systems: an analysis of attack models and algorithm robustness. ACM Transactions on Internet Technology, 2007, 7(4): 1-40
[26]	Lv L Y, Medo M, Yeung C H, Zhang Y C, Zhang Z K, Zhou T. Recommender systems. Physics Reports, 2012, 519(1): 1-49