Who should you follow? Combining learning to rank with social influence for informative friend recommendation

被引:29
作者
Chen, Chien Chin [1 ]
Shih, Shun-Yuan [1 ]
Lee, Meng [1 ]
机构
[1] Natl Taiwan Univ, Dept Informat Management, Taipei, Taiwan
关键词
Recommendation systems; Learning to rank; Social influence; Matrix factorization; LINK-PREDICTION; USERS;
D O I
10.1016/j.dss.2016.06.017
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Social network sites have gradually taken the place of traditional media for people to receive the latest information. To receive novel information, users of social network sites are encouraged to establish social relations. The updates shared by friends form social update streams that provide people with up-to-date information. However, having too many friends can lead to an information overload problem causing users to be overwhelmed by the huge number of updates shared continuously by numerous friends. This information overload problem may affect user intentions to join social network sites and thereby possibly reduce the sites' advertising earnings, which are based on the number of users. In this paper, we propose,a learning-based recommendation method which suggests informative friends to users, where an informative friend is a friend whose posted updates are liked by the user. Techniques of learning to rank are designed to analyze user behavior and to model the latent preferences of users and updates. At the same time, the learning model is incorporated with social influence to enhance the learned preferences. Informative friends are recommended if the preferences of the updates that they share are highly associated with the preferences of a target user. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:33 / 45
页数:13
相关论文
共 57 条
[1]  
[Anonymous], 2007, Computers in Libraries, V27, P18
[2]  
[Anonymous], 2011, P WSDM 11 P 4 ACM IN
[3]  
[Anonymous], 2006, P 29 ANN INT ACM SIG, DOI [DOI 10.1145/1148170.1148245, 10.1145/1148170.1148245]
[4]  
[Anonymous], 2010, P 4 ACM C RECOMMENDE
[5]  
[Anonymous], 2010, Proceedings of WWW, DOI [10.1145/1772690.1772756, DOI 10.1145/1772690.1772756]
[6]  
[Anonymous], 2012, P 6 ACM C RECOMMENDE, DOI [10.1145/2365952.2365981, DOI 10.1145/2365952.2365981]
[7]  
[Anonymous], 2013, RecSys
[8]  
[Anonymous], 2012, P 6 ACM C REC SYST D, DOI DOI 10.1145/2365952.2365969
[9]  
[Anonymous], 2010, ACM RecSys'10', DOI DOI 10.1145/1864708.1864746
[10]  
[Anonymous], 1994, P 1994 ACM C COMPUTE