Linear-Time Graph Neural Networks for Scalable Recommendations
- URL: http://arxiv.org/abs/2402.13973v1
- Date: Wed, 21 Feb 2024 17:58:10 GMT
- Title: Linear-Time Graph Neural Networks for Scalable Recommendations
- Authors: Jiahao Zhang, Rui Xue, Wenqi Fan, Xin Xu, Qing Li, Jian Pei, Xiaorui
Liu
- Abstract summary: The key of recommender systems is to forecast users' future behaviors based on previous user-item interactions.
Recent years have witnessed a rising interest in leveraging Graph Neural Networks (GNNs) to boost the prediction performance of recommender systems.
We propose a Linear-Time Graph Neural Network (LTGNN) to scale up GNN-based recommender systems to achieve comparable scalability as classic MF approaches.
- Score: 50.45612795600707
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In an era of information explosion, recommender systems are vital tools to
deliver personalized recommendations for users. The key of recommender systems
is to forecast users' future behaviors based on previous user-item
interactions. Due to their strong expressive power of capturing high-order
connectivities in user-item interaction data, recent years have witnessed a
rising interest in leveraging Graph Neural Networks (GNNs) to boost the
prediction performance of recommender systems. Nonetheless, classic Matrix
Factorization (MF) and Deep Neural Network (DNN) approaches still play an
important role in real-world large-scale recommender systems due to their
scalability advantages. Despite the existence of GNN-acceleration solutions, it
remains an open question whether GNN-based recommender systems can scale as
efficiently as classic MF and DNN methods. In this paper, we propose a
Linear-Time Graph Neural Network (LTGNN) to scale up GNN-based recommender
systems to achieve comparable scalability as classic MF approaches while
maintaining GNNs' powerful expressiveness for superior prediction accuracy.
Extensive experiments and ablation studies are presented to validate the
effectiveness and scalability of the proposed algorithm. Our implementation
based on PyTorch is available.
Related papers
- Information Flow in Graph Neural Networks: A Clinical Triage Use Case [49.86931948849343]
Graph Neural Networks (GNNs) have gained popularity in healthcare and other domains due to their ability to process multi-modal and multi-relational graphs.
We investigate how the flow of embedding information within GNNs affects the prediction of links in Knowledge Graphs (KGs)
Our results demonstrate that incorporating domain knowledge into the GNN connectivity leads to better performance than using the same connectivity as the KG or allowing unconstrained embedding propagation.
arXiv Detail & Related papers (2023-09-12T09:18:12Z) - Vertical Federated Graph Neural Network for Recommender System [1.7802147489386633]
Graph neural network (GNN) is becoming a promising approach for federated recommender systems.
Our study proposes the first vertical federated GNN-based recommender system, called VerFedGNN.
arXiv Detail & Related papers (2023-03-10T08:39:26Z) - Dual Policy Learning for Aggregation Optimization in Graph Neural
Network-based Recommender Systems [4.026354668375411]
We propose a novel reinforcement learning-based message passing framework for recommender systems.
This framework adaptively determines high-order connectivity to aggregate users and items using dual policy learning.
Our results show that our proposed framework significantly enhances the recent base model, improving nDCG and Recall by up to 63.7% and 42.9%, respectively.
arXiv Detail & Related papers (2023-02-21T09:47:27Z) - 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) - EIGNN: Efficient Infinite-Depth Graph Neural Networks [51.97361378423152]
Graph neural networks (GNNs) are widely used for modelling graph-structured data in numerous applications.
Motivated by this limitation, we propose a GNN model with infinite depth, which we call Efficient Infinite-Depth Graph Neural Networks (EIGNN)
We show that EIGNN has a better ability to capture long-range dependencies than recent baselines, and consistently achieves state-of-the-art performance.
arXiv Detail & Related papers (2022-02-22T08:16:58Z) - 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) - 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) - A Meta-Learning Approach to the Optimal Power Flow Problem Under
Topology Reconfigurations [69.73803123972297]
We propose a DNN-based OPF predictor that is trained using a meta-learning (MTL) approach.
The developed OPF-predictor is validated through simulations using benchmark IEEE bus systems.
arXiv Detail & Related papers (2020-12-21T17:39:51Z) - Graph Neural Networks in Recommender Systems: A Survey [21.438347815928918]
In recommender systems, the main challenge is to learn the effective user/item representations from their interactions and side information.
Recently, graph neural network (GNN) techniques have been widely utilized in recommender systems.
This article aims to provide a comprehensive review of recent research efforts on GNN-based recommender systems.
arXiv Detail & Related papers (2020-11-04T12:57:47Z) - UBER-GNN: A User-Based Embeddings Recommendation based on Graph Neural
Networks [27.485553372163732]
We propose User-Based Embeddings Recommendation with Graph Neural Network, UBER-GNN for brevity.
UBER-GNN takes advantage of structured data to generate longterm user preferences, and transfers session sequences into graphs to generate graph-based dynamic interests.
Experiments conducted on real Ping An scenario show that UBER-GNN outperforms the state-of-the-art session-based recommendation methods.
arXiv Detail & Related papers (2020-08-06T09:54:03Z)
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.