Computer Science ›› 2016, Vol. 43 ›› Issue (5): 219-222.doi: 10.11896/j.issn.1002-137X.2016.05.040

Previous Articles     Next Articles

Split-Integration Recommendation Algorithm Based on Matrix Completion

WANG Yi and JIN Zhong   

  • Online:2018-12-01 Published:2018-12-01

Abstract: The traditional recommendation system usually uses collaborate filtering or content-based recommendation as its method,but this paper applied matrix completion.Because of the sparsity of data,if matrix completion is used directly,error will be relatively large.Considering that some active users exist in all users,by means of finding these special users,the sparsity will be reduced by their integrated data.And improving recommendation quality for these users will be more likely to generate values.This paper proposed a split-integration recommendation algorithm,and the experimental results show that the proposed method can improve the accuracy of recommendation.

Key words: Recommendation systems,Matrix completion,Active users,Split-Integration

[1] Pazzani M,Billsus D.Learning and revising user profiles:Theidentification of interesting Web sites[J].Machine Learning,1997,27:313-331
[2] Rich E.User modeling via stereotypes[J].Cognitive Science,1979,3(4):329-354
[3] Liu Zhang,Hansson A,Vadenberghe L.Nuclear norm systemidentification with missing inputs and outputs[J].Systems & Control Letters,2013,2(8):605-714
[4] Jing Guo-dong,Shi Yun-hui,Yin Bao-cai.Image super-resolution reconstruction based on sparse representation and low-rank matrix completion[J].Journal of Information & Computational Science,2012,9(13):3859-3866
[5] Cabral R S,Torre F D,Costeira J P,et al.Matrix completion for multi-label image classification[C]∥Proceedings of Neural information Processing System(NIPS).2011:190-198
[6] Cai Jian-feng,Candès E J,Shen Zuo-wei.A singular value th-resholding algorithm for matrix completion[J].SIAM Journal on Optimization,2010,0(4):1956-1982
[7] Ma Shi-qian,Goldfarb D,Chen Li-feng.Fixed point and Bregman iterative methods for matrix rank minimization[R].Technical Report,2008
[8] He Bing-sheng,Yuan Xiao-ming,Zhang Wen-xing.A customized proximal point algorithm for convex minimization with linear constraints[J].Computational Optimization and Application,2013,56(3):559-572
[9] Candès E J,Tao T.The power of convex relaxation:Near-optimal matrix completion[J].IEEE Transaction on information,2010,6(5):2053-2080
[10] Candès E J,Recht B.Exact matrix completion via convex optimization[J].Foundation of Computational Mathematics,2008,9:717-772
[11] Chen Cai-hua,He Bing-sheng.Matrix completion via alternating direction method[J].IMA Journal of Numerical Analysis,2012,32:227-245
[12] Konstan J A,Miller B N,Mahz D,et al.GroupLens:Applying collaborative filtering to usenet news[J].C ommunications of the ACM,1997,0(3):77-87
[13] Toh K C,Yun S.An accelerated proximal gradient algorithm for nuclear norm regularized least squares problem[J].Pacific Journal of Optimization,2010,6:615-640
[14] Gang Wu,Swaminathan,Mitra,et al.Online video session progress prediction using Low-Rank matrix completion[C]∥IEEE International Conference on Multimedia and Expo Workshops(ICMEW).2014:14-18
[15] Anupriya G,Angshul M.SVD free matrix completion with online bias correction for Recommender Systems[C]∥InternationalConference on Advances in Pattern Recognition(ICAPR).2015:4-7

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!