2 papers
cs.CL2019
Making Fast Graph-based Algorithms with Graph Metric Embeddings
Andrey Kutuzov, Mohammad Dorgham, Oleksiy Oliynyk +2
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 appro…
cs.CL2018
Learning Graph Embeddings from WordNet-based Similarity Measures
Andrey Kutuzov, Mohammad Dorgham, Oleksiy Oliynyk +2
We present path2vec, a new approach for learning graph embeddings that relies on structural measures of pairwise node similarities. The model learns representations for nodes in a…