Making Fast Graph-based Algorithms with Graph Metric Embeddings

06/17/2019
by   Andrey Kutuzov, et al.
0

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. Instead of directly operating on the graph structure, our method takes structural measures of pairwise node similarities into account and learns dense node representations reflecting user-defined graph distance measures, such as e.g.the shortest path distance or distance measures that take information beyond the graph structure into account. We demonstrate a speed-up of several orders of magnitude when predicting word similarity by vector operations on our embeddings as opposed to directly computing the respective path-based measures, while outperforming various other graph embeddings on semantic similarity and word sense disambiguation tasks and show evaluations on the WordNet graph and two knowledge base graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/16/2018

Learning Graph Embeddings from WordNet-based Similarity Measures

We present a new approach for learning graph embeddings, that relies on ...
research
08/25/2022

Local Intrinsic Dimensionality Measures for Graphs, with Applications to Graph Embeddings

The notion of local intrinsic dimensionality (LID) is an important advan...
research
04/16/2019

Metrics for Graph Comparison: A Practitioner's Guide

Comparison of graph structure is a ubiquitous task in data analysis and ...
research
06/17/2019

Homogeneous Network Embedding for Massive Graphs via Personalized PageRank

Given an input graph G and a node v in G, homogeneous network embedding ...
research
06/02/2022

Graph Kernels Based on Multi-scale Graph Embeddings

Graph kernels are conventional methods for computing graph similarities....
research
02/15/2018

CADDeLaG: Framework for distributed anomaly detection in large dense graph sequences

Random walk based distance measures for graphs such as commute-time dist...
research
01/14/2019

Search Efficient Binary Network Embedding

Traditional network embedding primarily focuses on learning a dense vect...

Please sign up or login with your details

Forgot password? Click here to reset