Inductive Representation Learning on Large Graphs
William L. Hamilton, Rex Ying, Jure Leskovec · arXiv (Cornell University) · 2017
Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to identifying protein functions. However, most existing approaches require that all nodes in the graph are present during training of the embeddings; these previous approaches are inherently transductive and do not naturally generalize to unseen nodes. Here we present GraphSAGE, a general, inductive framework that leverages node feature information (e.g., text attributes) to efficiently generate node embeddings for previously unseen data. Instead of training individual embeddings for each node, we learn a function that generates embeddings by sampling and aggregating features from a node's local neighborhood. Our algorithm outperforms strong baselines on three inductive node-classification benchmarks: we classify the category of unseen nodes in evolving information graphs based on citation and Reddit post data, and we show that our algorithm generalizes to completely unseen graphs using a multi-graph dataset of protein-protein interactions.
Cited by 4,128 works. doi:10.48550/arxiv.1706.02216 Open-access PDF
Authors
References
- Nonparametric Statistics for the Behavioral Sciences
- Long Short-Term Memory
- Collective dynamics of ‘small-world’ networks
- AutoResearch Lite: a reproducible paper-inspired experiment runner (Adam mechanism reproduction and convergence-speed comparison)
- Scikit-learn: Machine Learning in Python
- Gene set enrichment analysis: A knowledge-based approach for interpreting genome-wide expression profiles
- The PageRank Citation Ranking : Bringing Order to the Web
- TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems
- Identity Mappings in Deep Residual Networks
- On Spectral Clustering: Analysis and an algorithm