MultiBiSage: A Web-Scale Recommendation System Using Multiple Bipartite
Graphs at Pinterest
- URL: http://arxiv.org/abs/2205.10666v1
- Date: Sat, 21 May 2022 20:04:46 GMT
- Title: MultiBiSage: A Web-Scale Recommendation System Using Multiple Bipartite
Graphs at Pinterest
- Authors: Saket Gurukar, Nikil Pancha, Andrew Zhai, Eric Kim, Samson Hu,
Srinivasan Parthasarathy, Charles Rosenberg, Jure Leskovec
- Abstract summary: Graph Convolutional Networks (GCN) can efficiently integrate graph structure and node features to learn high-quality node embeddings.
At Pinterest, we have developed and deployed PinSage, a data-efficient GCN that learns pin embeddings from the Pin-Board graph.
We show that training deep learning models on graphs that captures diverse interactions would result in learning higher-quality pin embeddings.
- Score: 53.3951260443916
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Graph Convolutional Networks (GCN) can efficiently integrate graph structure
and node features to learn high-quality node embeddings. These embeddings can
then be used for several tasks such as recommendation and search. At Pinterest,
we have developed and deployed PinSage, a data-efficient GCN that learns pin
embeddings from the Pin-Board graph. The Pin-Board graph contains pin and board
entities and the graph captures the pin belongs to a board interaction.
However, there exist several entities at Pinterest such as users, idea pins,
creators, and there exist heterogeneous interactions among these entities such
as add-to-cart, follow, long-click.
In this work, we show that training deep learning models on graphs that
captures these diverse interactions would result in learning higher-quality pin
embeddings than training PinSage on only the Pin-Board graph. To that end, we
model the diverse entities and their diverse interactions through multiple
bipartite graphs and propose a novel data-efficient MultiBiSage model.
MultiBiSage can capture the graph structure of multiple bipartite graphs to
learn high-quality pin embeddings. We take this pragmatic approach as it allows
us to utilize the existing infrastructure developed at Pinterest -- such as
Pixie system that can perform optimized random-walks on billion node graphs,
along with existing training and deployment workflows. We train MultiBiSage on
six bipartite graphs including our Pin-Board graph. Our offline metrics show
that MultiBiSage significantly outperforms the deployed latest version of
PinSage on multiple user engagement metrics.
Related papers
- Connector 0.5: A unified framework for graph representation learning [5.398580049917152]
We introduce a novel graph representation framework covering various graph embedding models, ranging from shallow to state-of-the-art models.
We plan to build an efficient open-source framework that can provide deep graph embedding models to represent structural relations in graphs.
arXiv Detail & Related papers (2023-04-25T23:28:38Z) - You Only Transfer What You Share: Intersection-Induced Graph Transfer
Learning for Link Prediction [79.15394378571132]
We investigate a previously overlooked phenomenon: in many cases, a densely connected, complementary graph can be found for the original graph.
The denser graph may share nodes with the original graph, which offers a natural bridge for transferring selective, meaningful knowledge.
We identify this setting as Graph Intersection-induced Transfer Learning (GITL), which is motivated by practical applications in e-commerce or academic co-authorship predictions.
arXiv Detail & Related papers (2023-02-27T22:56:06Z) - PersonaSAGE: A Multi-Persona Graph Neural Network [27.680820534771485]
We develop a persona-based graph neural network framework called PersonaSAGE that learns multiple persona-based embeddings for each node in the graph.
PersonaSAGE learns the appropriate set of persona embeddings for each node in the graph, and every node can have a different number of assigned persona embeddings.
Experiments demonstrate the effectiveness of PersonaSAGE for a variety of important tasks including link prediction.
arXiv Detail & Related papers (2022-12-28T05:50:38Z) - Learnable Graph Convolutional Network and Feature Fusion for Multi-view
Learning [30.74535386745822]
This paper proposes a joint deep learning framework called Learnable Graph Convolutional Network and Feature Fusion (LGCN-FF)
It consists of two stages: feature fusion network and learnable graph convolutional network.
The proposed LGCN-FF is validated to be superior to various state-of-the-art methods in multi-view semi-supervised classification.
arXiv Detail & Related papers (2022-11-16T19:07:12Z) - Improving Graph Neural Networks at Scale: Combining Approximate PageRank
and CoreRank [20.948992161528466]
We propose a scalable solution to propagate information on Graph Neural Networks (GNNs)
The CorePPR model uses a learnable convex combination of the approximate personalised PageRank and the CoreRank to diffuse multi-hop neighbourhood information in GNNs.
We demonstrate that CorePPR outperforms PPRGo on large graphs where selecting the most influential nodes is particularly relevant for scalability.
arXiv Detail & Related papers (2022-11-08T13:51:49Z) - CGMN: A Contrastive Graph Matching Network for Self-Supervised Graph
Similarity Learning [65.1042892570989]
We propose a contrastive graph matching network (CGMN) for self-supervised graph similarity learning.
We employ two strategies, namely cross-view interaction and cross-graph interaction, for effective node representation learning.
We transform node representations into graph-level representations via pooling operations for graph similarity computation.
arXiv Detail & Related papers (2022-05-30T13:20:26Z) - Cross-Network Learning with Partially Aligned Graph Convolutional
Networks [21.458260469446863]
I propose partially aligned graph convolutional networks to learn node representations across the models.
Experiments on real-world knowledge graphs and collaboration networks show the superior performance of our proposed methods.
arXiv Detail & Related papers (2021-06-03T04:07:26Z) - Graph-Based Neural Network Models with Multiple Self-Supervised
Auxiliary Tasks [79.28094304325116]
Graph Convolutional Networks are among the most promising approaches for capturing relationships among structured data points.
We propose three novel self-supervised auxiliary tasks to train graph-based neural network models in a multi-task fashion.
arXiv Detail & Related papers (2020-11-14T11:09:51Z) - Multilevel Graph Matching Networks for Deep Graph Similarity Learning [79.3213351477689]
We propose a multi-level graph matching network (MGMN) framework for computing the graph similarity between any pair of graph-structured objects.
To compensate for the lack of standard benchmark datasets, we have created and collected a set of datasets for both the graph-graph classification and graph-graph regression tasks.
Comprehensive experiments demonstrate that MGMN consistently outperforms state-of-the-art baseline models on both the graph-graph classification and graph-graph regression tasks.
arXiv Detail & Related papers (2020-07-08T19:48:19Z) - GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training [62.73470368851127]
Graph representation learning has emerged as a powerful technique for addressing real-world problems.
We design Graph Contrastive Coding -- a self-supervised graph neural network pre-training framework.
We conduct experiments on three graph learning tasks and ten graph datasets.
arXiv Detail & Related papers (2020-06-17T16:18:35Z)
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.