Graph Neural Ordinary Differential Equations-based method for Collaborative Filtering

• URL: http://arxiv.org/abs/2311.12329v1
• Date: Tue, 21 Nov 2023 03:42:15 GMT
• Title: Graph Neural Ordinary Differential Equations-based method for Collaborative Filtering
• Authors: Ke Xu, Yuanjie Zhu, Weizhi Zhang, Philip S. Yu
• Abstract summary: We propose a Graph Neural Ordinary Differential Equation-based method for Collaborative Filtering (GODE-CF) This method estimates the final embedding by utilizing the information captured by one or two GCN layers. We show that our proposed GODE-CF model has several advantages over traditional GCN-based models.
• Score: 40.39806741673175
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Graph Convolution Networks (GCNs) are widely considered state-of-the-art for collaborative filtering. Although several GCN-based methods have been proposed and achieved state-of-the-art performance in various tasks, they can be computationally expensive and time-consuming to train if too many layers are created. However, since the linear GCN model can be interpreted as a differential equation, it is possible to transfer it to an ODE problem. This inspired us to address the computational limitations of GCN-based models by designing a simple and efficient NODE-based model that can skip some GCN layers to reach the final state, thus avoiding the need to create many layers. In this work, we propose a Graph Neural Ordinary Differential Equation-based method for Collaborative Filtering (GODE-CF). This method estimates the final embedding by utilizing the information captured by one or two GCN layers. To validate our approach, we conducted experiments on multiple datasets. The results demonstrate that our model outperforms competitive baselines, including GCN-based models and other state-of-the-art CF methods. Notably, our proposed GODE-CF model has several advantages over traditional GCN-based models. It is simple, efficient, and has a fast training time, making it a practical choice for real-world situations.

Related papers

• First-order PDES for Graph Neural Networks: Advection And Burgers Equation Models [1.4174475093445238]
  This paper presents new Graph Neural Network models that incorporate two first-order Partial Differential Equations (PDEs) Our experimental findings highlight the capacity of our new PDE model to achieve comparable results with higher-order PDE models and fix the over-smoothing problem up to 64 layers. Results underscore the adaptability and versatility of GNNs, indicating that unconventional approaches can yield outcomes on par with established techniques.
  arXiv  Detail & Related papers  (2024-04-03T21:47:02Z)
• Ensemble Quadratic Assignment Network for Graph Matching [52.20001802006391]
  Graph matching is a commonly used technique in computer vision and pattern recognition. Recent data-driven approaches have improved the graph matching accuracy remarkably. We propose a graph neural network (GNN) based approach to combine the advantages of data-driven and traditional methods.
  arXiv  Detail & Related papers  (2024-03-11T06:34:05Z)
• Deep Manifold Learning with Graph Mining [80.84145791017968]
  We propose a novel graph deep model with a non-gradient decision layer for graph mining. The proposed model has achieved state-of-the-art performance compared to the current models.
  arXiv  Detail & Related papers  (2022-07-18T04:34:08Z)
• LT-OCF: Learnable-Time ODE-based Collaborative Filtering [4.5100819863628825]
  Collaborative filtering (CF) is a long-standing problem of recommender systems. We present Learnable-Time ODE-based Collaborative Filtering (LT-OCF) Our method consistently shows better accuracy than existing methods.
  arXiv  Detail & Related papers  (2021-08-08T12:44:53Z)
• 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)
• Simple and Deep Graph Convolutional Networks [63.76221532439285]
  Graph convolutional networks (GCNs) are a powerful deep learning approach for graph-structured data. Despite their success, most of the current GCN models are shallow, due to the em over-smoothing problem. We propose the GCNII, an extension of the vanilla GCN model with two simple yet effective techniques.
  arXiv  Detail & Related papers  (2020-07-04T16:18:06Z)
• A Robust Hierarchical Graph Convolutional Network Model for Collaborative Filtering [0.0]
  Graph Convolutional Network (GCN) has achieved great success and has been applied in various fields including recommender systems. GCN still suffers from many issues such as training difficulties, over-smoothing, vulnerable to adversarial attacks, etc.
  arXiv  Detail & Related papers  (2020-04-30T12:50:39Z)
• 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.