arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2003.13345cs.SIcs.IRcs.LGcs.NE
收藏

Empirical Comparison of Graph Embeddings for Trust-Based Collaborative Filtering

Graz University of Technology(格拉茨技术大学);Know-Center GmbH(知识中心有限公司)

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑