{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T21:09:35Z","timestamp":1761340175109,"version":"3.37.3"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T00:00:00Z","timestamp":1628121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T00:00:00Z","timestamp":1628121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The problem of predicting links in large networks is an important task in a variety of practical applications, including social sciences, biology and computer security. In this paper, statistical techniques for link prediction based on the popular random dot product graph model are carefully presented, analysed and extended to dynamic settings. Motivated by a practical application in cyber-security, this paper demonstrates that random dot product graphs not only represent a powerful tool for inferring differences between multiple networks, but are also efficient for prediction purposes and for understanding the temporal evolution of the network. The probabilities of links are obtained by fusing information at two stages: spectral methods provide estimates of latent positions for each node, and time series models are used to capture temporal dynamics. In this way, traditional link prediction methods, usually based on decompositions of the entire network adjacency matrix, are extended using temporal information. The methods presented in this article are applied to a number of simulated and real-world graphs, showing promising results.<\/jats:p>","DOI":"10.1007\/s10618-021-00784-2","type":"journal-article","created":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T19:02:46Z","timestamp":1628190166000},"page":"2168-2199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Link prediction in dynamic networks using random dot product graphs"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4571-6681","authenticated-orcid":false,"given":"Francesco","family":"Sanna Passino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7094-909X","authenticated-orcid":false,"given":"Anna S.","family":"Bertiger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua C.","family":"Neil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8767-0810","authenticated-orcid":false,"given":"Nicholas A.","family":"Heard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,5]]},"reference":[{"key":"784_CR1","unstructured":"Abu-El-Haija S, Perozzi B, Al-Rfou R, Alemi AA (2018) Watch your step: Learning node embeddings via graph attention. In: Advances in Neural Information Processing Systems. vol.\u00a031. Curran Associates, Inc"},{"key":"784_CR2","unstructured":"Arroyo-Reli\u00f3n JD, Athreya A, Cape J, Chen G, Priebe CE, Vogelstein JT (2020) Inference for multiple heterogeneous networks with a common invariant subspace. Journal of Machine Learning Research (to appear)"},{"issue":"3","key":"784_CR3","doi-asserted-by":"publisher","first-page":"1648","DOI":"10.1214\/19-AOAS1252","volume":"13","author":"JD Arroyo-Reli\u00f3n","year":"2019","unstructured":"Arroyo-Reli\u00f3n JD, Kessler D, Levina E, Taylor SF (2019) Network classification with applications to brain connectomics. Ann Appl Stat 13(3):1648\u20131677","journal-title":"Ann Appl Stat"},{"issue":"226","key":"784_CR4","first-page":"1","volume":"18","author":"A Athreya","year":"2018","unstructured":"Athreya A, Fishkind DE, Tang M, Priebe CE, Park Y, Vogelstein JT, Levin K, Lyzinski V, Qin Y, Sussman DL (2018) Statistical inference on random dot product graphs: a survey. J Mach Learn Res 18(226):1\u201392","journal-title":"J Mach Learn Res"},{"issue":"461","key":"784_CR5","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1198\/016214503388619238","volume":"98","author":"MA Benjamin","year":"2003","unstructured":"Benjamin MA, Rigby RA, Stasinopoulos DM (2003) Generalized autoregressive moving average models. J Am Stat Assoc 98(461):214\u2013223","journal-title":"J Am Stat Assoc"},{"key":"784_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-0004-3","volume-title":"Springer series in statistics. Time series: theory and methods","author":"PJ Brockwell","year":"1987","unstructured":"Brockwell PJ, Davis RA (1987) Springer series in statistics. Time series: theory and methods. Springer, New York"},{"issue":"9","key":"784_CR7","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai H, Zheng VW, Chang K (2018) A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans Knowl Data Eng 30(9):1616\u20131637","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"784_CR8","doi-asserted-by":"crossref","unstructured":"Charlin L, Ranganath R, McInerney J, Blei DM (2015) Dynamic poisson factorization. In: Proceedings of the 9th ACM conference on recommender systems. pp. 155\u2013162","DOI":"10.1145\/2792838.2800174"},{"issue":"8","key":"784_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0182968","volume":"12","author":"B Chen","year":"2017","unstructured":"Chen B, Li F, Chen S, Hu R, Chen L (2017) Link prediction based on non-negative matrix factorization. PLOS ONE 12(8):1\u201318","journal-title":"PLOS ONE"},{"key":"784_CR10","doi-asserted-by":"crossref","unstructured":"Chen H, Li J (2018) Exploiting structural and temporal evolution in dynamic link prediction. In: Proceedings of the 27th ACM International conference on information and knowledge management. pp. 427\u2013436","DOI":"10.1145\/3269206.3271740"},{"key":"784_CR11","unstructured":"CSIRO\u2019s Data61: Stellargraph machine learning library. https:\/\/github.com\/stellargraph\/stellargraph (2018)"},{"key":"784_CR12","doi-asserted-by":"crossref","unstructured":"Deng D, Shahabi C, Demiryurek U, Zhu L, Yu R, Liu Y (2016) Latent space model for road networks to predict time-varying traffic. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. pp. 1525\u20131534","DOI":"10.1145\/2939672.2939860"},{"issue":"4","key":"784_CR13","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1109\/TSP.2013.2295553","volume":"62","author":"X Dong","year":"2014","unstructured":"Dong X, Frossard P, Vandergheynst P, Nefedov N (2014) Clustering on multi-layer graphs via subspace analysis on Grassmann manifolds. IEEE Trans Signal Process 62(4):905\u2013918","journal-title":"IEEE Trans Signal Process"},{"key":"784_CR14","doi-asserted-by":"publisher","DOI":"10.1002\/9781119072492","volume-title":"Statistical shape analysis, with applications in R","author":"IL Dryden","year":"2016","unstructured":"Dryden IL, Mardia KV (2016) Statistical shape analysis, with applications in R. John Wiley and Sons, Hoboken"},{"issue":"2","key":"784_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1921632.1921636","volume":"5","author":"DM Dunlavy","year":"2011","unstructured":"Dunlavy DM, Kolda TG, Acar E (2011) Temporal link prediction using matrix and tensor factorizations. ACM Trans Knowl Discov Data 5(2):1\u201327","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"4","key":"784_CR16","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1093\/biomet\/asu040","volume":"101","author":"D Durante","year":"2014","unstructured":"Durante D, Dunson DB (2014) Nonparametric Bayes dynamic modelling of relational data. Biometrika 101(4):883\u2013898","journal-title":"Biometrika"},{"issue":"1","key":"784_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1214\/16-BA1030","volume":"13","author":"D Durante","year":"2018","unstructured":"Durante D, Dunson DB (2018) Bayesian inference and testing of group differences in brain networks. Bayesian Anal 13(1):29\u201358","journal-title":"Bayesian Anal"},{"issue":"3","key":"784_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10994-012-5320-9","volume":"90","author":"J Gama","year":"2013","unstructured":"Gama J, Sebasti\u00e3o R, Rodrigues PP (2013) On evaluating stream learning algorithms. Mach Learn 90(3):317\u2013346","journal-title":"Mach Learn"},{"key":"784_CR19","doi-asserted-by":"crossref","unstructured":"Gao S, Denoyer L, Gallinari P (2011) Temporal link prediction by integrating content and structure information. In: Proceedings of the 20th ACM International conference on information and knowledge management. pp. 1169\u20131174","DOI":"10.1145\/2063576.2063744"},{"key":"784_CR20","doi-asserted-by":"crossref","unstructured":"Ghashami M, Liberty E, Phillips JM (2016) Efficient frequent directions algorithm for sparse matrices. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. pp. 845\u2013854","DOI":"10.1145\/2939672.2939800"},{"issue":"2","key":"784_CR21","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1214\/16-AOAS1015","volume":"11","author":"CE Ginestet","year":"2017","unstructured":"Ginestet CE, Li J, Balachandran P, Rosenberg S, Kolaczyk ED (2017) Hypothesis testing for network data in functional neuroimaging. Ann Appl Stat 11(2):725\u2013750","journal-title":"Ann Appl Stat"},{"issue":"1","key":"784_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02291478","volume":"40","author":"JC Gower","year":"1975","unstructured":"Gower JC (1975) Generalized Procrustes analysis. Psychometrika 40(1):33\u201351","journal-title":"Psychometrika"},{"key":"784_CR23","unstructured":"Goyal P, Kamra N, He X, Liu Y (2017) DynGEM: Deep embedding method for dynamic graphs. In: IJCAI International Workshop on Representation Learning forGraphs,"},{"key":"784_CR24","doi-asserted-by":"publisher","first-page":"104816","DOI":"10.1016\/j.knosys.2019.06.024","volume":"187","author":"P Goyal","year":"2020","unstructured":"Goyal P, Rokka Chhetri S, Canedo A (2020) dyngraph2vec: capturing network dynamics using dynamic graph representation learning. Knowl-Based Syst 187:104816","journal-title":"Knowl-Based Syst"},{"key":"784_CR25","unstructured":"Goyal P, Rokka Chhetri S, Mehrabi N, Ferrara E, Canedo A (2018) DynamicGEM: a library for dynamic graph embedding methods. arXiv e-prints"},{"key":"784_CR26","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. pp. 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"issue":"1","key":"784_CR27","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10618-015-0407-0","volume":"30","author":"\u0130 G\u00fcne\u015f","year":"2016","unstructured":"G\u00fcne\u015f \u0130, G\u00fcnd\u00fcz-\u00d6\u011f\u00fcd\u00fcc\u00fc \u015e, \u00c7ataltepe Z (2016) Link prediction using time series of neighborhood-based node similarity scores. Data Min Knowl Discov 30(1):147\u2013180","journal-title":"Data Min Knowl Discov"},{"key":"784_CR28","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs. In: Proceedings of the 31st International conference on neural information processing systems. pp. 1025\u20131035"},{"issue":"460","key":"784_CR29","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1198\/016214502388618906","volume":"97","author":"PD Hoff","year":"2002","unstructured":"Hoff PD, Raftery AE, Handcock MS (2002) Latent space approaches to social network analysis. J Am Stat Assoc 97(460):1090\u20131098","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"784_CR30","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland PW, Laskey KB, Leinhardt S (1983) Stochastic blockmodels: first steps. Soc Netw 5(2):109\u2013137","journal-title":"Soc Netw"},{"issue":"1","key":"784_CR31","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/TKDE.2018.2879796","volume":"32","author":"SA Hosseini","year":"2020","unstructured":"Hosseini SA, Khodadadi A, Alizadeh K, Arabzadeh A, Farajtabar M, Zha H, Rabiee HR (2020) Recurrent Poisson factorization for temporal recommendation. IEEE Trans Knowl Data Eng 32(1):121\u2013134","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"784_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v027.i03","volume":"27","author":"R Hyndman","year":"2008","unstructured":"Hyndman R, Khandakar Y (2008) Automatic time series forecasting: the forecast package for R. J Stat Softw 27(3):1\u201322","journal-title":"J Stat Softw"},{"key":"784_CR33","first-page":"919","volume":"23","author":"K Ishiguro","year":"2010","unstructured":"Ishiguro K, Iwata T, Ueda N, Tenenbaum JB (2010) Dynamic infinite relational model for time-varying relational data analysis. Adv Neural Inf Process Syst 23:919\u2013927","journal-title":"Adv Neural Inf Process Syst"},{"issue":"4","key":"784_CR34","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1002\/asmb.2326","volume":"34","author":"DR Jeske","year":"2018","unstructured":"Jeske DR, Stevens NT, Tartakovsky AG, Wilson JD (2018) Statistical methods for network surveillance. Appl Stoch Models Bus Ind 34(4):425\u2013445","journal-title":"Appl Stoch Models Bus Ind"},{"key":"784_CR35","unstructured":"Jones A, Rubin-Delanchy P (2021) The multilayer random dot product graph"},{"issue":"4","key":"784_CR36","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1162\/rest.90.4.777","volume":"90","author":"H Kauppi","year":"2008","unstructured":"Kauppi H, Saikkonen P (2008) Predicting U.S. recessions with dynamic binary response models. Rev Econ Stat 90(4):777\u2013791","journal-title":"Rev Econ Stat"},{"issue":"70","key":"784_CR37","first-page":"1","volume":"21","author":"SM Kazemi","year":"2020","unstructured":"Kazemi SM, Goel R, Jain K, Kobyzev I, Sethi A, Forsyth P, Poupart P (2020) Representation learning for dynamic graphs: A survey. J Mach Learn Res 21(70):1\u201373","journal-title":"J Mach Learn Res"},{"issue":"5","key":"784_CR38","first-page":"1807","volume":"33","author":"M Khosla","year":"2021","unstructured":"Khosla M, Setty V, Anand A (2021) A comparative study for unsupervised network representation learning. IEEE Trans Knowl Data Eng 33(5):1807\u20131818","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"784_CR39","unstructured":"Kim Y, Levina E (2019) Graph-aware modeling of brain connectivity networks. arXiv e-prints arXiv:1903.02129"},{"key":"784_CR40","unstructured":"Kingma DP, Ba J (2015) Adam: a method for stochastic optimization. In: Bengio Y, LeCun Y (eds) 3rd International conference on learning representations. ICLR. San Diego, CA, USA"},{"key":"784_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.laa.2005.01.004","volume":"402","author":"U Kintzel","year":"2005","unstructured":"Kintzel U (2005) Procrustes problems in finite dimensional indefinite scalar product spaces. Linear Algebra Appl 402:1\u201328","journal-title":"Linear Algebra Appl"},{"key":"784_CR42","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: 5th International conference on learning representations, ICLR 2017, Conference Track Proceedings"},{"issue":"1","key":"784_CR43","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1111\/rssb.12014","volume":"76","author":"PN Krivitsky","year":"2014","unstructured":"Krivitsky PN, Handcock MS (2014) A separable model for dynamic networks. J Royal Stat Soc: Series B (Statistical Methodology) 76(1):29\u201346","journal-title":"J Royal Stat Soc: Series B (Statistical Methodology)"},{"key":"784_CR44","doi-asserted-by":"crossref","unstructured":"Kumar S, Zhang X, Leskovec J (2019) Predicting dynamic embedding trajectory in temporal interaction networks. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery and data mining. pp. 1269\u20131278. KDD \u201919","DOI":"10.1145\/3292500.3330895"},{"key":"784_CR45","doi-asserted-by":"crossref","unstructured":"Levin K, Athreya A, Tang M, Lyzinski V, Park Y, Priebe CE (2017) A central limit theorem for an omnibus embedding of multiple random graphs and implications for multiscale network inference. arXiv e-prints arXiv:1705.09355","DOI":"10.1109\/ICDMW.2017.132"},{"key":"784_CR46","doi-asserted-by":"crossref","unstructured":"Li X, Du N, Li H, Li K, Gao J, Zhang A (2014) A deep learning approach to link prediction in dynamic networks. In: Proceedings of the 2014 SIAM International conference on data mining. pp. 289\u2013297","DOI":"10.1137\/1.9781611973440.33"},{"issue":"7","key":"784_CR47","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58(7):1019\u20131031","journal-title":"J Am Soc Inf Sci Technol"},{"key":"784_CR48","doi-asserted-by":"crossref","unstructured":"Liu Z, Zhou D, He J (2019) Towards explainable representation of time-evolving graphs via spatial-temporal graph attention networks. In: Proceedings of the 28th ACM international conference on information and knowledge management. pp. 2137\u20132140. CIKM \u201919","DOI":"10.1145\/3357384.3358155"},{"issue":"6","key":"784_CR49","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc L, Zhou T (2011) Link prediction in complex networks: a survey. Phys A: Stat Mech Appl 390(6):1150\u20131170","journal-title":"Phys A: Stat Mech Appl"},{"key":"784_CR50","volume-title":"Hidden Markov and other models for discrete-valued time series","author":"IL MacDonald","year":"1997","unstructured":"MacDonald IL, Zucchini W (1997) Hidden Markov and other models for discrete-valued time series. Taylor & Francis, Milton Park"},{"key":"784_CR51","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-23783-6_28","volume-title":"Joint Eur Conf Mach Learn Knowl Discov Datab","author":"AK Menon","year":"2011","unstructured":"Menon AK, Elkan C (2011) Link prediction via matrix factorization. Joint Eur Conf Mach Learn Knowl Discov Datab. Springer, Berlin, pp 437\u2013452"},{"issue":"4","key":"784_CR52","doi-asserted-by":"publisher","first-page":"2586","DOI":"10.1214\/19-AOAS1286","volume":"13","author":"S Metelli","year":"2019","unstructured":"Metelli S, Heard NA (2019) On Bayesian new edge prediction and anomaly detection in computer networks. Ann Appl Stat 13(4):2586\u20132610","journal-title":"Ann Appl Stat"},{"issue":"4","key":"784_CR53","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1080\/00401706.2013.822830","volume":"55","author":"J Neil","year":"2013","unstructured":"Neil J, Hash C, Brugh A, Fisk M, Storlie CB (2013) Scan statistics for the online detection of locally anomalous subgraphs. Technometrics 55(4):403\u2013414","journal-title":"Technometrics"},{"key":"784_CR54","doi-asserted-by":"crossref","unstructured":"Nguyen GH, Lee JB, Rossi RA, Ahmed NK, Koh E, Kim S (2018) Continuous-time dynamic network embeddings. In: Companion proceedings of the the web conference 2018. pp. 969\u2013976. WWW \u201918","DOI":"10.1145\/3184558.3191526"},{"key":"784_CR55","unstructured":"Nielsen AM, Witten D (2018) The multiple random dot product graph model. arXiv e-prints arXiv:1811.12172"},{"key":"784_CR56","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: Online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International conference on knowledge discovery and data mining. pp. 701\u2013710. KDD \u201914","DOI":"10.1145\/2623330.2623732"},{"key":"784_CR57","unstructured":"Priebe CE, Park Y, Tang M, Athreya A, Lyzinski V, Vogelstein JT, Qin Y, Cocanougher B, Eichler K, Zlatic M, Cardona A (2017) Semiparametric spectral modeling of the drosophila connectome"},{"key":"784_CR58","doi-asserted-by":"crossref","unstructured":"Qiu J, Dong Y, Ma H, Li J, Wang K, Tang J (2018) Network embedding as matrix factorization: Unifying DeepWalk, LINE, PTE, and node2vec. In: Proceedings of the eleventh ACM International conference on web search and data mining. pp. 459\u2013467. WSDM \u201918, Association for Computing Machinery","DOI":"10.1145\/3159652.3159706"},{"key":"784_CR59","doi-asserted-by":"crossref","unstructured":"Qu L, Zhu H, Duan Q, Shi Y (2020) Continuous-time link prediction via temporal dependent graph neural network. In: Proceedings of the web conference 2020. pp. 3026\u20133032. WWW \u201920","DOI":"10.1145\/3366423.3380073"},{"key":"784_CR60","unstructured":"Rubin-Delanchy P, Priebe CE, Tang M, Cape J (2017) A statistical interpretation of spectral embedding: the generalised random dot product graph. arXiv e-prints"},{"key":"784_CR61","doi-asserted-by":"crossref","unstructured":"Sankar A, Wu Y, Gou L, Zhang W, Yang H (2020) DySAT: deep neural representation learning on dynamic graphs via self-attention networks. In: Proceedings of the 13th International conference on web search and data mining. pp. 519\u2013527","DOI":"10.1145\/3336191.3371845"},{"issue":"2","key":"784_CR62","first-page":"2022","volume":"8","author":"P Sarkar","year":"2014","unstructured":"Sarkar P, Chakrabarti D, Jordan M (2014) Nonparametric link prediction in large scale dynamic networks. Electr J Stat 8(2):2022\u20132065","journal-title":"Electr J Stat"},{"key":"784_CR63","first-page":"1145","volume":"18","author":"P Sarkar","year":"2006","unstructured":"Sarkar P, Moore AW (2006) Dynamic social network analysis using latent space models. Adv Neural Inf Process Syst 18:1145\u20131152","journal-title":"Adv Neural Inf Process Syst"},{"key":"784_CR64","doi-asserted-by":"crossref","unstructured":"Schein A, Paisley J, Blei DM, Wallach H (2015) Bayesian Poisson tensor factorization for inferring multilateral relations from sparse dyadic event counts. In: Proceedings of the 21th ACM SIGKDD International conference on knowledge discovery and data mining. pp. 1045\u20131054","DOI":"10.1145\/2783258.2783414"},{"issue":"1","key":"784_CR65","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00180-009-0158-8","volume":"25","author":"ER Scheinerman","year":"2010","unstructured":"Scheinerman ER, Tucker K (2010) Modeling graphs using dot product representations. Comput Stat 25(1):1\u201316","journal-title":"Comput Stat"},{"issue":"1","key":"784_CR66","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02289451","volume":"31","author":"PH Sch\u00f6nemann","year":"1966","unstructured":"Sch\u00f6nemann PH (1966) A generalized solution of the orthogonal Procrustes problem. Psychometrika 31(1):1\u201310","journal-title":"Psychometrika"},{"issue":"512","key":"784_CR67","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1080\/01621459.2014.988214","volume":"110","author":"DK Sewell","year":"2015","unstructured":"Sewell DK, Chen Y (2015) Latent space models for dynamic networks. J Am Stat Assoc 110(512):1646\u20131657","journal-title":"J Am Stat Assoc"},{"key":"784_CR68","doi-asserted-by":"crossref","unstructured":"Sharan U, Neville J (2008) Temporal-relational classifiers for prediction in evolving domains. In: Proceedings of the 2008 Eighth IEEE International conference on data mining. pp. 540\u2013549","DOI":"10.1109\/ICDM.2008.125"},{"issue":"4","key":"784_CR69","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TKDE.2010.272","volume":"24","author":"M Shiga","year":"2012","unstructured":"Shiga M, Mamitsuka H (2012) A variational Bayesian framework for clustering with multiple graphs. IEEE Trans Knowl Data Eng 24(4):577\u2013590","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"784_CR70","doi-asserted-by":"crossref","unstructured":"Tang W, Lu Z, Dhillon IS (2009) Clustering with multiple graphs. In: Proceedings of the 2009 Ninth IEEE International conference on data mining. pp. 1016\u20131021. ICDM \u201909, IEEE Computer Society, Washington, DC, USA","DOI":"10.1109\/ICDM.2009.125"},{"key":"784_CR71","doi-asserted-by":"crossref","unstructured":"Turcotte MJM, Kent AD, Hash C (2018) Unified host and network data set, chap.\u00a01, pp. 1\u201322. World Scientific","DOI":"10.1142\/9781786345646_001"},{"key":"784_CR72","unstructured":"Velickovic P, Fedus W, Hamilton WL, Li\u00f2 P, Bengio Y, Hjelm RD (2019) Deep graph infomax. In: 7th International conference on learning representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019"},{"key":"784_CR73","doi-asserted-by":"crossref","unstructured":"Wang D, Cui P, Zhu W (2016) Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD International conference on knowledge discovery and data mining. pp. 1225\u20131234. KDD \u201916","DOI":"10.1145\/2939672.2939753"},{"issue":"4","key":"784_CR74","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1109\/TPAMI.2019.2948619","volume":"43","author":"S Wang","year":"2021","unstructured":"Wang S, Arroyo J, Vogelstein JT, Priebe CE (2021) Joint embedding of graphs. IEEE Trans Pattern Anal Mach Intell 43(4):1324\u20131336","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"784_CR75","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1214\/09-AOAS311","volume":"4","author":"EP Xing","year":"2010","unstructured":"Xing EP, Fu W, Song L (2010) A state-space mixed membership blockmodel for dynamic network tomography. Ann Appl Stat 4(2):535\u2013566","journal-title":"Ann Appl Stat"},{"issue":"4","key":"784_CR76","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1109\/JSTSP.2014.2310294","volume":"8","author":"KS Xu","year":"2014","unstructured":"Xu KS, Hero AO III (2014) Dynamic stochastic blockmodels for time-evolving social networks. IEEE J Select Topics Signal Process 8(4):552\u2013562","journal-title":"IEEE J Select Topics Signal Process"},{"key":"784_CR77","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2020.1824870","author":"C Yang","year":"2021","unstructured":"Yang C, Priebe CE, Park Y, Marchette DJ (2021) Simultaneous dimensionality and complexity model selection for spectral graph clustering. J Comput Graph Stat. https:\/\/doi.org\/10.1080\/10618600.2020.1824870","journal-title":"J Comput Graph Stat"},{"key":"784_CR78","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-540-77004-6_11","volume-title":"Algorithms and models for the web-graph","author":"SJ Young","year":"2007","unstructured":"Young SJ, Scheinerman ER (2007) Random dot product graph models for social networks. Algorithms and models for the web-graph. Springer, Berlin, pp 138\u2013149"},{"key":"784_CR79","doi-asserted-by":"crossref","unstructured":"Yu W, Aggarwal CC, Wang W (2017a) Temporally factorized network modeling for evolutionary network analysis. In: Proceedings of the Tenth ACM International conference on web search and data mining. pp. 455\u2013464","DOI":"10.1145\/3018661.3018669"},{"key":"784_CR80","doi-asserted-by":"crossref","unstructured":"Yu W, Cheng W, Aggarwal CC, Chen H, Wang W (2017b) Link prediction with spatial and temporal consistency in dynamic networks. In: Proceedings of the twenty-sixth international joint conference on artificial intelligence. pp. 3343\u20133349","DOI":"10.24963\/ijcai.2017\/467"},{"key":"784_CR81","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981333","author":"Z Zhang","year":"2020","unstructured":"Zhang Z, Cui P, Zhu W (2020) Deep learning on graphs: a survey. IEEE Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2020.2981333","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"784_CR82","doi-asserted-by":"crossref","unstructured":"Zhou D, Zheng L, Han J, He J (2020) A data-driven graph generative model for temporal interaction networks. In: Proceedings of the 26th ACM SIGKDD International conference on knowledge discovery and data mining. pp. 401\u2013411. KDD \u201920","DOI":"10.1145\/3394486.3403082"},{"issue":"10","key":"784_CR83","doi-asserted-by":"publisher","first-page":"2765","DOI":"10.1109\/TKDE.2016.2591009","volume":"28","author":"L Zhu","year":"2016","unstructured":"Zhu L, Guo D, Yin J, Steeg GV, Galstyan A (2016) Scalable temporal latent space inference for link prediction in dynamic social networks. IEEE Trans Knowl Data Eng 28(10):2765\u20132777","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"784_CR84","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.csda.2005.09.010","volume":"51","author":"M Zhu","year":"2006","unstructured":"Zhu M, Ghodsi A (2006) Automatic dimensionality selection from the scree plot via the use of profile likelihood. Comput Stat Data Anal 51(2):918\u2013930","journal-title":"Comput Stat Data Anal"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00784-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-021-00784-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00784-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,5]],"date-time":"2023-02-05T14:17:37Z","timestamp":1675606657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-021-00784-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,5]]},"references-count":84,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["784"],"URL":"https:\/\/doi.org\/10.1007\/s10618-021-00784-2","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2021,8,5]]},"assertion":[{"value":"1 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}