The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Dynamic Network Embedding by Modeling Triadic Closure Process
Open accessAbstract
Network embedding, which aims to learn the low-dimensional representations of vertices, is an important task and has attracted considerable research efforts recently. In real world, networks, like social network and biological networks, are dynamic and evolving over time. However, almost all the existing network embedding methods focus on static networks while ignore network dynamics. In this paper, we present a novel representation learning approach, DynamicTriad, to preserve both structural information and evolution patterns of a given network. The general idea of our approach is to impose triad, which is a group of three vertices and is one of the basic units of networks. In particular, we model how a closed triad, which consists of three vertices connected with each other, develops from an open triad that has two of three vertices not connected with each other. This triadic closure process is a fundamental mechanism in the formation and evolution of networks, thereby makes our model being able to capture the network dynamics and to learn representation vectors for each vertex at different time steps. Experimental results on three real-world networks demonstrate that, compared with several state-of-the-art techniques, DynamicTriad achieves substantial gains in several application scenarios. For example, our approach can effectively be applied and help to identify telephone frauds in a mobile network, and to predict whether a user will repay her loans or not in a loan network.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
(2008) · Journal of Machine Learning Research · Cited by 33,051
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533 · cited 1×
“Some recent researches on graph embedding are inspired by the advancements in natural language processing, in particular the adoption of skip-gram models in representation learning of words (Mikolov et al. 2013).”
Background(1990) · Choice Reviews Online · doi:10.5860/choice.27-6637 · Cited by 16,594
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
Jolliffe, I. (2005) · Encyclopedia of Statistics in Behavioral Science · doi:10.1002/0470013192.bsa501 · Cited by 14,310
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
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
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
Jolliffe, I. T. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,273
(2010) · Cited by 8,261
Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis
Kruskal, J. B. (1964) · Psychometrika · doi:10.1007/bf02289565 · Cited by 7,317
LINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416
Maximum Likelihood from Incomplete Data via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1976) · Cited by 4,517
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
Knowledge Graph Embedding by Translating on Hyperplanes
Wang, Z., Zhang, J., Feng, J., & Chen, Z. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8870 · Cited by 3,915
Coleman, J. S. (1990) · Cited by 3,444
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
ArnetMiner: extraction and mining of academic social networks
Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., & Su, Z. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1402008 · Cited by 2,231
metapath2vec: Scalable Representation Learning for Heterogeneous Networks
Dong, Y., Chawla, N. V., & Swami, A. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098036 · Cited by 2,210
Latent Space Approaches to Social Network Analysis
Hoff, P. D., Raftery, A. E., & Handcock, M. S. (2002) · Journal of the American Statistical Association · doi:10.1198/016214502388618906 · Cited by 1,917
Empirical Analysis of an Evolving Social Network
Kossinets, G., & Watts, D. J. (2006) · Science · doi:10.1126/science.1116869 · Cited by 1,723
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
Gibbs, J. P., & Coleman, J. S. (1990) · Social Forces · doi:10.2307/2579680 · Cited by 950
LINE: Large-Scale Information Network Embedding
Tang, J. G. (2024) · doi:10.57702/6e6l3h4g · Cited by 627
GraphScope: parameter-free mining of large time-evolving graphs
Sun, J., Faloutsos, C., Papadimitriou, S., & Yu, P. S. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281266 · Cited by 532
A framework for community identification in dynamic social networks
Tantipathananandh, C., Berger-Wolf, T., & Kempe, D. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281269 · Cited by 443
Dynamic social network analysis using latent space models
Sarkar, P., & Moore, A. W. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117459 · Cited by 422
Scalable 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
Latent Space Approaches to Social Network Analysis
Hoff, P. D., Raftery, A. E., & Handcock, M. S. (2001) · Defense Technical Information Center (DTIC) · doi:10.21236/ada458734 · Cited by 169
Triadic Closure Pattern Analysis and Prediction in Social Networks
Huang, H., Tang, J., Liu, L., Luo, J., & Fu, X. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2453956 · Cited by 96
Link prediction across networks by biased cross-network sampling
Qi, G.-J., Aggarwal, C. C., & Huang, T. S. (2013) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544875 · Cited by 41
Come-and-Go Patterns of Group Evolution: A Dynamic Model
Zhang, T., Cui, P., Faloutsos, C., Lu, Y., Ye, H., Zhu, W., & Yang, S. (2016) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2939672.2939795 · Cited by 21
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
Network Representation Learning: A Survey
Zhang, D., Yin, J., Zhu, X., & Zhang, C. (2020) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2018.2850013 · Cited by 714
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
Self-citationTemporal Graph Networks for Deep Learning on Dynamic Graphs
Rossi, E., Chamberlain, B., Frasca, F., Eynard, D., Monti, F., & Bronstein, M. (2020) · arXiv · doi:10.48550/arxiv.2006.10637 · Cited by 382
NetWalk: A Flexible Deep Embedding Approach for Anomaly Detection in Dynamic Networks
Yu, W., Cheng, W., Aggarwal, C. C., Zhang, K., Chen, H., & Wang, W. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220024 · Cited by 355
Metadata
- Authors
- Zhou, L., Yang, Y., Ren, X., Wu, F., & Zhuang, Y.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2018-04-25
- Volume
- 32
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2787927827
- Cited by
- 473
- References
- 34
- FWCI
- 25.70
- Type
- conference paper
- Language
- en
- Open access
- diamond
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.