Heterogeneous Information Network Embedding for Meta Path based Proximity

01/19/2017
by   Zhipeng Huang, et al.
0

A network embedding is a representation of a large graph in a low-dimensional space, where vertices are modeled as vectors. The objective of a good embedding is to preserve the proximity between vertices in the original graph. This way, typical search and mining methods can be applied in the embedded space with the help of off-the-shelf multidimensional indexing approaches. Existing network embedding techniques focus on homogeneous networks, where all vertices are considered to belong to a single class.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2016

From Node Embedding To Community Embedding

Most of the existing graph embedding methods focus on nodes, which aim t...
research
07/05/2019

Network Embedding: on Compression and Learning

Recently, network embedding that encodes structural information of graph...
research
12/19/2019

An Attention-based Graph Neural Network for Heterogeneous Structural Learning

In this paper, we focus on graph representation learning of heterogeneou...
research
05/24/2018

Diffusion Maps for Textual Network Embedding

Textual network embedding leverages rich text information associated wit...
research
03/27/2020

The impossibility of low rank representations for triangle-rich complex networks

The study of complex networks is a significant development in modern sci...
research
11/30/2017

LATTE: Application Oriented Network Embedding

In recent years, many research works propose to embed the networked data...
research
11/13/2020

Matching through Embedding in Dense Graphs

Finding optimal matchings in dense graphs is of general interest and of ...

Please sign up or login with your details

Forgot password? Click here to reset