Empirical Comparison of Graph Embeddings for Trust-Based Collaborative Filtering

In this work, we study the utility of graph embeddings to generate latent user representations for trust-based collaborative filtering. In a cold-start setting, on three publicly available datasets, we evaluate approaches from four method families: (i) factorization-based, (ii) random walk-based, (iii) deep learning-based, and (iv) the Large-scale Information Network Embedding (LINE) approach. We find that across the four families, random-walk-based approaches consistently achieve the best accuracy. Besides, they result in highly novel and diverse recommendations. Furthermore, our results show that the use of graph embeddings in trust-based collaborative filtering significantly improves user coverage.

[1]  Huan Liu,et al.  mTrust: discerning multi-faceted trust in a connected world , 2012, WSDM '12.

[2]  Wei Lu,et al.  Deep Neural Networks for Learning Graph Representations , 2016, AAAI.

[3]  Jure Leskovec,et al.  node2vec: Scalable Feature Learning for Networks , 2016, KDD.

[4]  Young Ae Kim,et al.  An enhanced trust propagation approach with expertise and homophily-based trust networks , 2015, Knowl. Based Syst..

[5]  David M. Pennock,et al.  Categories and Subject Descriptors , 2001 .

[6]  Barry Smyth,et al.  Trust in recommender systems , 2005, IUI.

[7]  Jeffrey Dean,et al.  Distributed Representations of Words and Phrases and their Compositionality , 2013, NIPS.

[8]  Alexander J. Smola,et al.  Distributed large-scale natural graph factorization , 2013, WWW.

[9]  Dominik Kowald,et al.  Trust-based collaborative filtering: tackling the cold start problem using regular equivalence , 2018, RecSys.

[10]  Barry Smyth,et al.  Similarity vs. Diversity , 2001, ICCBR.

[11]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[12]  Steven Skiena,et al.  DeepWalk: online learning of social representations , 2014, KDD.

[13]  Mingzhe Wang,et al.  LINE: Large-scale Information Network Embedding , 2015, WWW.

[14]  Mikhail Belkin,et al.  Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering , 2001, NIPS.

[15]  Mehrbakhsh Nilashi,et al.  Collaborative filtering recommender systems , 2013 .

[16]  Jian Pei,et al.  Asymmetric Transitivity Preserving Graph Embedding , 2016, KDD.

[17]  Neil Yorke-Smith,et al.  A Novel Bayesian Similarity Measure for Recommender Systems , 2013, IJCAI.

[18]  Daniele Quercia,et al.  Auralist: introducing serendipity into music recommendation , 2012, WSDM '12.

[19]  Paolo Avesani,et al.  Trust-Aware Collaborative Filtering for Recommender Systems , 2004, CoopIS/DOA/ODBASE.

[20]  Jure Leskovec,et al.  Representation Learning on Graphs: Methods and Applications , 2017, IEEE Data Eng. Bull..

[21]  Licia Capra,et al.  Trust-Based Collaborative Filtering , 2008, IFIPTM.

[22]  Hendrik Drachsler,et al.  Implicit vs. explicit trust in social matrix factorization , 2014, RecSys '14.

[23]  Lois M. L. Delcambre,et al.  Discounted Cumulated Gain Based Evaluation of Multiple-Query IR Sessions , 2008, ECIR.

[24]  Saul Vargas,et al.  Rank and relevance in novelty and diversity metrics for recommender systems , 2011, RecSys '11.

[25]  Jure Leskovec,et al.  Inductive Representation Learning on Large Graphs , 2017, NIPS.

[26]  Derek Bridge,et al.  Diversity, Serendipity, Novelty, and Coverage , 2016, ACM Trans. Interact. Intell. Syst..

[27]  Qiongkai Xu,et al.  GraRep: Learning Graph Representations with Global Structural Information , 2015, CIKM.

[28]  Wenwu Zhu,et al.  Structural Deep Network Embedding , 2016, KDD.

[29]  Palash Goyal,et al.  Graph Embedding Techniques, Applications, and Performance: A Survey , 2017, Knowl. Based Syst..

[30]  Ryan A. Rossi,et al.  Learning Role-based Graph Embeddings , 2018, ArXiv.