Presents a distributed infrastructure for scaling skip-gram graph embeddings to 68M-vertex networks by avoiding partitioning, using dynamic size-constrained graphs, and efficient indexing for updates.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Graph Embeddings at Scale
Presents a distributed infrastructure for scaling skip-gram graph embeddings to 68M-vertex networks by avoiding partitioning, using dynamic size-constrained graphs, and efficient indexing for updates.