Welcome To WUJNS
武汉大学学报 英文版 | Wuhan University Journal of Natural Sciences
Wan Fang
CNKI
CSCD
Wuhan University
Latest Article
Robust Recommendation Algorithm Based on Kernel Principal Component Analysis and Fuzzy C-means Cluster-ing
Time:2018-3-29  
YI Huawei, NIU Zaiseng, ZHANG Fuzhi, LI Xiaohui, WANG Yajun
1. School of Electronics and Information Engineering, Liaoning University of Technology, Jinzhou 121001, Liaoning, China; 2. School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, Hebei, China
Abstract:
The existing recommendation algorithms have lower robustness in facing of shilling attacks. Considering this problem, we present a robust recommendation algorithm based on kernel principal component analysis and fuzzy c-means clustering. Firstly, we use kernel principal component analysis method to reduce the dimensionality of the original rating matrix, which can extract the effective features of users and items. Then, according to the dimension-reduced rating matrix and the high correlation characteristic between attack profiles, we use fuzzy c-means clustering method to cluster user profiles, which can realize the effective separation of genuine profiles and attack profiles. Finally, we construct an indicator function based on the attack detection results to decrease the influence of attack profiles on the recommendation, and incorporate it into the matrix factorization technology to design the corresponding robust recommendation algorithm. Experiment results indicate that the proposed algorithm is superior to the existing methods in both recommendation accuracy and robustness.
Key words:robust recommendation; shilling attacks; matrix factorization; kernel principal component analysis; fuzzy c-means clustering
CLC number:TP 311
References:
[1]	Bobadilla J, Ortega F, Hernando A, et al. Recommender systems survey [J]. Knowledge-Based Systems, 2013, 46(1): 109-132.
[2]	Suganeshwari G, Ibrahim S P S. A survey on collaborative filtering based recommendation system[C] // Proceedings of the 3rd International Symposium on Big Data and Cloud Computing Challenges. Berlin: Springer-Verlag, 2016: 503- 518.
[3]	Gunes I, Kaleli C, Bilge A, et al. Shilling attacks against recommender systems: a comprehensive survey[J]. Artificial Intelligence Review, 2014, 42(4):767-799.
[4]	Yilmazel B, Kaleli C. Robustness analysis of arbitrarily distributed data-based recommendation methods[J]. Expert Systems with Applications, 2016, 44: 217-229.
[5]	Mehta B, Nejdl W. Attack resistant collaborative filtering [C] // Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. New York: ACM Press, 2008:75-82.
[6]	Lee J, Zhu D. Shilling attack detection—A new approach for a trustworthy recommender system [J]. Informs Journal on Computing, 2012, 24(1): 117-131.
[7]	Bhaumik R, Mobasher B, Burke R. A clustering approach to unsupervised attack detection in collaborative recommender systems [C] // Proceedings of the 7th International Conference on Data Mining. Washington D C: IEEE Computer Society, 2011: 181-187.
[8]	Williams C A, Mobasher B, Burke R, et al. Detecting profile injection attacks in collaborative filtering: a classification- based approach [C] // Proceedings of the 8th Knowledge Discovery on the Web International Conference on Advances in Web Mining and Web Usage Analysis. Berlin, Heidelberg: Springer-Verlag, 2007: 167-186.
[9]	He F, Wang X, Liu B. Attack detection by rough set theory in recommendation system [C] // 2010 IEEE International Conference on Granular Computing. Piscataway: IEEE Press, 2010: 692-695.
[10]	Xia H, Fang B, Gao M, et al. A novel item anomaly detection approach against shilling attacks in collaborative recomm- enddation systems using the dynamic time interval segmentation technique[J]. Information Sciences, 2015, 306: 150-165.
[11]	Sandvig J J, Mobasher B, Burke R. A survey of collaborative recommendation and the robustness of model-based algorithms [J]. Bulletin of the Technical Committee on Data Engineering, 2008, 31(2): 3-13.
[12]	Sandvig J J, Mobasher B, Burke R. Robustness of collaborative recommendation based on association rule mining[C] // Proceedings of the 2007 ACM Conference on Recommender Systems. New York: ACM Press, 2007: 105- 112.
 
[13]	Mehta B, Hofmann T, Nejdl W. Robust collaborative filtering[C]// Proceedings of the 2007 ACM Conference on Recommender Systems. New York: ACM Press, 2007:49-56.
[14]	Cheng Z, Hurley N. Robust collaborative recommendation by least trimmed squares matrix factorization [C] // Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence. Piscataway: IEEE Press, 2010: 105-112.
[15]	Yi H , Zhang F, Lan J. A robust collaborative recommend- ation algorithm based on k-distance and Tukey M-estimator [J]. China Communications, 2014, 11(9): 119-130.
[16]	Li C, Luo Z. A metadata-enhanced variational bayesian matrix factorization model for robust collaborative recommendation[J]. Acta Automatica Sinica, 2011, 37(9): 1067-1076.
[17]	Zhang Y, Zhang S, Qian F, et al. Robust collaborative recommendation algorithm based on user’s reputation[J]. Acta Automatica Sinica, 2015, 41(5): 1004-1012.
[18]	Scholkopf B, Smola A. Nonlinear component analysis as a kernel eigenvalue problem [J]. Neural Computation, 1998, 10(5): 1299-1319.
[19]	Bezdek J C. Pattern Recognition with Fuzzy Objective Function Algorithms[M]. Norwell: Kluwer Academic Publishers, 1981.
[20]	Yi H , Zhang F. Robust recommendation algorithm based on the identification of suspicious users and matrix factorize- tion [J]. Journal of Information and Computational Science, 2014, 11(13): 4769-4777.
[21]	Miller B N, Albert I, Lam S K, et al. MovieLens unplugged: Experiences with an occasionally connected recommender system [C] // Proceedings of the 8th International Conference on Intelligent User Interfaces. New York: ACM Press, 2003: 263-266.
[22]	Ricci F, Rokach L, Shapira B, et al. Recommender Systems Handbook[M]. Berlin: Springer-Verlag, 2011.
Welcome To WUJNS

HOME | Aim and Scope | Editoral Board | Current Issue | Back Issue | Subscribe | Crosscheck | Polishing | Contact us Copyright © 1997-2018 All right reserved