One-class Collaborative Filtering with Random Graphs: Annotated Version
The bane of one-class collaborative filtering is interpreting and modelling the latent signal from the missing class. In this paper we present a novel Bayesian generative model for implicit collaborative filtering. It forms a core component of the Xbox Live architecture, and unlike previous approaches, delineates the odds of a user disliking an item from simply not considering it. The latent signal is treated as an unobserved random graph connecting users with items they might have encountered. We demonstrate how large-scale distributed learning can be achieved through a combination of stochastic gradient descent and mean field variational inference over random graph samples. A fine-grained comparison is done against a state of the art baseline on real world data.
Code (0)
등록된 구현이 없습니다.
Tasks
Collaborative FilteringVariational InferenceSimilar Papers 제목 키워드 기반
Efficient Computation of Mean Truncated Hitting Times on Very Large Graphs
Previous work has shown the effectiveness of random walk hitting times as a measure of dissimilarity in a variety of graph-based learning problems such as collaborative filtering, query suggestion or finding paraphrases.…
Collaborative FilteringAlleviating Behavior Data Imbalance for Multi-Behavior Graph Collaborative Filtering
Graph collaborative filtering, which learns user and item representations through message propagation over the user-item interaction graph, has been shown to effectively enhance recommendation performance. However, most …
Collaborative FilteringMulti-Task LearningRepresentation LearningImproving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning
Recently, graph collaborative filtering methods have been proposed as an effective recommendation approach, which can capture users' preference over items by modeling the user-item interaction graphs. In order to reduce …
Collaborative FilteringContrastive LearningEmpirical 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 approache…
Collaborative FilteringNetwork EmbeddingThy Friend is My Friend: Iterative Collaborative Filtering for Sparse Matrix Estimation
The sparse matrix estimation problem consists of estimating the distribution of an $n\times n$ matrix $Y$, from a sparsely observed single instance of this matrix where the entries of $Y$ are independent random variable…
Collaborative FilteringCommunity DetectionGraphon EstimationMatrix Completion+1