Can we embed a subset of nodes in a graph?
In this paper:
- We introduce a novel problem of local node embedding.
- We present our novel solution, InstantEmbedding, and provide theoretical guarantees on its locality and global embedding consistency.
- We empirically prove that our method scales to industrial-scale (1.8 billion edges) graphs.