Diffusion Based Network Embedding

05/09/2018
by   Yong Shi, et al.
0

In network embedding, random walks play a fundamental role in preserving network structures. However, random walk based embedding methods have two limitations. First, random walk methods are fragile when the sampling frequency or the number of node sequences changes. Second, in disequilibrium networks such as highly biases networks, random walk methods often perform poorly due to the lack of global network information. In order to solve the limitations, we propose in this paper a network diffusion based embedding method. To solve the first limitation, our method employs a diffusion driven process to capture both depth information and breadth information. The time dimension is also attached to node sequences that can strengthen information preserving. To solve the second limitation, our method uses the network inference technique based on cascades to capture the global network information. To verify the performance, we conduct experiments on node classification tasks using the learned representations. Results show that compared with random walk based methods, diffusion based models are more robust when samplings under each node is rare. We also conduct experiments on a highly imbalanced network. Results shows that the proposed model are more robust under the biased network structure.

READ FULL TEXT
research
02/11/2020

Vertex-reinforced Random Walk for Network Embedding

In this paper, we study the fundamental problem of random walk for netwo...
research
10/10/2020

UniNet: Scalable Network Representation Learning with Metropolis-Hastings Sampling

Network representation learning (NRL) technique has been successfully ad...
research
01/22/2022

BiasedWalk: Learning Global-aware Node Embeddings via Biased Sampling

Popular node embedding methods such as DeepWalk follow the paradigm of p...
research
10/01/2020

N odeS ig: Random Walk Diffusion meets Hashing for Scalable Graph Embeddings

Learning node representations is a crucial task with a plethora of inter...
research
11/02/2022

Time-aware Random Walk Diffusion to Improve Dynamic Graph Learning

How can we augment a dynamic graph for improving the performance of dyna...
research
12/21/2020

Unifying Homophily and Heterophily Network Transformation via Motifs

Higher-order proximity (HOP) is fundamental for most network embedding m...
research
10/19/2012

Markov Random Walk Representations with Continuous Distributions

Representations based on random walks can exploit discrete data distribu...

Please sign up or login with your details

Forgot password? Click here to reset