Graph sampling for node embedding

10/19/2022
by   Li-Chun Zhang, et al.
0

Node embedding is a central topic in graph representation learning. Computational efficiency and scalability can be challenging to any method that requires full-graph operations. We propose sampling approaches to node embedding, with or without explicit modelling of the feature vector, which aim to extract useful information from both the eigenvectors related to the graph Laplacien and the given values associated with the graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2018

Node Centralities and Classification Performance for Characterizing Node Embedding Algorithms

Embedding graph nodes into a vector space can allow the use of machine l...
research
05/27/2021

An Impossibility Theorem for Node Embedding

With the increasing popularity of graph-based methods for dimensionality...
research
09/14/2021

Graph Embedding via Diffusion-Wavelets-Based Node Feature Distribution Characterization

Recent years have seen a rise in the development of representational lea...
research
11/21/2019

Customized Graph Embedding: Tailoring the Embedding Vector to a Specific Application

The graph is a natural representation of data in a variety of real-world...
research
08/04/2021

Hyperparameter-free and Explainable Whole Graph Embedding

Many real-world complex systems can be described as graphs. For a large-...
research
05/28/2018

GESF: A Universal Discriminative Mapping Mechanism for Graph Representation Learning

Graph embedding is a central problem in social network analysis and many...
research
11/28/2022

LoNe Sampler: Graph node embeddings by coordinated local neighborhood sampling

Local graph neighborhood sampling is a fundamental computational problem...

Please sign up or login with your details

Forgot password? Click here to reset