Making Fast Graph-based Algorithms with Graph Metric Embeddings

ACL 2019 Andrey KutuzovMohammad DorghamOleksiy OliynykChris BiemannAlexander Panchenko

The computation of distance measures between nodes in graphs is inefficient and does not scale to large graphs. We explore dense vector representations as an effective way to approximate the same information: we introduce a simple yet efficient and effective approach for learning graph embeddings... (read more)

PDF Abstract

Evaluation Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help community compare results to other papers.