Trust-based Top-k Item Recommendation in Social Networks ⋆

Collaborative filtering based methods have a low performance in the context of social recommendation due to the data sparsity issue and not considering the social network information that can be exploited to improve the performance. Trust-based methods attempt to reduce the data sparsity by utilizing the social network information. However, most of these methods are based on the explicit trust statements expressed by users, which are not available in the social networks such as Sina Weibo. In this paper, we present a trust metric to quantitatively measure the recommendation trust between pairs of users by aggregating the implicit trust and trust propagation values. We propose a trust-based latent factor model, which incorporates the pairwise recommendation trust values into the probabilistic model for top-k item recommendation. The experiments on Sina Weibo demonstrate that our method outperforms the collaborative filtering based methods and trust-based methods.

[1]  Luo Si,et al.  A Bayesian Approach toward Active Learning for Collaborative Filtering , 2004, UAI.

[2]  Greg Linden,et al.  Amazon . com Recommendations Item-to-Item Collaborative Filtering , 2001 .

[3]  Michael R. Lyu,et al.  Learning to recommend with social trust ensemble , 2009, SIGIR.

[4]  Martin Ester,et al.  A matrix factorization technique with trust propagation for recommendation in social networks , 2010, RecSys '10.

[5]  Jennifer Golbeck,et al.  Using probabilistic confidence models for trust inference in Web-based social networks , 2010, TOIT.

[6]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[7]  Weishi Zhang,et al.  Learning to recommend top-k items in online social networks , 2012, 2012 World Congress on Information and Communication Technologies.

[8]  Georg Lausen,et al.  Propagation Models for Trust and Distrust in Social Networks , 2005, Inf. Syst. Frontiers.

[9]  Gediminas Adomavicius,et al.  Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.

[10]  Thomas Hofmann,et al.  Latent semantic models for collaborative filtering , 2004, TOIS.

[11]  Martin Ester,et al.  Using a trust network to improve top-N recommendation , 2009, RecSys '09.

[12]  Yehuda Koren,et al.  Factorization meets the neighborhood: a multifaceted collaborative filtering model , 2008, KDD.

[13]  Paolo Avesani,et al.  Trust-aware recommender systems , 2007, RecSys '07.

[14]  John F. Canny,et al.  Collaborative filtering with privacy via factor analysis , 2002, SIGIR '02.

[15]  George Karypis,et al.  Item-based top-N recommendation algorithms , 2004, TOIS.

[16]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[17]  Jennifer Golbeck,et al.  Investigating interactions of trust and interest similarity , 2007, Decis. Support Syst..

[18]  Bradley N. Miller,et al.  GroupLens: applying collaborative filtering to Usenet news , 1997, CACM.

[19]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[20]  G. Molenberghs,et al.  A simple and fast alternative to the EM algorithm for incomplete categorical data and latent class models , 2001 .

[21]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[22]  Jennifer Golbeck,et al.  Computing and Applying Trust in Web-based Social Networks , 2005 .

[23]  Douglas B. Terry,et al.  Using collaborative filtering to weave an information tapestry , 1992, CACM.

[24]  Xueqi Cheng,et al.  Top-k learning to rank: labeling, ranking and evaluation , 2012, SIGIR '12.