The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
dyngraph2vec: Capturing network dynamics using dynamic graph representation learning
Open accessAbstract
Abstract Learning graph representations is a fundamental task aimed at capturing various properties of graphs in vector space. The most recent methods learn such representations for static networks. However, real-world networks evolve over time and have varying dynamics. Capturing such evolution is key to predicting the properties of unseen networks. To understand how the network dynamics affect the prediction performance, we propose an embedding approach which learns the structure of evolution in dynamic graphs and can predict unseen links with higher precision. Our model, dyngraph2vec , learns the temporal transitions in the network using a deep architecture composed of dense and recurrent layers. We motivate the need for capturing dynamics for the prediction on a toy data set created using stochastic block models. We then demonstrate the efficacy of dyngraph2vec over existing state-of-the-art methods on two real-world data sets. We observe that learning dynamics can improve the quality of embedding and yield better performance in link prediction.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Semi-supervised classification with graph convolutional networks
Kipf, T. N., & Welling, M. (2016) · arXiv · doi:10.48550/arxiv.1609.02907 · Cited by 24,853
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,983
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Belkin, M., & Niyogi, P. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0080 · Cited by 4,412
Spectral Networks and Locally Connected Networks on Graphs
Bruna, J., Zaremba, W., Szlam, A., & LeCun, Y. (2013) · arXiv · doi:10.48550/arxiv.1312.6203 · Cited by 3,983
Structural Deep Network Embedding
Wang, D., Cui, P., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939753 · Cited by 2,845
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Graph embedding techniques, applications, and performance: A survey
Goyal, P., & Ferrara, E. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.03.022 · Cited by 1,801
Self-citationGraRep: Learning Graph Representations with Global Structural Information
Cao, S., Lu, W., & Xu, Q. (2015) · Proceedings of the 24th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2806416.2806512 · Cited by 1,571
Deep Convolutional Networks on Graph-Structured Data
Henaff, M., Bruna, J., & LeCun, Y. (2015) · arXiv · doi:10.48550/arxiv.1506.05163 · Cited by 1,255
Asymmetric Transitivity Preserving Graph Embedding
Ou, M., Cui, P., Pei, J., Zhang, Z., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939751 · Cited by 1,248
DeepWalk: Online Learning of Social Representations
Perozzi, B., Al‐Rfou, R., & Skiena, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1403.6652 · Cited by 1,107
Proceedings of the 24th International Conference on World Wide Web
(2015) · doi:10.1145/2740908 · Cited by 1,052
Deep Neural Networks for Learning Graph Representations
Cao, S., Lu, W., & Xu, Q. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10179 · Cited by 1,014
Neurocomputing: Foundations of Research
Anderson, J. A., & Rosenfeld, E. (1988) · Cited by 851
Variational Graph Auto-Encoders
Kipf, T., & Welling, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.07308 · Cited by 772
Proceedings of the 22nd international conference on World Wide Web
(2013) · doi:10.1145/2488388 · Cited by 685
Freeman, L. C. (2000) · Journal of Social Structure · Cited by 655
Distributed large-scale natural graph factorization
Ahmed, A., Shervashidze, N., Narayanamurthy, S., Josifovski, V., & Smola, A. J. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488393 · Cited by 648
LINE: Large-Scale Information Network Embedding
Tang, J. G. (2024) · doi:10.57702/6e6l3h4g · Cited by 627
Fast low-rank modifications of the thin singular value decomposition
Brand, M. (2006) · Linear Algebra and its Applications · doi:10.1016/j.laa.2005.07.021 · Cited by 491
Stochastic blockmodels for directed graphs.
Wang, Y. J., & Wong, G. Y. (1987) · Journal of the American Statistical Association · doi:10.1080/01621459.1987.10478385 · Cited by 480
Network visualization and analysis of gene expression data using BioLayout Express3D
Theocharidis, A., van Dongen, S., Enright, A. J., & Freeman, T. C. (2009) · Nature Protocols · doi:10.1038/nprot.2009.177 · Cited by 454
Neurocomputing: Foundations of Research
Mingolla, E., & Bullock, D. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90025-7 · Cited by 334
Gehrke, J., Ginsparg, P., & Kleinberg, J. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/980972.980992 · Cited by 281
DynGEM: Deep Embedding Method for Dynamic Graphs
Goyal, P., Kamra, N., He, X., & Liu, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.11273 · Cited by 272
Self-citationScalable Temporal Latent Space Inference for Link Prediction in Dynamic Social Networks
Zhu, L., Guo, D., Yin, J., Steeg, G. V., & Galstyan, A. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2591009 · Cited by 245
A survey of visualization tools for biological network analysis
Pavlopoulos, G. A., Wegener, A.-L., & Schneider, R. (2008) · BioData Mining · doi:10.1186/1756-0381-1-12 · Cited by 218
Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks
Ma, X., Sun, P., & Wang, Y. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.12.092 · Cited by 123
TIMERS: Error-Bounded SVD Restart on Dynamic Networks
Zhang, Z., Cui, P., Pei, J., Wang, X., & Zhu, W. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11299 · Cited by 100
DyLink2Vec: Effective Feature Representation for Link Prediction in Dynamic NetworksPreprint
Rahman, M., Saha, T. K., Hasan, M. A., Xu, K. S., & Reddy, C. K. A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.05755 · Cited by 36
Proceedings of the 29th on Hypertext and Social Media
(2018) · doi:10.1145/3209542 · Cited by 24
Embedding Networks with Edge Attributes
Goyal, P., Hosseinmardi, H., Ferrara, E., & Galstyan, A. (2018) · ACM Conference on Hypertext and Social Media (HT) · doi:10.1145/3209542.3209571 · Cited by 16
Self-citationLearning Continuous-Time Bayesian Networks in Relational Domains: A Non-Parametric Approach
Yang, S., Khot, T., Kristian Kersting, B., & Natarajan, S. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10220 · Cited by 15
Cited by
EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs
Pareja, A., Domeniconi, G., Chen, J., Ma, T., Suzumura, T., Kanezashi, H., Kaler, T., Schardl, T., & Leiserson, C. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5984 · Cited by 1,221
DySAT: Deep Neural Representation Learning on Dynamic Graphs via Self-Attention Networks
Sankar, A., Wu, Y., Gou, L., Zhang, W., & Yang, H. (2020) · Proceedings of the 13th International Conference on Web Search and Data Mining · doi:10.1145/3336191.3371845 · Cited by 638
Recurrent Event Network: Autoregressive Structure Inferenceover Temporal Knowledge Graphs
Jin, W., Qu, M., Jin, X., & Ren, X. (2020) · Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.541 · Cited by 409
Representation learning for dynamic graphs: A survey
Kazemi, S. M., Goel, R., Jain, K., Kobyzev, I., Sethi, A., Forsyth, P., & Poupart, P. (2019) · arXiv · doi:10.48550/arxiv.1905.11485 · Cited by 338
Foundations and Modeling of Dynamic Networks Using Dynamic Graph Neural Networks: A Survey
Skarding, J., Gabrys, B., & Musial, K. (2021) · IEEE Access · doi:10.1109/access.2021.3082932 · Cited by 331
Metadata
- Authors
- Goyal, P., Chhetri, S. R., & Canedo, A.
- Venue
- Knowledge-Based Systems
- Publisher
- Elsevier BV
- Published
- 2020-01
- Volume
- 187
- Pages
- 104816
- ISSN
- 0950-7051 (ISSN-L)
- OpenAlex
- W2954691982
- Cited by
- 465
- References
- 38
- FWCI
- 26.36
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.