Localized Graph Collaborative Filtering

• URL: http://arxiv.org/abs/2108.04475v1
• Date: Tue, 10 Aug 2021 06:48:32 GMT
• Title: Localized Graph Collaborative Filtering
• Authors: Yiqi Wang, Chaozhuo Li, Mingzheng Li, Wei Jin, Yuming Liu, Hao Sun, Xing Xie
• Abstract summary: We introduce a novel perspective to build GNN-based CF methods for recommendations. One key advantage of LGCF is that it does not need to learn embeddings for each user and item. Experiments on various datasets validate the effectiveness of LGCF especially in sparse scenarios.
• Score: 20.868562372148677
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: User-item interactions in recommendations can be naturally de-noted as a user-item bipartite graph. Given the success of graph neural networks (GNNs) in graph representation learning, GNN-based C methods have been proposed to advance recommender systems. These methods often make recommendations based on the learned user and item embeddings. However, we found that they do not perform well wit sparse user-item graphs which are quite common in real-world recommendations. Therefore, in this work, we introduce a novel perspective to build GNN-based CF methods for recommendations which leads to the proposed framework Localized Graph Collaborative Filtering (LGCF). One key advantage of LGCF is that it does not need to learn embeddings for each user and item, which is challenging in sparse scenarios. Alternatively, LGCF aims at encoding useful CF information into a localized graph and making recommendations based on such graph. Extensive experiments on various datasets validate the effectiveness of LGCF especially in sparse scenarios. Furthermore, empirical results demonstrate that LGCF provides complementary information to the embedding-based CF model which can be utilized to boost recommendation performance.

Related papers

• Neural Graph Collaborative Filtering Using Variational Inference [19.80976833118502]
  We introduce variational embedding collaborative filtering (GVECF) as a novel framework to incorporate representations learned through a variational graph auto-encoder. Our proposed method achieves up to 13.78% improvement in the recall over the test data.
  arXiv  Detail & Related papers  (2023-11-20T15:01:33Z)
• Graph Neural Bandits [49.85090929163639]
  We propose a framework named Graph Neural Bandits (GNB) to leverage the collaborative nature among users empowered by graph neural networks (GNNs) To refine the recommendation strategy, we utilize separate GNN-based models on estimated user graphs for exploitation and adaptive exploration.
  arXiv  Detail & Related papers  (2023-08-21T15:57:57Z)
• Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis [50.972595036856035]
  We present a code that successfully replicates results from six popular and recent graph recommendation models. We compare these graph models with traditional collaborative filtering models that historically performed well in offline evaluations. By investigating the information flow from users' neighborhoods, we aim to identify which models are influenced by intrinsic features in the dataset structure.
  arXiv  Detail & Related papers  (2023-08-01T09:31:44Z)
• On Manipulating Signals of User-Item Graph: A Jacobi Polynomial-based Graph Collaborative Filtering [45.75671148689973]
  Graph Collaborative (CF) is an important research direction in recommender systems. In this paper, we analyze the important factors that a graph filter should consider to achieve better performance. Based on Jacobi bases and filtering frequency decomposition strategies, we design JGCF, which brings at most 27.06% performance gain on Alibaba-iFashion.
  arXiv  Detail & Related papers  (2023-06-06T12:22:09Z)
• Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
  We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions. OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences. We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
  arXiv  Detail & Related papers  (2022-09-12T09:19:22Z)
• An Adaptive Graph Pre-training Framework for Localized Collaborative Filtering [79.17319280791237]
  We propose an adaptive graph pre-training framework for localized collaborative filtering (ADAPT) ADAPT captures both the common knowledge across different graphs and the uniqueness for each graph. It does not require transferring user/item embeddings, and is able to capture both the common knowledge across different graphs and the uniqueness for each graph.
  arXiv  Detail & Related papers  (2021-12-14T06:53:13Z)
• How Powerful is Graph Convolution for Recommendation? [21.850817998277158]
  Graph convolutional networks (GCNs) have recently enabled a popular class of algorithms for collaborative filtering (CF) In this paper, we endeavor to obtain a better understanding of GCN-based CF methods via the lens of graph signal processing.
  arXiv  Detail & Related papers  (2021-08-17T11:38:18Z)
• Graph Trend Networks for Recommendations [34.06649831739749]
  The key of recommender systems is to predict how likely users will interact with items based on their historical online behaviors. To exploit these user-item interactions, there are increasing efforts on considering the user-item interactions as a user-item bipartite graph. Despite their success, most existing GNN-based recommender systems overlook the existence of interactions caused by unreliable behaviors. We propose the Graph Trend Networks for recommendations (GTN) with principled designs that can capture the adaptive reliability of the interactions.
  arXiv  Detail & Related papers  (2021-08-12T06:09:18Z)
• User Embedding based Neighborhood Aggregation Method for Inductive Recommendation [0.48598200320383667]
  We consider the problem of learning latent features (aka embedding) for users and items in a recommendation setting. Recent methods using graph convolutional networks (e.g., LightGCN) achieve state-of-the-art performance. We propose a graph convolutional network modeling approach for collaborative filtering CF-GCN.
  arXiv  Detail & Related papers  (2021-02-15T14:30:01Z)
• LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation [100.76229017056181]
  Graph Convolution Network (GCN) has become new state-of-the-art for collaborative filtering. In this work, we aim to simplify the design of GCN to make it more concise and appropriate for recommendation. We propose a new model named LightGCN, including only the most essential component in GCN -- neighborhood aggregation.
  arXiv  Detail & Related papers  (2020-02-06T06:53:42Z)
• Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approach [55.44107800525776]
  Graph Convolutional Networks (GCNs) are state-of-the-art graph based representation learning models. In this paper, we revisit GCN based Collaborative Filtering (CF) based Recommender Systems (RS) We show that removing non-linearities would enhance recommendation performance, consistent with the theories in simple graph convolutional networks. We propose a residual network structure that is specifically designed for CF with user-item interaction modeling.
  arXiv  Detail & Related papers  (2020-01-28T04:41:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.