Xin Wang
ABSTRACT
With the explosive growth of online social networks, it is now well understood that social information is highly helpful to recommender systems. Social recommendation methods are capable of battling the critical cold-start issue, and thus can greatly improve prediction accuracy. The main intuition is that through trust and influence, users are more likely to develop affinity toward items consumed by their social ties. Despite considerable work in social recommendation, little attention has been paid to the important distinctions between strong and weak ties, two well-documented notions in social sciences. In this work, we study the effects of distinguishing strong and weak ties in social recommendation. We use neighbourhood overlap to approximate tie strength and extend the popular Bayesian Personalized Ranking (BPR) model to incorporate the distinction of strong and weak ties. We present an EM-based algorithm that simultaneously classifies strong and weak ties in a social network w.r.t. optimal recommendation accuracy and learns latent feature vectors for all users and all items. We conduct extensive empirical evaluation on four real-world datasets and demonstrate that our proposed method significantly outperforms state-of-the-art pairwise ranking methods in a variety of accuracy metrics.
- Y. Wu et al., Collaborative Denoising Auto-Encoders for Top-N Recommender Systems. In WSDM, pages 153--162, 2016. Google Scholar
Digital Library
- J. Li et al., Robust Unsupervised Feature Selection on Networked Data. In SIAM International Conference on Data Mining, 2016.Google Scholar
- X. Wang et al., Recommending Groups to Users Using User-Group Engagement and Time-Dependent Matrix Factorization. In AAAI, 2016.Google ScholarDigital Library
- I. Kahanda and J. Neville. Using Transactional Information to Predict Link Strength in Online Social Networks. In ICWSM, pages 74--81, 2009.Google Scholar
- R. Xiang, J. Neville and M. Rogati. Modeling relationship strength in online social networks. In WWW, pages 981--990, 2010. Google ScholarDigital Library
- V. Arnaboldi, A. Guazzini and A. Passarella. Egocentric online social networks: Analysis of key features and prediction of tie strength in Facebook. Computer Communications, 36(10):1130--1144, Elsevier, 2013.Google ScholarCross Ref
- E. Gilbert. Predicting tie strength in a new medium. In CSCW, pages 1047--1056, 2012. Google ScholarDigital Library
- A. Petróczi, T. Nepusz and F. Bazsó. Measuring tie-strength in virtual social networks. Connections, 27(2):39--52, 2007.Google Scholar
- R. Reagans. Preferences, identity, and competition: Predicting tie strength from demographic data. Management Science, 51(9):1374--1383, INFORMS, 2005. Google ScholarDigital Library
- A. Kavanaugh et al., Weak ties in networked communities. The Information Society, 21(2):119--131, Taylor & Francis, 2005.Google ScholarCross Ref
- N. Christakis and J. Fowler. Connected: how your friends' friends' friends affect everything you feel, think, and do. New York, NY: Little, Brown, and Company, 2009.Google Scholar
- L. Gee et al., Social Networks and Labor Markets: How Strong Ties Relate to Job Finding On Facebook's Social Network. Journal of Labor Economics, 2016.Google Scholar
- C. Zhang et al., Content attributes: A latent factor model for recommending scientific papers in heterogeneous academic networks. Advances in Information Retrieval, pages 39--50, Springer, 2014.Google Scholar
- L. A. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3):211--230, 2003.Google ScholarCross Ref
- G. Adomavicius and A. Tuzhilin. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Trans. Knowl. Data Eng., 17(6):734--749, 2005. Google ScholarDigital Library
- A. Das et al., Google news personalization: Scalable online collaborative filtering. In WWW, pages 271--280, 2007. Google ScholarDigital Library
- A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, Series B (Methodological), 39(1):1--38, 1977.Google ScholarCross Ref
- D. Easley and J. M. Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010. Google ScholarCross Ref
- S. Fortunato. Community detection in graphs. Physics Reports, 486(3):75--174, 2010.Google ScholarCross Ref
- E. Gilbert and K. Karahalios. Predicting tie strength with social media. In CHI, pages 211--220. ACM, 2009. Google ScholarDigital Library
- M. S. Granovetter. The strength of weak ties. American journal of sociology, pages 1360--1380, 1973.Google Scholar
- M. S. Granovetter. Getting a job: A study of contacts and careers. University of Chicago Press, 1974.Google Scholar
- G. Guo, J. Zhang, and N. Yorke-Smith. A novel bayesian similarity measure for recommender systems. In IJCAI, 2013. Google ScholarDigital Library
- Y. Hu, Y. Koren, and C. Volinsky. Collaborative filtering for implicit feedback datasets. In ICDM, pages 263--272, 2008. Google ScholarDigital Library
- M. Jamali and M. Ester. TrustWalker: a random walk model for combining trust-based and item-based recommendation. In KDD, pages 397--406, 2009. Google ScholarDigital Library
- M. Jamali and M. Ester. A matrix factorization technique with trust propagation for recommendation in social networks. In RecSys, pages 135--142, 2010. Google ScholarDigital Library
- L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18(1):39--43, March 1953.Google ScholarCross Ref
- Y. Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In KDD, pages 426--434, 2008. Google ScholarDigital Library
- Y. Koren et al. Matrix factorization techniques for recommender systems. IEEE Computer, 42(8):30--37, 2009. Google ScholarDigital Library
- A. Krohn-Grimberghe et al., Multi-relational matrix factorization using bayesian personalized ranking for social network data. In WSDM, pages 173--182. ACM, 2012. Google ScholarDigital Library
- D. Liben-Nowell and J. M. Kleinberg. The link prediction problem for social networks. In CIKM, pages 556--559, 2013. Google ScholarDigital Library
- W. Lu et al., Optimal recommendations under attraction, aversion, and social influence. In KDD, pages 811--820, 2014. Google ScholarDigital Library
- H. Ma, I. King, and M. R. Lyu. Learning to recommend with explicit and implicit social relations. ACM TIST, 2(3):29, 2011. Google ScholarDigital Library
- H. Ma et al., SoRec: social recommendation using probabilistic matrix factorization. In CIKM, 2008. Google ScholarDigital Library
- H. Ma, D. Zhou, C. Liu, M. R. Lyu, and I. King. Recommender systems with social regularization. In WSDM, pages 287--296, 2011. Google ScholarDigital Library
- D. Oard and J. Kim. Implicit feedback for recommender systems. In AAAI Workshop on Recommender Systems, pages 81--83, 1998.Google Scholar
- J.-P. Onnela et al., Structure and tie strengths in mobile communication networks. Proceedings of the National Academy of Sciences, 104(18):7332--7336, 2007.Google ScholarCross Ref
- R. Pan et al., One-class collaborative filtering. In ICDM, pages 502--511, 2008. Google ScholarDigital Library
- W. Pan and L. Chen. Gbpr: Group preference based bayesian personalized ranking for one-class collaborative filtering. In IJCAI, pages 2691--2697, 2013. Google ScholarDigital Library
- K. Panovich, R. Miller, and D. Karger. Tie strength in question & answer on social network sites. In CSCW, pages 1057--1066, 2012. Google ScholarDigital Library
- S. Rendle and C. Freudenthaler. Improving pairwise learning for item recommendation from implicit feedback. In WSDM, 2014. Google ScholarDigital Library
- S. Rendle et al., BPR: Bayesian personalized ranking from implicit feedback. In UAI, 2009. Google ScholarDigital Library
- F. Ricci, L. Rokach, B. Shapira, and P. B. Kantor, editors. Recommender Systems Handbook. Springer, 2011. Google ScholarCross Ref
- R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In NIPS, pages 1257--1264, 2007. Google ScholarDigital Library
- A. Wu et al., Detecting professional versus personal closeness using an enterprise social network site. In CHI, 2010. Google ScholarDigital Library
- S.-H. Yang et al., Like like alike: joint friendship and interest propagation in social networks. In WWW, 2011. Google ScholarDigital Library
- M. Ye et al., Exploring social influence for recommendation: a generative model approach. In SIGIR, 2012. Google ScholarDigital Library
- T. Zhao, J. McAuley, and I. King. Leveraging social connections to improve personalized ranking for collaborative filtering. In CIKM, pages 261--270, 2014. Google ScholarDigital Library
Index Terms
- Social Recommendation with Strong and Weak Ties
Recommendations
Learning Personalized Preference of Strong and Weak Ties for Social Recommendation
WWW '17: Proceedings of the 26th International Conference on World Wide WebRecent years have seen a surge of research on social recommendation techniques for improving recommender systems due to the growing influence of social networks to our daily life. The intuition of social recommendation is that users tend to show ...
A recommender model based on strong and weak social Ties: A Long-tail distribution perspective
Highlights- A collaborative filtering recommender model for E-commerce users is proposed.
- ...
AbstractA collaborative filtering recommender model for E-commerce users (CF-S&WLT) is proposed that incorporates an improved PageRank algorithm, strong and weak social ties and long-tail distribution items. The main design feature of the CF-S&...
Interactive Social Recommendation
CIKM '17: Proceedings of the 2017 ACM on Conference on Information and Knowledge ManagementSocial recommendation has been an active research topic over the last decade, based on the assumption that social information from friendship networks is beneficial for improving recommendation accuracy, especially when dealing with cold-start users who ...
Comments