Improving User Topic Interest Profiles by Behavior Factorization

被引:107
作者
Zhao, Zhe [1 ]
Cheng, Zhiyuan [2 ]
Hong, Lichan [2 ]
Chi, Ed H. [2 ]
机构
[1] Univ Michigan, Dept EECS, Ann Arbor, MI 48109 USA
[2] Google Inc, Mountain View, CA USA
来源
PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW 2015) | 2015年
关键词
Personalization; Behavior Factorization; User Profiles;
D O I
10.1145/2736277.2741656
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Many recommenders aim to provide relevant recommendations to users by building personal topic interest profiles and then using these profiles to find interesting contents for the user. In social media, recommender systems build user profiles by directly combining users' topic interest signals from a wide variety of consumption and publishing behaviors, such as social media posts they authored, commented on, +1'd or liked. Here we propose to separately model users' topical interests that come from these various behavioral signals in order to construct better user profiles. Intuitively, since publishing a post requires more effort, the topic interests coming from publishing signals should be more accurate of a user's central interest than, say, a simple gesture such as a+1. By separating a single user's interest profile into several behavioral profiles, we obtain better and cleaner topic interest signals, as well as enabling topic prediction for different types of behavior, such as topics that the user might +1 or comment on, but might never write a post on that topic. To do this at large scales in Google+, we employed matrix factorization techniques to model each user's behaviors as a separate example entry in the input user-by-topic matrix. Using this technique, which we call "behavioral factorization", we implemented and built a topic recommender predicting user's topical interests using their actions within Google+. We experimentally showed that we obtained better and cleaner signals than baseline methods, and are able to more accurately predict topic interests as well as achieve better coverage.
引用
收藏
页码:1406 / 1416
页数:11
相关论文
共 38 条
[1]  
Abel F, 2011, LECT NOTES COMPUT SC, V7031, P1, DOI 10.1007/978-3-642-25073-6_1
[2]  
[Anonymous], 2009, P 3 ACM C REC SYST
[3]  
[Anonymous], 2008, NIPS WORKSH CIT
[4]   Latent Dirichlet allocation [J].
Blei, DM ;
Ng, AY ;
Jordan, MI .
JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) :993-1022
[5]  
Chen JL, 2011, 29TH ANNUAL CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS, P217
[6]  
Dou Z, 2007, P 16 INT C WORLD WID, P581, DOI [DOI 10.1145/1242572.1242651, 10.1145/1242572.1242651]
[7]  
Goffman E., 1959, PRESENTATION SELF EV
[8]  
Gupta P., WWW 2013, P505
[9]  
Guy I, 2010, SIGIR 2010: PROCEEDINGS OF THE 33RD ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH DEVELOPMENT IN INFORMATION RETRIEVAL, P194
[10]  
Hannak A, 2013, P 22 INT C WORLD WID, DOI [DOI 10.1145/2488388.2488435, 10.1145/2488388.2488435]