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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
metapath2vec: Scalable Representation Learning for Heterogeneous Networks
NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation
From ID-based to ID-free: Rethinking ID Effectiveness in Multimodal Collaborative Filtering Recommendation
RAG-VisualRec: An Open Resource for Vision- and Text-Enhanced Retrieval-Augmented Generation in Recommendation
LLM2Rec: Large Language Models Are Powerful Embedding Models for Sequential Recommendation
Dual-View Disentangled Multi-Intent Learning for Enhanced Collaborative Filtering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.