Item Graph Convolution Collaborative Filtering for Inductive Recommendations
원문 초록
Graph Convolutional Networks (GCN) have been recently employed as core component in the construction of recommender system algorithms, interpreting user-item interactions as the edges of a bipartite graph. However, in the absence of side information, the majority of existing models adopt an approach of randomly initialising the user embeddings and optimising them throughout the training process. This strategy makes these algorithms inherently transductive, curtailing their ability to generate predictions for users that were unseen at training time. To address this issue, we propose a convolution-based algorithm, which is inductive from the user perspective, while at the same time, depending only on implicit user-item interaction data. We propose the construction of an item-item graph through a weighted projection of the bipartite interaction network and to employ convolution to inject higher order associations into item embeddings, while constructing user representations as weighted sums of the items with which they have interacted. Despite not training individual embeddings for each user our approach achieves state of-the-art recommendation performance with respect to transductive baselines on four real-world datasets, showing at the same time robust inductive performance.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation
RAG-VisualRec: An Open Resource for Vision- and Text-Enhanced Retrieval-Augmented Generation in Recommendation
Discrete Scale-invariant Metric Learning for Efficient Collaborative Filtering
Uncertainty in Repeated Implicit Feedback as a Measure of Reliability
Unveiling Contrastive Learning's Capability of Neighborhood Aggregation for Collaborative Filtering
SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.