Faster Graph Embeddings via Coarsening

Matthew Fahrbach
Matthew Fahrbach
Gramoz Goranci
Gramoz Goranci
Sushant Sachdeva
Sushant Sachdeva
Chi Wang
Chi Wang
Cited by: 0|Bibtex|Views11|Links

Abstract:

Graph embeddings are a ubiquitous tool for machine learning tasks, such as node classification and link prediction, on graph-structured data. However, computing the embeddings for large-scale graphs is prohibitively inefficient even if we are interested only in a small subset of relevant vertices. To address this, we present an efficien...More

Code:

Data:

Your rating :
0

 

Tags
Comments