skip to main content
10.1145/1963405.1963481acmotherconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article

Like like alike: joint friendship and interest propagation in social networks

Published: 28 March 2011 Publication History

Abstract

Targeting interest to match a user with services (e.g. news, products, games, advertisements) and predicting friendship to build connections among users are two fundamental tasks for social network systems. In this paper, we show that the information contained in interest networks (i.e. user-service interactions) and friendship networks (i.e. user-user connections) is highly correlated and mutually helpful. We propose a framework that exploits homophily to establish an integrated network linking a user to interested services and connecting different users with common interests, upon which both friendship and interests could be efficiently propagated. The proposed friendship-interest propagation (FIP) framework devises a factor-based random walk model to explain friendship connections, and simultaneously it uses a coupled latent factor model to uncover interest interactions. We discuss the flexibility of the framework in the choices of loss objectives and regularization penalties and benchmark different variants on the Yahoo! Pulse social networking system. Experiments demonstrate that by coupling friendship with interest, FIP achieves much higher performance on both interest targeting and friendship prediction than systems using only one source of information.

References

[1]
D. Agarwal and B.-C. Chen. Regression-based latent factor models. In KDD'09.
[2]
D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. JMLR, 3:993--1022, 2003.
[3]
Y. Chen, D. Pavlov, and J. F. Canny. Large-scale behavioral targeting. In KDD'09.
[4]
W. Chu and S.-T. Park. Personalized recommendation on dynamic content using predictive bilinear models. In WWW'09.
[5]
S. Gauch, M. Speretta, A. Chandramouli, and A. Micarelli. User profiles for personalized information access. In The Adaptive Web, 2007.
[6]
O. Kallenberg. Probabilistic symmetries and invariance principles. Springer, 2005.
[7]
T. Kameda, Y. Ohtsubo, and M. Takezawa. Centrality in sociocognitive networks and social influence: An illustration of group decision-making. Journal Social Psychology, 73(2):296--309, 1997.
[8]
R. I. Kondor and J. D. Lafferty. Diffusion kernels on graphs and other discrete input spaces. In ICML'02.
[9]
Y. Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In KDD'08.
[10]
Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. Computer, 42(8):30--37, 2009.
[11]
J. Lafferty and G. Lebanon. Diffusion kernels on statistical manifolds. JMLR, 6:129--163, 2005.
[12]
H. Lee, R. Raina, A. Teichman, and A. Y. Ng. Exponential family sparse coding with applications to self-taught learning. In IJCAI'09.
[13]
J. Leskovec, K. J. Lang, and M. Mahoney. Empirical comparison of algorithms for network community detection. In WWW'10.
[14]
D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM'03.
[15]
B. Long, Z. M. Zhang, X. Wu, and P. S. Yu. Spectral clustering for multi-type relational data. In ICML'06.
[16]
H. Ma, H. Yang, M. R. Lyu, and I. King. Sorec: social recommendation using probabilistic matrix factorization. In CIKM'08.
[17]
M. R. McLaughlin and J. L. Herlocker. A collaborative filtering algorithm and evaluation metric that accurately model the user experience. In SIGIR'04.
[18]
M. McPherson, L. S. Lovin, and J. M. Cook. Birds of a feather: Homophily in social networks. Annual Review of Sociology, 27(1):415--444, 2001.
[19]
M. E. J. Newman. Detecting community structure in networks. European Physical Journal B, 2004.
[20]
M. E. J. Newman. Modularity and community structure in networks. PNAS, 2006.
[21]
J. Owyang. The many challenges of social network sites. Webstrategist blog, Feb.11, 2008.
[22]
M. Rosvall and C. T. Bergstrom. Maps of random walks on complex networks reveal community structure. PNAS, 105(4):1118--1123, 2008.
[23]
R. Salakhutdinov and A. Mnih. Bayesian probabilistic matrix factorization using MCMC. In ICML'08.
[24]
B. Sarwar, G. Karypis, J. Konstan, and J. Reidl. Item-based collaborative filtering recommendation algorithms. In WWW'01.
[25]
X. Shen, G. C. Tseng, X. Zhang, and W. H. Wong. On psi-learning. JASA, 98:724--734,2003.
[26]
M. Shmueli-Scheuer, H. Roitman, D. Carmel, Y. Mass, and D. Konopnicki. Extracting user profiles from large scale data. In MDAC'10.
[27]
A. P. Singh and G. J. Gordon. Relational learning via collective matrix factorization. In KDD'08.
[28]
K. Weinberger, A. Dasgupta, J. Langford, A. Smola, and J. Attenberg. Feature hashing for large scale multitask learning. In ICML'09.
[29]
M. Weimer, A. Karatzoglou, Q. Le, and A. Smola CofiRank - maximum margin matrix factorization for collaborativeranking. In NIPS'07.
[30]
S.-H. Yang and B.-G. Hu. A stagewise least square loss function for classification. In SDM'08.
[31]
Z. Zheng, H. Zha, T. Zhang, O. Chapelle, K. Chen, and G. Sun. A general boosting method and its application to learning ranking functions for websearch. In NIPS'08.
[32]
D. Zhou, S. Zhu, K. Yu, X. Song, B. L. Tseng, H. Zha, and C. L.Giles. Learning multiple graphs for document recommendations. In WWW'08.
[33]
M. Zinkevich, M. Weimer, A. Smola, and L. Li. Parallelized Stochastic Gradient Descent. In NIPS' 10.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
WWW '11: Proceedings of the 20th international conference on World wide web
March 2011
840 pages
ISBN:9781450306324
DOI:10.1145/1963405
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]

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 March 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. interest targeting
  2. link prediction
  3. social network

Qualifiers

  • Research-article

Conference

WWW '11
WWW '11: 20th International World Wide Web Conference
March 28 - April 1, 2011
Hyderabad, India

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)83
  • Downloads (Last 6 weeks)8
Reflects downloads up to 28 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media