Robust Dynamic Network Embedding via Ensembles
Not on the map. Why?
Abstract (arXiv)
Dynamic Network Embedding (DNE) has recently attracted considerable attention due to the advantage of network embedding in various fields and the dynamic nature of many real-world networks. An input dynamic network to DNE is often assumed to have smooth changes over snapshots, which however would not hold for all real-world scenarios. It is natural to ask if existing DNE methods can perform well for an input dynamic network without smooth changes. To quantify it, an index called Degree of Changes (DoCs) is suggested so that the smaller DoCs indicates the smoother changes. Our comparative study shows several DNE methods are not robust enough to different DoCs even if the corresponding input dynamic networks come from the same dataset, which would make these methods unreliable and hard to use for unknown real-world applications. To propose an effective and more robust DNE method, we follow the notion of ensembles where each base learner adopts an incremental Skip-Gram embedding model. To further boost the performance, a simple yet effective strategy is designed to enhance the diversity among base learners at each timestep by capturing different levels of local-global topology. Extensive experiments demonstrate the superior effectiveness and robustness of the proposed method compared to state-of-the-art DNE methods, as well as the benefits of special designs in the proposed method and its scalability.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 27 of its 52 references that are in the map. First posted on arXiv 30 May 2021.
Builds on
27 of 52 references.
References · 27
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
- 2014DeepWalk: Online Learning of Social Representationscited by 1,547
- 2020Inductive Representation Learning on Temporal Graphscited by 462
- 2017Representation Learning on Graphs: Methods and Applicationscited by 457
- 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 447
- 2019Representation Learning for Dynamic Graphs: A Surveycited by 265
- 2017Graph Embedding Techniques, Applications, and Performance: A Surveycited by 188
- 2017A Survey on Network Embeddingcited by 142
15 more
- 2014word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding methodcited by 112
- 2018DynGEM: Deep Embedding Method for Dynamic Graphscited by 102
- 2017Network Representation Learning: A Surveycited by 101
- 2018dyngraph2vec: Capturing Network Dynamics using Dynamic Graph Representation Learningcited by 88
- 2019Node Embedding over Temporal Graphscited by 45
- 2017Attributed Network Embedding for Learning in a Dynamic Environmentcited by 39
- 2018dynnode2vec: Scalable Dynamic Network Embeddingcited by 32
- 2015Modern temporal network theory: A colloquiumcited by 23
- 2014Scalable Link Prediction in Dynamic Networks via Non-Negative Matrix Factorizationcited by 21
- 2017TIMERS: Error-Bounded SVD Restart on Dynamic Networkscited by 19
- 2017Concept Drift Adaptation by Exploiting Historical Knowledgecited by 17
- 2017Stream Graphs and Link Streams for the Modeling of Interactions over Timecited by 14
- 2019Efficient Representation Learning Using Random Walks for Dynamic Graphscited by 9
- 2020GloDyNE: Global Topology Preserving Dynamic Network Embeddingcited by 8
- 2019Dynamic Network Embedding via Incremental Skip-gram with Negative Samplingcited by 4
Built on by
Citing papers per year: 2022: 1.
1 paper.