LoNe Sampler: Graph node embeddings by coordinated local neighborhood sampling

by   Konstantin Kutzkov, et al.

Local graph neighborhood sampling is a fundamental computational problem that is at the heart of algorithms for node representation learning. Several works have presented algorithms for learning discrete node embeddings where graph nodes are represented by discrete features such as attributes of neighborhood nodes. Discrete embeddings offer several advantages compared to continuous word2vec-like node embeddings: ease of computation, scalability, and interpretability. We present LoNe Sampler, a suite of algorithms for generating discrete node embeddings by Local Neighborhood Sampling, and address two shortcomings of previous work. First, our algorithms have rigorously understood theoretical properties. Second, we show how to generate approximate explicit vector maps that avoid the expensive computation of a Gram matrix for the training of a kernel model. Experiments on benchmark datasets confirm the theoretical findings and demonstrate the advantages of the proposed methods.


page 1

page 2

page 3

page 4


COLOGNE: Coordinated Local Graph Neighborhood Sampling

Representation learning for graphs enables the application of standard m...

Learning node embeddings via summary graphs: a brief theoretical analysis

Graph representation learning plays an important role in many graph mini...

Inductive Representation Learning on Large Graphs

Low-dimensional embeddings of nodes in large graphs have proved extremel...

Graph sampling for node embedding

Node embedding is a central topic in graph representation learning. Comp...

Node Embedding using Mutual Information and Self-Supervision based Bi-level Aggregation

Graph Neural Networks (GNNs) learn low dimensional representations of no...

Kernel interpolation with continuous volume sampling

A fundamental task in kernel methods is to pick nodes and weights, so as...

On the Equivalence between Node Embeddings and Structural Graph Representations

This work provides the first unifying theoretical framework for node emb...

Please sign up or login with your details

Forgot password? Click here to reset