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
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor SearchMeng Chen, Kai Zhang, Zhenying He, Yinan Jing 等VLDB 2024 · 被引用 27 次
- Lightweight Embeddings for Graph Collaborative FilteringXurong Liang, Tong Chen, Lizhen Cui, Yang Wang 等SIGIR 2024 · 被引用 13 次
它引用的顶会 Paper3
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li 等SIGIR 2020 · 被引用 4,448 次
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong 等NeurIPS 2020 · 被引用 3,935 次
- Task-Oriented Genetic Activation for Large-Scale Complex Heterogeneous Graph EmbeddingZhuoren Jiang, Zheng Gao, Jinjiong Lan, Hongxia Yang 等WWW 2020 · 被引用 16 次
相关 Paper
- Multiplex Heterogeneous Graph Convolutional NetworkPengyang Yu, Chaofan Fu, Yanwei Yu, Chao Huang 等KDD 2022 · 被引用 90 次
- Neighbor Interaction Aware Graph Convolution Networks for RecommendationJianing Sun, Yingxue Zhang, Wei Guo, Huifeng Guo 等SIGIR 2020 · 被引用 172 次
- Multiplex Bipartite Network Embedding using Dual Hypergraph Convolutional NetworksHansheng Xue, Luwei Yang, Vaibhav Rajan, Wen Jiang 等WWW 2021 · 被引用 55 次
- An Efficient Neighborhood-based Interaction Model for Recommendation on Heterogeneous GraphJiarui Jin, Jiarui Qin, Yuchen Fang, Kounianhua Du 等KDD 2020 · 被引用 115 次
- Billion-Scale Bipartite Graph Embedding: A Global-Local Induced ApproachXueyi Wu, Yuanyuan Xu, Wenjie Zhang, Ying ZhangVLDB 2024 · 被引用 21 次
