ABSTRACT
As online social media further integrates deeper into our lives, we spend more time consuming social update streams that come from our online connections. Although social update streams provide a tremendous opportunity for us to access information on-the-fly, we often complain about its relevance. Some of us are flooded with a steady stream of information and simply cannot process it in full. Ranking the incoming content becomes the only solution for the overwhelmed users. For some others, in contrast, the incoming information stream is pretty weak, and they have to actively search for relevant information which is quite tedious. For these users, augmenting their incoming content flow with relevant information from outside their first-degree network would be a viable solution. In that case, the problem of relevance becomes even more prominent. In this paper, we start an open discussion on how to build effective systems for ranking social updates from a unique perspective of LinkedIn -- the largest professional network in the world. More specifically, we address this problem as an intersection of learning to rank, collaborative filtering, and clickthrough modeling, while leveraging ideas from information retrieval and recommender systems. We propose a novel probabilistic latent factor model with regressions on explicit features and compare it with a number of non-trivial baselines. In addition to demonstrating superior performance of our model, we shed some light on the nature of social updates on LinkedIn and how users interact with them, which might be applicable to social update streams in general.
- D. Agarwal and B.-C. Chen. Regression-based latent factor models. In KDD 2009, pages 19--28. Google ScholarDigital Library
- F. Benevenuto, T. Rodrigues, M. Cha, and V. Almeida. Characterizing user behavior in online social networks. In SIGCOMM 2009, pages 49--62. Google ScholarDigital Library
- C. Borgs, J. T. Chayes, B. Karrer, B. Meeder, R. Ravi, R. Reagans, and A. Sayedi. Game-theoretic models of information overload in social networks. In Workshop on Algorithms and Models for the WebGraph 2010, pages 146--161.Google ScholarCross Ref
- S. Budalakoti and R. Bekkerman. Bimodal invitation-navigation fair bets model for authority identification in a social network. In WWW 2012, pages 709--718. Google ScholarDigital Library
- B. Cao, D. Shen, K. Wang, and Q. Yang. Clickthrough log analysis by collaborative ranking. In AAAI 2010.Google Scholar
- O. Chapelle and M. Wu. Gradient descent optimization of smoothed information retrieval metrics. Information Retrieval, 13:216--235, 2010. Google ScholarDigital Library
- J. Chen, R. Nairn, and E. Chi. Speak little and well: recommending conversations in online social streams. In CHI 2011, pages 217--226. Google ScholarDigital Library
- J. Chen, R. Nairn, L. Nelson, M. Bernstein, and E. Chi. Short and tweet: experiments on recommending content from information streams. In CHI 2010, pages 1185--1194. Google ScholarDigital Library
- N. Craswell, O. Zoeter, M. Taylor, and B. Ramsey. An experimental comparison of click position-bias models. In WSDM 2008, pages 87--94. Google ScholarDigital Library
- M. De Choudhury, S. Counts, and M. Czerwinski. Identifying relevant social media content: leveraging information diversity and user cognition. In Hypertext and Hypermedia 2011, pages 161--170. Google ScholarDigital Library
- Y. Duan, L. Jiang, T. Qin, M. Zhou, and H.-Y. Shum. An empirical study on learning to rank of tweets. In COLING 2010, pages 295--303. Google ScholarDigital Library
- L. Hong, O. Dan, and B. D. Davison. Predicting popular messages in twitter. In WWW 2011, pages 57--58. Google ScholarDigital Library
- B. Hu, Y. Zhang, W. Chen, G. Wang, and Q. Yang. Characterizing search intent diversity into click models. In WWW 2011, pages 17--26. Google ScholarDigital Library
- T. Joachims. Optimizing search engines using clickthrough data. In KDD 2002, pages 133--142. Google ScholarDigital Library
- N. Koenigstein, G. Dror, and Y. Koren. Yahoo! music recommendations: modeling music ratings with temporal dynamics and item taxonomy. In RecSys 2011, pages 165--172. Google ScholarDigital Library
- T. G. Kolda and B. W. Bader. Tensor decompositions and applications. SIAM Review, 51:455--500, August 2009. Google ScholarDigital Library
- Y. Koren. Factor in the neighbors: Scalable and accurate collaborative filtering. ACM TKDD, 4:1:1--1:24, January 2010. Google ScholarDigital Library
- Y. Koren and J. Sill. OrdRec: an ordinal model for predicting personalized item rating distributions. In RecSys 2011, pages 117--124. Google ScholarDigital Library
- T.-Y. Liu. Learning to rank for information retrieval. Foundations and Trends in Information Retrieval, 3(3):225--331, 2009. Google ScholarDigital Library
- S. Muralidharan, L. Rasmussen, D. Patterson, and J.-H. Shin. Hope for haiti: An analysis of facebook and twitter usage during the earthquake relief efforts. Public Relations Review, 37(2):175 -- 177, 2011.Google ScholarCross Ref
- M. Naaman, J. Boase, and C.-H. Lai. Is it really about me?: message content in social awareness streams. In CSCW 2010, pages 189--192. Google ScholarDigital Library
- T. Qin, T.-Y. Liu, and H. Li. A general approximation framework for direct optimization of information retrieval measures. Information Retrieval, 13:375--397, 2010. Google ScholarDigital Library
- S. Rendle. Factorization machines with libFM. ACM Transactions on Intelligent Systems and Technology (TIST), 3(3):57:1--57:22, 2012. Google ScholarDigital Library
- S. Rendle, L. Balby Marinho, A. Nanopoulos, and L. Schmidt-Thieme. Learning optimal ranking with tensor factorization for tag recommendation. In KDD 2009, pages 727--736. Google ScholarDigital Library
- S. Rendle, C. Freudenthaler, Z. Gantner, and S.-T. Lars. BPR: Bayesian personalized ranking from implicit feedback. In UAI 2009, pages 452--461. Google ScholarDigital Library
- S. Rendle and L. Schmidt-Thieme. Pairwise interaction tensor factorization for personalized tag recommendation. In WSDM 2010, pages 81--90. Google ScholarDigital Library
- R. Salakhutdinov and A. Mnih. Bayesian probabilistic matrix factorization using markov chain monte carlo. In ICML 2008, pages 880--887. Google ScholarDigital Library
- A. P. Singh and G. J. Gordon. A unified view of matrix factorization models. In ECML 2008, pages 358--373. Google ScholarDigital Library
- L. Xiong, X. Chen, T.-K. Huang, J. Schneider, and J. G. Carbonell. Temporal collaborative filtering with bayesian probabilistic tensor factorization. In SDM 2010, pages 211--222.Google ScholarCross Ref
- S.-H. Yang, B. Long, A. Smola, N. Sadagopan, Z. Zheng, and H. Zha. Like like alike: joint friendship and interest propagation in social networks. In WWW 2011, pages 537--546. Google ScholarDigital Library
- S.-H. Yang, B. Long, A. J. Smola, H. Zha, and Z. Zheng. Collaborative competitive filtering: learning recommender using context of user choice. In SIGIR 2011, pages 295--304. Google ScholarDigital Library
- Y. Yue, T. Finley, F. Radlinski, and T. Joachims. A support vector method for optimizing average precision. In SIGIR 2007, pages 271--278. Google ScholarDigital Library
- Y. Zhang, W. Chen, D. Wang, and Q. Yang. User-click modeling for understanding and predicting search-behavior. In KDD 2011, pages 1388--1396. Google ScholarDigital Library
- M. Zinkevich, A. Smola, M. Weimer, , and L. Li:. Parallelized stochastic gradient descent. In NIPS 2010, pages 1--9.Google Scholar
Index Terms
- Learning to rank social update streams
Recommendations
Who should you follow? Combining learning to rank with social influence for informative friend recommendation
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 ...
Learning to Rank with Trust and Distrust in Recommender Systems
RecSys '17: Proceedings of the Eleventh ACM Conference on Recommender SystemsThe sparsity of users' preferences can significantly degrade the quality of recommendations in the collaborative filtering strategy. To account for the fact that the selections of social friends and foes may improve the recommendation accuracy, we ...
Adaptive social similarities for recommender systems
RecSys '11: Proceedings of the fifth ACM conference on Recommender systemsCollaborative filtering (CF) is an effective recommendation technique, which selects items for an individual user based on similar users' preferences. However, CF may not fully reflect the procedure how people choose an item in real life, for users are ...
Comments