当前位置: X-MOL 学术arXiv.cs.NE › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Empirical Comparison of Graph Embeddings for Trust-Based Collaborative Filtering
arXiv - CS - Neural and Evolutionary Computing Pub Date : 2020-03-30 , DOI: arxiv-2003.13345
Tomislav Duricic, Hussain Hussain, Emanuel Lacic, Dominik Kowald, Denis Helic, Elisabeth Lex

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.

中文翻译:

基于信任的协同过滤图嵌入的实证比较

在这项工作中,我们研究了图嵌入的效用,以生成用于基于信任的协同过滤的潜在用户表示。在冷启动环境中,在三个公开可用的数据集上,我们评估来自四个方法系列的方法:(i)基于分解,(ii)基于随机游走,(iii)基于深度学习,以及(iv)大型-scale 信息网络嵌入 (LINE) 方法。我们发现,在这四个系列中,基于随机游走的方法始终能达到最佳准确度。此外,它们会产生高度新颖和多样化的建议。此外,我们的结果表明,在基于信任的协同过滤中使用图嵌入显着提高了用户覆盖率。
更新日期:2020-03-31
down
wechat
bug