Name
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. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Social and Information Networks | Graph drawing,Data mining,Anomaly detection,Graph,Embedding,Computer science,Theoretical computer science,Snapshot (computer storage),Scalability |
DocType | Volume | Citations |
Journal | abs/1805.11273 | 12 |
PageRank | References | Authors |
0.50 | 16 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Palash Goyal | 1 | 14 | 2.90 |
| Nitin Kamra | 2 | 25 | 4.17 |
| Xinran He | 3 | 346 | 19.90 |
| Yan Liu | 4 | 2551 | 189.16 |