pith. sign in

DynGEM: Deep Embedding Method for Dynamic Graphs

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

Embedding large graphs in low dimensional spaces has recently attracted significant interest due to its wide applications such as graph visualization, link prediction and node classification. Existing methods focus on computing the embedding for static graphs. However, many graphs in practical applications are dynamic and evolve constantly over time. Naively applying existing embedding algorithms to each snapshot of dynamic graphs independently usually leads to unsatisfactory performance in terms of stability, flexibility and efficiency. In this work, we present an efficient algorithm DynGEM based on recent advances in deep autoencoders for graph embeddings, to address this problem. The major advantages of DynGEM include: (1) the embedding is stable over time, (2) it can handle growing dynamic graphs, and (3) it has better running time than using static embedding methods on each snapshot of a dynamic graph. We test DynGEM on a variety of tasks including graph visualization, graph reconstruction, link prediction and anomaly detection (on both synthetic and real datasets). Experimental results demonstrate the superior stability and scalability of our approach.

fields

cs.LG 1 cs.SI 1

years

2020 1 2019 1

verdicts

UNVERDICTED 2

representative citing papers

Temporal Graph Networks for Deep Learning on Dynamic Graphs

cs.LG · 2020-06-18 · unverdicted · novelty 7.0

Temporal Graph Networks combine memory modules and graph operators to learn on dynamic graphs as timed event sequences, outperforming prior methods on transductive and inductive tasks while unifying earlier models as special cases.

Tracking Temporal Evolution of Graphs using Non-Timestamped Data

cs.SI · 2019-07-04 · unverdicted · novelty 6.0

Presents YoutubeGraph-Dyn, a multi-modal dynamic graph dataset from YouTube interactions with intra-day snapshots, and benchmarks clustering for community migration plus time series and RNN methods for forecasting non-timestamped attributes.

citing papers explorer

Showing 2 of 2 citing papers.

  • Temporal Graph Networks for Deep Learning on Dynamic Graphs cs.LG · 2020-06-18 · unverdicted · none · ref 106 · internal anchor

    Temporal Graph Networks combine memory modules and graph operators to learn on dynamic graphs as timed event sequences, outperforming prior methods on transductive and inductive tasks while unifying earlier models as special cases.

  • Tracking Temporal Evolution of Graphs using Non-Timestamped Data cs.SI · 2019-07-04 · unverdicted · none · ref 8 · internal anchor

    Presents YoutubeGraph-Dyn, a multi-modal dynamic graph dataset from YouTube interactions with intra-day snapshots, and benchmarks clustering for community migration plus time series and RNN methods for forecasting non-timestamped attributes.