{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:52Z","timestamp":1740160312648,"version":"3.37.3"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T00:00:00Z","timestamp":1629763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T00:00:00Z","timestamp":1629763200000},"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":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Link prediction is a well-studied technique for inferring the missing edges between two nodes in some static representation of a network. In modern day social networks, the timestamps associated with each link can be used to predict <jats:italic>future links<\/jats:italic> between so-far unconnected nodes. In these so-called temporal networks, we speak of <jats:italic>temporal link prediction<\/jats:italic>. This paper presents a systematic investigation of supervised temporal link prediction on 26\u00a0temporal, structurally diverse, real-world networks ranging from thousands to a million nodes and links. We analyse the relation between global structural properties of each network and the obtained temporal link prediction performance, employing a set of well-established topological features commonly used in the link prediction literature. We report on four contributions. First, using temporal information, an improvement of prediction performance is observed. Second, our experiments show that degree disassortative networks perform better in temporal link prediction than assortative networks. Third, we present a new approach to investigate the distinction between networks modelling discrete events and networks modelling persistent relations. Unlike earlier work, our approach utilises information on <jats:italic>all<\/jats:italic> past events in a systematic way, resulting in substantially higher link prediction performance. Fourth, we report on the influence of the temporal activity of the node or the edge on the link prediction performance, and show that the performance differs depending on the considered network type. In the studied information networks, temporal information on the node appears most important. The findings in this paper demonstrate how link prediction can effectively be improved in temporal networks, explicitly taking into account the type of connectivity modelled by the temporal edge. More generally, the findings contribute to a better understanding of the mechanisms behind the evolution of networks.<\/jats:p>","DOI":"10.1007\/s13278-021-00787-3","type":"journal-article","created":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T12:14:28Z","timestamp":1629807268000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Supervised temporal link prediction in large-scale real-world networks"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4936-879X","authenticated-orcid":false,"given":"Gerrit Jan","family":"de Bruin","sequence":"first","affiliation":[]},{"given":"Cor J.","family":"Veenman","sequence":"additional","affiliation":[]},{"given":"H. Jaap","family":"van den Herik","sequence":"additional","affiliation":[]},{"given":"Frank W.","family":"Takes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,24]]},"reference":[{"issue":"3","key":"787_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic LA, Adar E (2003) Friends and neighbors on the Web. Soc Netw 25(3):211\u2013230. https:\/\/doi.org\/10.1016\/S0378-8733(03)00009-1","journal-title":"Social Netw"},{"key":"787_CR2","unstructured":"Al\u00a0Hasan M, Chaoji V, Salem S, Zaki M, Hasan MA, Chaoji V, Salem S, Zaki M, York N (2006) Link prediction using supervised learning. In: SDM06: workshop on link analysis, counter-terrorism and security, vol 30, pp 798\u2013805"},{"issue":"7039","key":"787_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/nature03459","volume":"435","author":"AL Barab\u00e1si","year":"2005","unstructured":"Barab\u00e1si AL (2005) The origin of bursts and heavy tails in human dynamics. Nature 435(7039):207\u2013211. https:\/\/doi.org\/10.1038\/nature03459","journal-title":"Nature"},{"key":"787_CR4","volume-title":"Network science","author":"AL Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si AL (2016) Network science. Cambridge University Press, Cambridge"},{"key":"787_CR5","doi-asserted-by":"publisher","DOI":"10.1117\/1.2819119","volume-title":"Pattern recognition and machine learning","author":"CM Bishop","year":"2013","unstructured":"Bishop CM (2013) Pattern recognition and machine learning. Springer, New York. https:\/\/doi.org\/10.1117\/1.2819119"},{"issue":"5","key":"787_CR6","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.jocs.2014.01.003","volume":"5","author":"CA Bliss","year":"2014","unstructured":"Bliss CA, Frank MR, Danforth CM, Dodds PS (2014) An evolutionary algorithm approach to link prediction in dynamic social networks. J Comput Sci 5(5):750\u2013764. https:\/\/doi.org\/10.1016\/j.jocs.2014.01.003","journal-title":"J Comput Sci"},{"key":"787_CR7","doi-asserted-by":"publisher","unstructured":"Brandes U, Kenis P, Lerner J, Van\u00a0Raaij D (2009) Network analysis of collaboration structure in Wikipedia. In: Proceedings of the 18th international world wide web conference. Association for Computing Machinery, New York, pp 731\u2013740. https:\/\/doi.org\/10.1145\/1526709.1526808","DOI":"10.1145\/1526709.1526808"},{"key":"787_CR8","doi-asserted-by":"publisher","unstructured":"B\u00fct\u00fcn E, Kaya M, Alhajj R (2016) A new topological metric for link prediction in directed, weighted and temporal networks. In: Proceedings of the 2016 IEEE\/ACM international conference on advances in social networks analysis and mining. IEEE, Los Alamitos, pp 954\u2013959. https:\/\/doi.org\/10.1109\/ASONAM.2016.7752355","DOI":"10.1109\/ASONAM.2016.7752355"},{"key":"787_CR9","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.ins.2018.06.051","volume":"463\u2013464","author":"E B\u00fct\u00fcn","year":"2018","unstructured":"B\u00fct\u00fcn E, Kaya M, Alhajj R (2018) Extension of neighbor-based link prediction methods for directed, weighted and temporal social networks. Inf Sci 463\u2013464:152\u2013165. https:\/\/doi.org\/10.1016\/j.ins.2018.06.051","journal-title":"Inf Sci"},{"key":"787_CR10","doi-asserted-by":"crossref","unstructured":"Chen T, Guestrin C (2016) Xgboost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 785\u2013794","DOI":"10.1145\/2939672.2939785"},{"key":"787_CR11","doi-asserted-by":"publisher","unstructured":"Da\u00a0Silva\u00a0Soares PR, Prudencio RBC (2012) Time series based link prediction. In: Proceedings of the international joint conference on neural networks. IEEE, Brisbane, pp 1\u20137. https:\/\/doi.org\/10.1109\/IJCNN.2012.6252471","DOI":"10.1109\/IJCNN.2012.6252471"},{"key":"787_CR12","doi-asserted-by":"publisher","unstructured":"de\u00a0Bruin GJ, Veenman CJ, van\u00a0den Herik HJ, Takes FW (2020) Understanding dynamics of truck co-driving networks. Stud Comput Intell 882 SCI:140\u2013151. https:\/\/doi.org\/10.1007\/978-3-030-36683-4_12","DOI":"10.1007\/978-3-030-36683-4_12"},{"key":"787_CR13","doi-asserted-by":"publisher","unstructured":"de\u00a0Bruin GJ, Veenman CJ, van\u00a0den Herik HJ, Takes FW (2021) Experimental evaluation of train and test split strategies in link prediction. In: Benito RM, Cherifi C, Cherifi H, Moro E, Rocha LM, Sales-Pardo M (eds) Complex networks & their applications IX. Springer, Cham, pp 79\u201391. https:\/\/doi.org\/10.1007\/978-3-030-65351-4_7","DOI":"10.1007\/978-3-030-65351-4_7"},{"key":"787_CR14","doi-asserted-by":"publisher","unstructured":"De\u00a0Choudhury M, Sundaram H, John A, Seligmann DD (2009) Social synchrony: predicting mimicry of user actions in online social media. In: 2009 International conference on computational science and engineering, vol 4. IEEE, Vancouver, pp 151\u2013158. https:\/\/doi.org\/10.1109\/CSE.2009.439","DOI":"10.1109\/CSE.2009.439"},{"key":"787_CR15","doi-asserted-by":"publisher","unstructured":"Dhote Y, Mishra N, Sharma S (2013) Survey and analysis of temporal link prediction in online social networks. In: Proceedings of the 2013 international conference on advances in computing, communications and informatics. IEEE, Mysore, pp 1178\u20131183. https:\/\/doi.org\/10.1109\/ICACCI.2013.6637344","DOI":"10.1109\/ICACCI.2013.6637344"},{"issue":"1","key":"787_CR16","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s00354-019-00065-z","volume":"38","author":"A Divakaran","year":"2020","unstructured":"Divakaran A, Mohan A (2020) Temporal link prediction: a survey. N Gener Comput 38(1):213\u2013258. https:\/\/doi.org\/10.1007\/s00354-019-00065-z","journal-title":"N Gener Comput"},{"issue":"38","key":"787_CR17","doi-asserted-by":"publisher","first-page":"23393","DOI":"10.1073\/pnas.1914950117","volume":"117","author":"A Ghasemian","year":"2020","unstructured":"Ghasemian A, Hosseinmardi H, Galstyan A, Airoldi EM, Clauset A (2020) Stacking models for nearly optimal link prediction in complex networks. Proc Natl Acad Sci 117(38):23393\u201323400. https:\/\/doi.org\/10.1073\/pnas.1914950117","journal-title":"Proc Natl Acad Sci"},{"key":"787_CR18","doi-asserted-by":"publisher","DOI":"10.1201\/b16132","volume-title":"Handbook of graph theory","author":"JL Gross","year":"2013","unstructured":"Gross JL, Yellen J, Zhang P (2013) Handbook of graph theory, 2nd edn. Chapman Hall\/CRC, London","edition":"2"},{"key":"787_CR19","doi-asserted-by":"publisher","unstructured":"Grover A, Leskovec J (2016) Node2vec: scalable feature learning for networks. Association for Computing Machinery, New York, pp 855\u2013864. https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"issue":"1","key":"787_CR20","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 Disc 30(1):147\u2013180. https:\/\/doi.org\/10.1007\/s10618-015-0407-0","journal-title":"Data Min Knowl Disc"},{"key":"787_CR21","unstructured":"Hagberg A, Swart P, Chult S, D. (2008) Exploring network structure, dynamics, and function using NetworkX. Tech. rep., Los Alamos National Lab. Los Alamos, NM, USA"},{"key":"787_CR22","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Representation learning on graphs: methods and applications. arXiv:1709.05584"},{"issue":"2","key":"787_CR23","doi-asserted-by":"publisher","first-page":"023073","DOI":"10.1103\/PhysRevResearch.2.023073","volume":"2","author":"T Hiraoka","year":"2020","unstructured":"Hiraoka T, Masuda N, Li A, Jo HH (2020) Modeling temporal networks with bursty activity patterns of nodes and links. Phys Rev Res 2(2):023073. https:\/\/doi.org\/10.1103\/PhysRevResearch.2.023073","journal-title":"Phys Rev Res"},{"issue":"1","key":"787_CR24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1140\/epjds5","volume":"1","author":"T Hogg","year":"2012","unstructured":"Hogg T, Lerman K (2012) Social dynamics of Digg. EPJ Data Sci 1(1):5. https:\/\/doi.org\/10.1140\/epjds5","journal-title":"EPJ Data Sci"},{"key":"787_CR25","unstructured":"Holzinger A, Biemann C, Pattichis CS, Kell DB (2017) What do we need to build explainable AI systems for the medical domain? arXiv:1712.09923"},{"key":"787_CR26","doi-asserted-by":"publisher","unstructured":"Klimt B, Yang Y (2004) The enron corpus: a new dataset for email classification research. In: Boulicaut JF, Esposito F, Giannotti F, Pedreschi D (eds) Machine learning: ECML. Springer, Berlin, pp 217\u2013226. https:\/\/doi.org\/10.1007\/978-3-540-30115-8_22","DOI":"10.1007\/978-3-540-30115-8_22"},{"key":"787_CR27","doi-asserted-by":"publisher","unstructured":"Kumar S, Spezzano F, Subrahmanian VS, Faloutsos C (2017) Edge weight prediction in weighted signed networks. In: Proceedings\u2014IEEE international conference on data mining. IEEE, Barcelona, pp 221\u2013230. https:\/\/doi.org\/10.1109\/ICDM.2016.175","DOI":"10.1109\/ICDM.2016.175"},{"key":"787_CR28","doi-asserted-by":"publisher","unstructured":"Kumar S, Hamilton WL, Leskovec J, Jurafsky D (2018) Community interaction and conflict on the web. In: Proceedings of the 2018 world wide web conference. International World Wide Web Conferences Steering Committee, Geneva, Switzerland, pp 933\u2013943. https:\/\/doi.org\/10.1145\/3178876.3186141","DOI":"10.1145\/3178876.3186141"},{"key":"787_CR29","doi-asserted-by":"publisher","first-page":"124289","DOI":"10.1016\/j.physa.2020.124289","volume":"553","author":"A Kumar","year":"2020","unstructured":"Kumar A, Singh SS, Singh K, Biswas B (2020) Link prediction techniques, applications, and performance: a survey. Physica A 553:124289. https:\/\/doi.org\/10.1016\/j.physa.2020.124289","journal-title":"Physica A"},{"key":"787_CR30","doi-asserted-by":"publisher","unstructured":"Kunegis J (2013) KONECT: the Koblenz network collection. In: Proceedings of the 22nd international conference on world wide web. Association for Computing Machinery, New York, pp 1343\u20131350. https:\/\/doi.org\/10.1145\/2487788.2488173","DOI":"10.1145\/2487788.2488173"},{"key":"787_CR31","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"issue":"1","key":"787_CR32","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):2\u201343. https:\/\/doi.org\/10.1145\/1217299.1217301","journal-title":"ACM Trans Knowl Discov Data"},{"key":"787_CR33","doi-asserted-by":"publisher","unstructured":"Ley M (2002) The DBLP computer science bibliography: evolution, research issues, perspectives. In: Laender AHF, Oliveira A (eds) String processing and information retrieval, string processing and information retrieval, vol 2476. Springer, Berlin, pp 1\u201310. https:\/\/doi.org\/10.1007\/3-540-45735-6_1","DOI":"10.1007\/3-540-45735-6_1"},{"issue":"7","key":"787_CR34","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 Inform Sci Technol 58(7):1019\u20131031. https:\/\/doi.org\/10.1002\/asi.20591","journal-title":"J Am Soc Inform Sci Technol"},{"key":"787_CR35","doi-asserted-by":"publisher","unstructured":"Lichtenwalter R, Chawla NV (2012) Link prediction: fair and effective evaluation. Proceedings of the 2012 IEEE\/ACM international conference on advances in social networks analysis and mining, pp 376\u2013383. https:\/\/doi.org\/10.1109\/ASONAM.2012.68","DOI":"10.1109\/ASONAM.2012.68"},{"key":"787_CR36","doi-asserted-by":"publisher","unstructured":"Lichtenwalter RN, Lussier JT, Chawla NV (2010) New perspectives and methods in link prediction. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining. Association for Computing Machinery, New York, pp 243\u2013252. https:\/\/doi.org\/10.1145\/1835804.1835837","DOI":"10.1145\/1835804.1835837"},{"issue":"6","key":"787_CR37","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"LL Linyuan","year":"2011","unstructured":"Linyuan LL, Zhou T (2011) Link prediction in complex networks: a survey. Physica A 390(6):1150\u20131170. https:\/\/doi.org\/10.1016\/j.physa.2010.11.027","journal-title":"Physica A"},{"key":"787_CR38","doi-asserted-by":"publisher","unstructured":"Marjan M, Zaki N, Mohamed EA (2018) Link prediction in dynamic social networks: a literature review. In: 5th International congress on information science and technology. IEEE, Marrakech, pp 200\u2013207. https:\/\/doi.org\/10.1109\/CIST.2018.8596511","DOI":"10.1109\/CIST.2018.8596511"},{"key":"787_CR39","doi-asserted-by":"publisher","unstructured":"Michalski R, Palus S, Kazienko P (2011) Matching organizational structure and social network extracted from email communication. In: Abramowicz W (ed) Business information systems, vol 87. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-21863-7_17","DOI":"10.1007\/978-3-642-21863-7_17"},{"key":"787_CR40","unstructured":"Molnar C (2020) Interpretable machine learning. Lulu.com"},{"key":"787_CR41","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.knosys.2018.05.027","volume":"156","author":"CP Muniz","year":"2018","unstructured":"Muniz CP, Goldschmidt R, Choren R (2018) Combining contextual, temporal and topological information for unsupervised link prediction in social networks. Knowl Based Syst 156:129\u2013137. https:\/\/doi.org\/10.1016\/j.knosys.2018.05.027","journal-title":"Knowl Based Syst"},{"issue":"20","key":"787_CR42","doi-asserted-by":"publisher","first-page":"208701","DOI":"10.1103\/PhysRevLett.89.208701","volume":"89","author":"MEJ Newman","year":"2002","unstructured":"Newman MEJ (2002) Assortative mixing in networks. Phys Rev Lett 89(20):208701. https:\/\/doi.org\/10.1103\/PhysRevLett.89.208701","journal-title":"Phys Rev Lett"},{"key":"787_CR43","doi-asserted-by":"publisher","unstructured":"\u00d6czan A, \u00d6\u011f\u00fcd\u00fcc\u00fc \u015eG (2015) Multivariate temporal Link Prediction in evolving social networks. In: 2015 IEEE\/ACIS 14th international conference on computer and information science. IEEE, Las Vegas, pp 185\u2013190. https:\/\/doi.org\/10.1109\/ICIS.2015.7166591","DOI":"10.1109\/ICIS.2015.7166591"},{"key":"787_CR44","doi-asserted-by":"publisher","unstructured":"\u00d6czan A, \u00d6\u011f\u00fcd\u00fcc\u00fc \u015eG (2017) Supervised temporal link prediction using time series of similarity measures. In: 2017 Ninth international conference on ubiquitous and future networks. IEEE, Milan, pp 519\u2013521. https:\/\/doi.org\/10.1109\/ICUFN.2017.7993838","DOI":"10.1109\/ICUFN.2017.7993838"},{"issue":"2","key":"787_CR45","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1117454.1117458","volume":"7","author":"J O\u2019Madadhain","year":"2005","unstructured":"O\u2019Madadhain J, Hutchins J, Smyth P (2005) Prediction and ranking algorithms for event-based network data. ACM SIGKDD Explorations Newsletter 7(2):23\u201330. https:\/\/doi.org\/10.1145\/1117454.1117458","journal-title":"ACM SIGKDD Explorations Newsletter"},{"issue":"2","key":"787_CR46","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.socnet.2011.07.001","volume":"35","author":"T Opsahl","year":"2013","unstructured":"Opsahl T (2013) Triadic closure in two-mode networks: redefining the global and local clustering coefficients. Soc Netw 35(2):159\u2013167. https:\/\/doi.org\/10.1016\/j.socnet.2011.07.001","journal-title":"Soc Netw"},{"key":"787_CR47","doi-asserted-by":"publisher","unstructured":"Paranjape A, Benson AR, Leskovec J (2017) Motifs in temporal networks. In: Proceedings of the 10th ACM international conference on web search and data mining, pp 601\u2013610. https:\/\/doi.org\/10.1145\/3018661.3018731","DOI":"10.1145\/3018661.3018731"},{"key":"787_CR48","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V, Vanderplas J, Passos A, Cournapeau D, Brucher M, Perrot M, Duchesnay E (2011) Scikit-learn: machine learning in python. J Mach Learn Res 12:2825\u20132830","journal-title":"J Mach Learn Res"},{"key":"787_CR49","doi-asserted-by":"publisher","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) DeepWalk: Online learning of social representations. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining. Association for Computing Machinery, New York, pp 701\u2013710. https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"key":"787_CR50","unstructured":"Potgieter A, April KA, Cooke RJE, Osunmakinde IO (2007) Temporality in link prediction: understanding social complexity"},{"issue":"9","key":"787_CR51","doi-asserted-by":"publisher","first-page":"3715","DOI":"10.1016\/j.eswa.2012.12.077","volume":"40","author":"U Redmond","year":"2013","unstructured":"Redmond U, Cunningham P (2013) A temporal network analysis reveals the unprofitability of arbitrage in the Prosper Marketplace. Expert Syst Appl 40(9):3715\u20133721. https:\/\/doi.org\/10.1016\/j.eswa.2012.12.077","journal-title":"Expert Syst Appl"},{"key":"787_CR52","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1109\/ICCEE.2009.241","volume-title":"The semantic web\u2014ISWC","author":"M Richardson","year":"2003","unstructured":"Richardson M, Agrawal R, Pedro D (2003) Trust management for the semantic web. In: Fensel D, Sycara K, Mylopoulos J (eds) The semantic web\u2014ISWC. Springer, Berlin, pp 351\u2013368. https:\/\/doi.org\/10.1109\/ICCEE.2009.241"},{"issue":"1","key":"787_CR53","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s13278-020-00674-3","volume":"10","author":"M Romero","year":"2020","unstructured":"Romero M, Finke J, Rocha C, Tob\u00f3n L (2020) Spectral evolution with approximated eigenvalue trajectories for link prediction. Soc Netw Anal Min 10(1):60. https:\/\/doi.org\/10.1007\/s13278-020-00674-3","journal-title":"Soc Netw Anal Min"},{"issue":"16","key":"787_CR54","doi-asserted-by":"publisher","first-page":"6652","DOI":"10.1016\/j.eswa.2013.06.016","volume":"40","author":"PR Soares","year":"2013","unstructured":"Soares PR, Prud\u00eancio RB (2013) Proximity measures for link prediction based on temporal events. Expert Syst Appl 40(16):6652\u20136660. https:\/\/doi.org\/10.1016\/j.eswa.2013.06.016","journal-title":"Expert Syst Appl"},{"key":"787_CR55","doi-asserted-by":"publisher","unstructured":"Takes FW, Kosters WA (2011) Determining the diameter of small world networks. In: Proceedings of the 20th ACM international conference on Information and knowledge management. Association for Computing Machinery, New York, pp 1191\u20131196. https:\/\/doi.org\/10.1145\/2063576.2063748","DOI":"10.1145\/2063576.2063748"},{"key":"787_CR56","doi-asserted-by":"publisher","unstructured":"Tylenda T, Angelova R, Bedathur S (2009) Towards time-aware link prediction in evolving social networks. In: Proceedings of the 3rd workshop on social network mining and analysis, vol 9. Association for Computing Machinery, New York, pp 1\u201310. https:\/\/doi.org\/10.1145\/1731011.1731020","DOI":"10.1145\/1731011.1731020"},{"issue":"4","key":"787_CR57","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1140\/epjb\/e2010-00219-x","volume":"76","author":"P Van Mieghem","year":"2010","unstructured":"Van Mieghem P, Wang H, Ge X, Tang S, Kuipers FA (2010) Influence of assortativity and degree-preserving rewiring on the spectra of networks. Eur Phys J B 76(4):643\u2013652. https:\/\/doi.org\/10.1140\/epjb\/e2010-00219-x","journal-title":"Eur Phys J B"},{"key":"787_CR58","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"Virtanen P, Gommers R, Oliphant TE, Haberland M, Reddy T, Cournapeau D, Burovski E, Peterson P, Weckesser W, Bright J, van der Walt SJ, Brett M, Wilson J, Millman KJ, Mayorov N, Nelson ARJ, Jones E, Kern R, Larson E, Carey CJ, Polat I, Feng Y, Moore EW, VanderPlas J, Laxalde D, Perktold J, Cimrman R, Henriksen I, Quintero EA, Harris CR, Archibald AM, Ribeiro AH, Pedregosa F, van Mulbregt P (2020) SciPy 1.0 Contributors: SciPy 1.0: fundamental algorithms for scientific computing in python. Nat Methods 17:261\u2013272. https:\/\/doi.org\/10.1038\/s41592-019-0686-2","journal-title":"Nat Methods"},{"key":"787_CR59","doi-asserted-by":"publisher","unstructured":"Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in Facebook. In: Proceedings of the 2nd ACM workshop on Online social networks. Association for Computing Machinery, New York, pp 37\u201342. https:\/\/doi.org\/10.1145\/1592665.1592675","DOI":"10.1145\/1592665.1592675"},{"key":"787_CR60","unstructured":"Wikileaks (2016) US Democratic National Committee leak. https:\/\/www.wikileaks.org\/dnc-emails\/"},{"key":"787_CR61","doi-asserted-by":"publisher","unstructured":"Yin H, Benson AR, Leskovec J, Gleich DF (2017) Local higher-order graph clustering. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining, pp 555\u2013564. https:\/\/doi.org\/10.1145\/3097983.3098069","DOI":"10.1145\/3097983.3098069"},{"key":"787_CR62","doi-asserted-by":"publisher","unstructured":"Zhuang H, Sun Y, Tang J, Zhang J, Sun X (2013) Influence maximization in dynamic social networks. In: 13th International conference on data mining. IEEE, Dallas, pp 1313\u20131318. https:\/\/doi.org\/10.1109\/ICDM.2013.145","DOI":"10.1109\/ICDM.2013.145"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00787-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-021-00787-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00787-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T14:31:12Z","timestamp":1637418672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-021-00787-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,24]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["787"],"URL":"https:\/\/doi.org\/10.1007\/s13278-021-00787-3","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2021,8,24]]},"assertion":[{"value":"23 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"80"}}