Accelerating Dynamic Network Embedding with Billions of Parameter Updates to Milliseconds

by   Haoran Deng, et al.

Network embedding, a graph representation learning method illustrating network topology by mapping nodes into lower-dimension vectors, is challenging to accommodate the ever-changing dynamic graphs in practice. Existing research is mainly based on node-by-node embedding modifications, which falls into the dilemma of efficient calculation and accuracy. Observing that the embedding dimensions are usually much smaller than the number of nodes, we break this dilemma with a novel dynamic network embedding paradigm that rotates and scales the axes of embedding space instead of a node-by-node update. Specifically, we propose the Dynamic Adjacency Matrix Factorization (DAMF) algorithm, which achieves an efficient and accurate dynamic network embedding by rotating and scaling the coordinate system where the network embedding resides with no more than the number of edge modifications changes of node embeddings. Moreover, a dynamic Personalized PageRank is applied to the obtained network embeddings to enhance node embeddings and capture higher-order neighbor information dynamically. Experiments of node classification, link prediction, and graph reconstruction on different-sized dynamic graphs suggest that DAMF advances dynamic network embedding. Further, we unprecedentedly expand dynamic network embedding experiments to billion-edge graphs, where DAMF updates billion-level parameters in less than 10ms.


page 1

page 2

page 3

page 4


Network2Vec Learning Node Representation Based on Space Mapping in Networks

Complex networks represented as node adjacency matrices constrains the a...

Beyond Node Embedding: A Direct Unsupervised Edge Representation Framework for Homogeneous Networks

Network representation learning has traditionally been used to find lowe...

Bridging the Gap between Community and Node Representations: Graph Embedding via Community Detection

Graph embedding has become a key component of many data mining and analy...

On the Theory of Dynamic Graph Regression Problem

Most of real-world graphs are dynamic, i.e., they change over time. How...

Homogeneous Network Embedding for Massive Graphs via Personalized PageRank

Given an input graph G and a node v in G, homogeneous network embedding ...

Learning Positional Embeddings for Coordinate-MLPs

We propose a novel method to enhance the performance of coordinate-MLPs ...

Evaluating Node Embeddings of Complex Networks

Graph embedding is a transformation of nodes of a graph into a set of ve...

Please sign up or login with your details

Forgot password? Click here to reset