skip to main content
10.1145/2623330.2623733acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Who to follow and why: link prediction with explanations

Published:24 August 2014Publication History

ABSTRACT

User recommender systems are a key component in any on-line social networking platform: they help the users growing their network faster, thus driving engagement and loyalty.

In this paper we study link prediction with explanations for user recommendation in social networks. For this problem we propose WTFW ("Who to Follow and Why"), a stochastic topic model for link prediction over directed and nodes-attributed graphs. Our model not only predicts links, but for each predicted link it decides whether it is a "topical" or a "social" link, and depending on this decision it produces a different type of explanation.

A topical link is recommended between a user interested in a topic and a user authoritative in that topic: the explanation in this case is a set of binary features describing the topic responsible of the link creation. A social link is recommended between users which share a large social neighborhood: in this case the explanation is the set of neighbors which are more likely to be responsible for the link creation.

Our experimental assessment on real-world data confirms the accuracy of WTFW in the link prediction and the quality of the associated explanations.

Skip Supplemental Material Section

Supplemental Material

p1266-sidebyside.mp4

mp4

282.7 MB

References

  1. L. Backstrom and J. Leskovec. Supervised random walks: Predicting and recommending links in social networks. In WSDM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. N. Barbieri, F. Bonchi, and G. Manco. Cascade-based community detection. In WSDM, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Bishop. Pattern Recognition and Machine Learning. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Blei, A. Ng, and M. Jordan. Latent dirichlet allocation. J. Mach. Learn. Res., 3:993--1022, 2003. Google ScholarGoogle ScholarCross RefCross Ref
  5. F. Bonchi, C. Castillo, A. Gionis, and A. Jaimes. Social network analysis and mining for business applications. ACM TIST, 2(3):22, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. E. Erosheva, S. Fienberg, and J. Lafferty. Mixed-membership models of scientific publications. PNAS, 101:5220--5227, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  7. S. Gershman and D. Blei. A tutorial on bayesian nonparametric models. Journal of Mathematical Psychology, 56:1--12, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  8. L. Getoor and C. P. Diehl. Link mining: a survey. SIGKDD Explorations, 7(2):3--12, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. N. Z. Gong, A. Talwalkar, L. W. Mackey, L. Huang, E. C. R. Shin, E. Stefanov, E. Shi, and D. Song. Joint link prediction and attribute inference using a social-attribute network. ACM TIST, 5(2), 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. P. A. Grabowicz, L. M. Aiello, V. M. Eguiluz, and A. Jaimes. Distinguishing topical and social groups based on common identity and bond theory. In WSDM, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. P. Gupta, A. Goel, J. Lin, A. Sharma, D. Wang, and R. Zadeh. Wtf: the who to follow service at twitter. In WWW, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. A. Hasan and M. J. Zaki. A survey of link prediction in social networks. In Social Network Data Analytics, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  13. G. Heinrich. Parameter Estimation for Text Analysis. Technical report, University of Leipzig, 2008.Google ScholarGoogle Scholar
  14. J. L. Herlocker, J. A. Konstan, and J. Riedl. Explaining collaborative filtering recommendations. In CSCW, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. Jamali, T. Huang, and M. Ester. A generalized stochastic block model for recommendation in social rating networks. In RecSys, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. Leskovec and C. Faloutsos. Sampling from large graphs. In KDD, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. D. Liben-Nowell and J. M. Kleinberg. The link prediction problem for social networks. In CIKM, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. L. Laü and T. Zhou. Link prediction in complex networks: A survey. Physica A, 390(6):1150--1170, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  19. K. T. Miller, T. L. Griffiths, and M. I. Jordan. Nonparametric latent feature models for link prediction. In NIPS, 2009.Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. T. Minka. Estimating a Dirichlet distribution. Web, 2000.Google ScholarGoogle Scholar
  21. F. Moser, R. Colak, A. Rafiey, and M. Ester. Mining cohesive patterns from graphs with feature vectors. In SDM, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  22. R. M. Nallapati, A. Ahmed, E. P. Xing, and W. W. Cohen. Joint latent topic models for text and citations. In KDD, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. S. Pool, F. Bonchi, and M. van Leeuwen. Description-Driven Community Detection. ACM TIST 5(2): 28, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. D. A. Prentice, D. T. Miller, and J. R. Lightdale. Asymmetries in Attachments to Groups and to their Members: Distinguishing between Common-Identity and Common-Bond Groups. Personality and Social Psychology Bulletin, 20(5):484--493, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  25. P. Pu and L. Chen. Trust building with explanation interfaces. In IUI, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Y. Ren, R. Kraut, and S. Kiesler. Applying Common Identity and Bond Theory to Design of Online Communities. Organization Studies, 28(3):377--408, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  27. M. Sachan, D. Contractor, T. A. Faruquie, and L. V. Subramaniam. Using content and interactions for discovering communities in social networks. In WWW, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. V. Sindhwani, S. Bucak, J. Hu, and A. Mojsilovic. One-class matrix completion with low-density factorizations. In ICDM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. B. Taskar, M. F. Wong, P. Abbeel, and D. Koller. Link prediction in relational data. In NIPS, 2003.Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. N. Tintarev and J. Masthoff. Effective explanations of recommendations: user-centered design. In RecSys, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. X. Wang, L. Tang, H. Gao, and H. Liu. Discovering overlapping groups in social media. In ICDM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Z. Xu, Y. Ke, Y. Wang, H. Cheng, and J. Cheng, A Model-based Approach to Attributed Graph Clustering. In SIGMOD, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Z. Yin, M. Gupta, T. Weninger, and J. Han. Linkrec: a unified framework for link recommendation with user attributes and graph structure. In WWW, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. K. Yu, W. Chu, S. Yu, V. Tresp, and Z. Xu. Stochastic relational models for discriminative link prediction. In NIPS, 2006.Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Y. Zhou, H. Cheng, and J. X. Yu. Graph clustering based on structural/attribute similarities. PVLDB, 2(1):718--729, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Who to follow and why: link prediction with explanations

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      KDD '14: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
      August 2014
      2028 pages
      ISBN:9781450329569
      DOI:10.1145/2623330

      Copyright © 2014 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 24 August 2014

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      KDD '14 Paper Acceptance Rate151of1,036submissions,15%Overall Acceptance Rate1,133of8,635submissions,13%

      Upcoming Conference

      KDD '24

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader