Space-Invariant Projection in Streaming Network Embedding

03/11/2023
by   Yanwen Zhang, et al.
0

Newly arriving nodes in dynamics networks would gradually make the node embedding space drifted and the retraining of node embedding and downstream models indispensable. An exact threshold size of these new nodes, below which the node embedding space will be predicatively maintained, however, is rarely considered in either theory or experiment. From the view of matrix perturbation theory, a threshold of the maximum number of new nodes that keep the node embedding space approximately equivalent is analytically provided and empirically validated. It is therefore theoretically guaranteed that as the size of newly arriving nodes is below this threshold, embeddings of these new nodes can be quickly derived from embeddings of original nodes. A generation framework, Space-Invariant Projection (SIP), is accordingly proposed to enables arbitrary static MF-based embedding schemes to embed new nodes in dynamics networks fast. The time complexity of SIP is linear with the network size. By combining SIP with four state-of-the-art MF-based schemes, we show that SIP exhibits not only wide adaptability but also strong empirical performance in terms of efficiency and efficacy on the node classification task in three real datasets.

READ FULL TEXT

page 6

page 13

research
10/23/2019

Network2Vec Learning Node Representation Based on Space Mapping in Networks

Complex networks represented as node adjacency matrices constrains the a...
research
11/19/2018

Role action embeddings: scalable representation of network positions

We consider the question of embedding nodes with similar local neighborh...
research
05/07/2018

Billion-scale Network Embedding with Iterative Random Projection

Network embedding has attracted considerable research attention recently...
research
06/22/2020

A Self-Attention Network based Node Embedding Model

Despite several signs of progress have been made recently, limited resea...
research
12/21/2020

Unifying Homophily and Heterophily Network Transformation via Motifs

Higher-order proximity (HOP) is fundamental for most network embedding m...
research
01/21/2020

Fast Sequence-Based Embedding with Diffusion Graphs

A graph embedding is a representation of graph vertices in a low-dimensi...
research
03/14/2022

Permutation Invariant Representations with Applications to Graph Deep Learning

This paper presents primarily two Euclidean embeddings of the quotient s...

Please sign up or login with your details

Forgot password? Click here to reset