Recommendation over a Heterogeneous Social Network

Authors:
  • JZJing Zhang
    Jing Zhang
  • JTJie Tang
    Jie Tang
  • BLBangyong Liang
    Bangyong Liang
  • ZYZi Yang
    Zi Yang
  • SWSijie Wang
    Sijie Wang
  • JZJingjing Zuo
    Jingjing Zuo
  • JLJuanzi Li
    Juanzi Li

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.

This publication has 8 references indexed in Scilit: