Recommendation over a Heterogeneous Social Network

  • Authors:
  • Jing Zhang;Jie Tang;Bangyong Liang;Zi Yang;Sijie Wang;Jingjing Zuo;Juanzi Li

  • Affiliations:
  • -;-;-;-;-;-;-

  • Venue:
  • WAIM '08 Proceedings of the 2008 The Ninth International Conference on Web-Age Information Management
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the Web content having been changed from homogeneity to heterogeneity, the recommendation becomes a more challenging issue. In this paper, we have investigated the recommendation problem on a general heterogeneous Web social network. We categorize the recommendation needs on it into two main scenarios: recommendation when a person is doing a search and recommendation when the person is browsing the information. We formalize the recommendation as a ranking problem over the heterogeneous network. Moreover, we propose using a random walk model to simultaneously ranking different types of objects and propose a pair-wise learning algorithm to learn the weight of each type of relationship in the model. Experimental results on two real-world data sets show that improvements can be obtained by comparing with the baseline methods.