Het-node2vec: second order random walk sampling for heterogeneous multigraphs embedding

01/05/2021
by   Giorgio Valentini, et al.
0

We introduce a set of algorithms (Het-node2vec) that extend the original node2vec node-neighborhood sampling method to heterogeneous multigraphs, i.e. networks characterized by multiple types of nodes and edges. The resulting random walk samples capture both the structural characteristics of the graph and the semantics of the different types of nodes and edges. The proposed algorithms can focus their attention on specific node or edge types, allowing accurate representations also for underrepresented types of nodes/edges that are of interest for the prediction problem under investigation. These rich and well-focused representations can boost unsupervised and supervised learning on heterogeneous graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2018

edge2vec: Learning Node Representation Using Edge Semantics

Representation learning for networks provides a new way to mine graphs. ...
research
11/26/2019

BHIN2vec: Balancing the Type of Relation in Heterogeneous Information Network

The goal of network embedding is to transform nodes in a network to a lo...
research
10/18/2017

Graph Embedding with Rich Information through Bipartite Heterogeneous Network

Graph embedding has attracted increasing attention due to its critical a...
research
10/12/2021

CoarSAS2hvec: Heterogeneous Information Network Embedding with Balanced Network Sampling

Heterogeneous information network (HIN) embedding aims to find the repre...
research
06/01/2022

Walk for Learning: A Random Walk Approach for Federated Learning from Heterogeneous Data

We consider the problem of a Parameter Server (PS) that wishes to learn ...
research
05/31/2022

FedWalk: Communication Efficient Federated Unsupervised Node Embedding with Differential Privacy

Node embedding aims to map nodes in the complex graph into low-dimension...
research
04/27/2012

The conduciveness of CA-rule graphs

Given two subsets A and B of nodes in a directed graph, the conducivenes...

Please sign up or login with your details

Forgot password? Click here to reset