MultiSage: Empowering GCN with contextualized multi-embeddings on web-scale multipartite networks

C Yang, A Pal, A Zhai, N Pancha, J Han… - Proceedings of the 26th …, 2020 - dl.acm.org
Proceedings of the 26th ACM SIGKDD international conference on knowledge …, 2020dl.acm.org
Graph convolutional networks (GCNs) are a powerful class of graph neural networks.
Trained in a semi-supervised end-to-end fashion, GCNs can learn to integrate node features
and graph structures to generate high-quality embeddings that can be used for various
downstream tasks like search and recommendation. However, existing GCNs mostly work
on homogeneous graphs and consider a single embedding for each node, which do not
sufficiently model the multi-facet nature and complex interaction of nodes in real-world …
Graph convolutional networks (GCNs) are a powerful class of graph neural networks. Trained in a semi-supervised end-to-end fashion, GCNs can learn to integrate node features and graph structures to generate high-quality embeddings that can be used for various downstream tasks like search and recommendation. However, existing GCNs mostly work on homogeneous graphs and consider a single embedding for each node, which do not sufficiently model the multi-facet nature and complex interaction of nodes in real-world networks. Here, we present a contextualized GCN engine by modeling the multipartite networks of target nodes and their intermediatecontext nodes that specify the contexts of their interactions. Towards the neighborhood aggregation process, we devise a contextual masking operation at the feature level and a contextual attention mechanism at the node level to achieve interaction contextualization by treating neighboring target nodes based on intermediate context nodes. Consequently, we compute multiple embeddings for target nodes that capture their diverse facets and different interactions during graph convolution, which is useful for fine-grained downstream applications. To enable efficient web-scale training, we build a parallel random walk engine to pre-sample contextualized neighbors, and a Hadoop2-based data provider pipeline to pre-join training data, dynamically reduce multi-GPU training time, and avoid high memory cost. Extensive experiments on the bipartite Pinterest graph and tripartite OAG graph corroborate the advantage of the proposed system.
ACM Digital Library