MultiBiSage: A Web-Scale Recommendation System Using Multiple Bipartite Graphs at Pinterest
Saket Gurukar, Nikil Pancha, Andrew Zhai, Eric Kim, Samson Hu, Srinivasan Parthasarathy, Charles Rosenberg, Jure Leskovec
Abstract
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. Pinterest relies heavily on PinSage which in turn only leverages the Pin-Board graph. However, there exist several entities at Pinterest and heterogeneous interactions among these entities. These diverse entities and interactions provide important signal for recommendations and modeling. In this work, we show that training deep learning models on graphs that captures these diverse interactions can result in learning higher-quality pin embeddings than training PinSage on only the Pin-Board graph. However, building a large-scale heterogeneous graph engine that can process the entire Pinterest size data has not yet been done. In this work, we present a clever and effective solution where we break the heterogeneous graph into multiple disjoint bipartite graphs and then develop novel data-efficient MultiBiSage model that combines the signals from them. MultiBiSage can capture the graph structure of multiple bipartite graphs to learn high-quality pin embeddings. The benefit of our approach is that individual bipartite graphs can be processed with minimal changes to Pinterest's current infrastructure, while being able to combine information from all the graphs while achieving high performance. We train MultiBiSage on six bipartite graphs including our Pin-Board graph and show that it significantly outperforms the deployed latest version of PinSage on multiple user engagement metrics. We also perform experiments on two public datasets to show that MultiBiSage is generalizable and can be applied to datasets outside of Pinterest.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3bf854df-a627-46ab-ae77-e73ef16998b5Cited by top-tier papers2
- RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor SearchMeng Chen, Kai Zhang, Zhenying He, Yinan Jing et al.VLDB 2024 · 27 citations
- Lightweight Embeddings for Graph Collaborative FilteringXurong Liang, Tong Chen, Lizhen Cui, Yang Wang et al.SIGIR 2024 · 13 citations
Builds on3
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Task-Oriented Genetic Activation for Large-Scale Complex Heterogeneous Graph EmbeddingZhuoren Jiang, Zheng Gao, Jinjiong Lan, Hongxia Yang et al.WWW 2020 · 16 citations
Related papers
- Multiplex Heterogeneous Graph Convolutional NetworkPengyang Yu, Chaofan Fu, Yanwei Yu, Chao Huang et al.KDD 2022 · 90 citations
- Neighbor Interaction Aware Graph Convolution Networks for RecommendationJianing Sun, Yingxue Zhang, Wei Guo, Huifeng Guo et al.SIGIR 2020 · 172 citations
- Multiplex Bipartite Network Embedding using Dual Hypergraph Convolutional NetworksHansheng Xue, Luwei Yang, Vaibhav Rajan, Wen Jiang et al.WWW 2021 · 55 citations
- An Efficient Neighborhood-based Interaction Model for Recommendation on Heterogeneous GraphJiarui Jin, Jiarui Qin, Yuchen Fang, Kounianhua Du et al.KDD 2020 · 115 citations
- Billion-Scale Bipartite Graph Embedding: A Global-Local Induced ApproachXueyi Wu, Yuanyuan Xu, Wenjie Zhang, Ying ZhangVLDB 2024 · 21 citations
