{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T05:13:53Z","timestamp":1783574033488,"version":"3.55.0"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T00:00:00Z","timestamp":1653696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T00:00:00Z","timestamp":1653696000000},"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":["EPJ Data Sci."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Representation learning models for graphs are a successful family of techniques that project nodes into feature spaces that can be exploited by other machine learning algorithms. Since many real-world networks are inherently dynamic, with interactions among nodes changing over time, these techniques can be defined both for static and for time-varying graphs. Here, we show how the skip-gram embedding approach can be generalized to perform implicit tensor factorization on different tensor representations of time-varying graphs. We show that higher-order skip-gram with negative sampling (HOSGNS) is able to disentangle the role of nodes and time, with a small fraction of the number of parameters needed by other approaches. We empirically evaluate our approach using time-resolved face-to-face proximity data, showing that the learned representations outperform state-of-the-art methods when used to solve downstream tasks such as network reconstruction. Good performance on predicting the outcome of dynamical processes such as disease spreading shows the potential of this method to estimate contagion risk, providing early risk awareness based on contact tracing data.<\/jats:p>","DOI":"10.1140\/epjds\/s13688-022-00344-8","type":"journal-article","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T12:02:42Z","timestamp":1653739362000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Time-varying graph representation learning via higher-order skip-gram with negative sampling"],"prefix":"10.1140","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9710-6255","authenticated-orcid":false,"given":"Simone","family":"Piaggesi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3336-0374","authenticated-orcid":false,"given":"Andr\u00e9","family":"Panisson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,5,28]]},"reference":[{"issue":"2","key":"344_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman ME (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"issue":"1","key":"344_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si A-L (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47","journal-title":"Rev Mod Phys"},{"issue":"9","key":"344_CR3","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 KC-C (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":"344_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal P, Ferrara E (2018) Graph embedding techniques, applications, and performance: a survey. Knowl-Based Syst 151:78\u201394","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"344_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme P, Saram\u00e4ki J (2012) Temporal networks. Phys Rep 519(3):97\u2013125","journal-title":"Phys Rep"},{"issue":"5","key":"344_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts A, Flocchini P, Quattrociocchi W, Santoro N (2012) Time-varying graphs and dynamic networks. Int J Parallel Emerg Distrib Syst 27(5):387\u2013408","journal-title":"Int J Parallel Emerg Distrib Syst"},{"key":"344_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791383","volume-title":"Dynamical processes on complex networks","author":"A Barrat","year":"2008","unstructured":"Barrat A, Barthelemy M, Vespignani A (2008) Dynamical processes on complex networks. Cambridge University Press, Cambridge"},{"issue":"1","key":"344_CR8","doi-asserted-by":"publisher","DOI":"10.1140\/epjds\/s13688-021-00277-8","volume":"10","author":"K Sato","year":"2021","unstructured":"Sato K, Oka M, Barrat A, Cattuto C (2021) Predicting partially observed processes on temporal networks by dynamics-aware node embeddings (DyANE). EPJ Data Sci 10(1):22","journal-title":"EPJ Data Sci"},{"key":"344_CR9","unstructured":"Alsdurf H, Bengio Y, Deleu T, Gupta P, Ippolito D, Janda R, Jarvie M, Kolody T, Krastev S, Maharaj T et al (2020). Covi white paper. arXiv preprint. arXiv:2005.08502"},{"key":"344_CR10","volume-title":"Proceedings of the 16th international workshop on mining and learning with graphs (MLG)","author":"A Kapoor","year":"2020","unstructured":"Kapoor A, Ben X, Liu L, Perozzi B, Barnes M, Blais M, O\u2019Banion S (2020) Examining COVID-19 forecasting using spatio-temporal gnns. In: Proceedings of the 16th international workshop on mining and learning with graphs (MLG)"},{"issue":"4","key":"344_CR11","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1093\/jamia\/ocaa322","volume":"28","author":"J Gao","year":"2021","unstructured":"Gao J, Sharma R, Qian C, Glass LM, Spaeder J, Romberg J, Sun J, Xiao C (2021) Stan: spatio-temporal attention network for pandemic prediction using real-world evidence. J Am Med Inform Assoc 28(4):733\u2013743","journal-title":"J Am Med Inform Assoc"},{"key":"344_CR12","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1109\/ICDMW.2015.128","volume-title":"2015 IEEE international conference on data mining workshop (ICDMW)","author":"A Sapienza","year":"2015","unstructured":"Sapienza A, Panisson A, Wu J, Gauvin L, Cattuto C (2015) Detecting anomalies in time-varying networks using tensor decomposition. In: 2015 IEEE international conference on data mining workshop (ICDMW). IEEE, pp\u00a0516\u2013523"},{"issue":"1","key":"344_CR13","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0086028","volume":"9","author":"L Gauvin","year":"2014","unstructured":"Gauvin L, Panisson A, Cattuto C (2014) Detecting the community structure and activity patterns of temporal networks: a non-negative tensor factorization approach. PLoS ONE 9(1):86028","journal-title":"PLoS ONE"},{"issue":"3","key":"344_CR14","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1017\/nws.2015.10","volume":"3","author":"M G\u00e9nois","year":"2015","unstructured":"G\u00e9nois M, Vestergaard CL, Fournet J, Panisson A, Bonmarin I, Barrat A (2015) Data on face-to-face contacts in an office building suggest a low-cost vaccination strategy based on community linkers. Netw Sci 3(3):326\u2013347","journal-title":"Netw Sci"},{"key":"344_CR15","first-page":"2177","volume-title":"Advances in neural information processing systems","author":"O Levy","year":"2014","unstructured":"Levy O, Goldberg Y (2014) Neural word embedding as implicit matrix factorization. In: Advances in neural information processing systems, pp\u00a02177\u20132185"},{"key":"344_CR16","first-page":"3111","volume-title":"Advances in neural information processing systems","author":"T Mikolov","year":"2013","unstructured":"Mikolov T, Sutskever I, Chen K, Corrado GS, Dean J (2013) Distributed representations of words and phrases and their compositionality. In: Advances in neural information processing systems, pp\u00a03111\u20133119"},{"key":"344_CR17","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/2623330.2623732","volume-title":"Proc. of the 20th ACM SIGKDD int. conf. on knowledge discovery and data mining","author":"B Perozzi","year":"2014","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: Proc. of the 20th ACM SIGKDD int. conf. on knowledge discovery and data mining. ACM, New York, pp\u00a0701\u2013710"},{"key":"344_CR18","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1145\/2736277.2741093","volume-title":"Proceedings of the 24th international conference on world wide web","author":"J Tang","year":"2015","unstructured":"Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) Line: large-scale information network embedding. In: Proceedings of the 24th international conference on world wide web, pp\u00a01067\u20131077"},{"key":"344_CR19","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1145\/2939672.2939754","volume-title":"Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining","author":"A Grover","year":"2016","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\u00a0855\u2013864"},{"issue":"3","key":"344_CR20","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM Rev 51(3):455\u2013500","journal-title":"SIAM Rev"},{"key":"344_CR21","first-page":"2773","volume":"15","author":"A Anandkumar","year":"2014","unstructured":"Anandkumar A, Ge R, Hsu D, Kakade SM, Telgarsky M (2014) Tensor decompositions for learning latent variable models. J Mach Learn Res 15:2773\u20132832","journal-title":"J Mach Learn Res"},{"issue":"1","key":"344_CR22","first-page":"22","volume":"16","author":"KW Church","year":"1990","unstructured":"Church KW, Hanks P (1990) Word association norms, mutual information, and lexicography. Comput Linguist 16(1):22\u201329","journal-title":"Comput Linguist"},{"key":"344_CR23","doi-asserted-by":"publisher","first-page":"1666","DOI":"10.1145\/3394486.3403218","volume-title":"Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining","author":"Z Yang","year":"2020","unstructured":"Yang Z, Ding M, Zhou C, Yang H, Zhou J, Tang J (2020) Understanding negative sampling in graph representation learning. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp\u00a01666\u20131676"},{"key":"344_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1613\/jair.1.11368","volume":"66","author":"Z Assylbekov","year":"2019","unstructured":"Assylbekov Z, Takhanov R (2019) Context vectors are reflections of word vectors in half the dimensions. J Artif Intell Res 66:225\u2013242","journal-title":"J Artif Intell Res"},{"key":"344_CR25","first-page":"7465","volume-title":"Advances in neural information processing systems","author":"C Allen","year":"2019","unstructured":"Allen C, Balazevic I, Hospedales T (2019) What the vec? Towards probabilistically grounded embeddings. In: Advances in neural information processing systems, pp\u00a07465\u20137475"},{"key":"344_CR26","doi-asserted-by":"publisher","first-page":"167","DOI":"10.18653\/v1\/P17-2026","volume-title":"Proceedings of the 55th annual meeting of the association for computational linguistics (volume 2: short papers)","author":"O Melamud","year":"2017","unstructured":"Melamud O, Goldberger J (2017) Information-theory interpretation of the skip-gram negative-sampling objective function. In: Proceedings of the 55th annual meeting of the association for computational linguistics (volume 2: short papers), pp\u00a0167\u2013171"},{"key":"344_CR27","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1162\/tacl_a_00106","volume":"4","author":"S Arora","year":"2016","unstructured":"Arora S, Li Y, Liang Y, Ma T, Risteski A (2016) A latent variable model approach to pmi-based word embeddings. Trans Assoc Comput Linguist 4:385\u2013399","journal-title":"Trans Assoc Comput Linguist"},{"key":"344_CR28","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1145\/3159652.3159706","volume-title":"Proceedings of the eleventh ACM international conference on web search and data mining","author":"J Qiu","year":"2018","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. ACM, New York, pp\u00a0459\u2013467"},{"key":"344_CR29","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Representation learning on graphs: methods and applications. arXiv preprint. arXiv:1709.05584"},{"issue":"2","key":"344_CR30","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":"344_CR31","volume":"3","author":"M De Domenico","year":"2013","unstructured":"De Domenico M, Sol\u00e9-Ribalta A, Cozzo E, Kivel\u00e4 M, Moreno Y, Porter MA, G\u00f3mez S, Arenas A (2013) Mathematical formulation of multilayer networks. Phys Rev X 3(4):041022","journal-title":"Phys Rev X"},{"key":"344_CR32","first-page":"325","volume-title":"Supracentrality analysis of temporal networks with directed interlayer coupling","author":"D Taylor","year":"2019","unstructured":"Taylor D, Porter MA, Mucha PJ (2019) In: Holme P, Saram\u00e4ki J (eds) Supracentrality analysis of temporal networks with directed interlayer coupling. Springer, Cham, pp\u00a0325\u2013344"},{"issue":"2","key":"344_CR33","volume":"5","author":"E Valdano","year":"2015","unstructured":"Valdano E, Ferreri L, Poletto C, Colizza V (2015) Analytical computation of the epidemic threshold on temporal networks. Phys Rev X 5(2):021005","journal-title":"Phys Rev X"},{"issue":"70","key":"344_CR34","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":"1","key":"344_CR35","volume":"55","author":"CDT Barros","year":"2021","unstructured":"Barros CDT, Mendon\u00e7a MRF, Vieira AB, Ziviani A (2021) A survey on embedding dynamic graphs. ACM Comput Surv 55(1):10","journal-title":"ACM Comput Surv"},{"key":"344_CR36","volume-title":"IJCAI workshop on representation learning for graphs (ReLiG)","author":"P Goyal","year":"2017","unstructured":"Goyal P, Kamra N, He X, Liu Y (2017) Dyngem: deep embedding method for dynamic graphs. In: IJCAI workshop on representation learning for graphs (ReLiG)"},{"key":"344_CR37","volume-title":"Thirty-second AAAI conference on artificial intelligence","author":"Z Zhang","year":"2018","unstructured":"Zhang Z, Cui P, Pei J, Wang X, Zhu W (2018) TIMERS: error-bounded SVD restart on dynamic networks. In: Thirty-second AAAI conference on artificial intelligence"},{"key":"344_CR38","first-page":"2086","volume-title":"IJCAI","author":"L Du","year":"2018","unstructured":"Du L, Wang Y, Song G, Lu Z, Wang J (2018) Dynamic network embedding: an extended approach for skip-gram based network embedding. In: IJCAI, pp\u00a02086\u20132092"},{"issue":"10","key":"344_CR39","first-page":"1","volume":"63","author":"H Peng","year":"2020","unstructured":"Peng H, Li J, Yan H, Gong Q, Wang S, Liu L, Wang L, Ren X (2020) Dynamic network embedding via incremental skip-gram with negative sampling. Sci China Inf Sci 63(10):1\u201319","journal-title":"Sci China Inf Sci"},{"issue":"1","key":"344_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0169-5","volume":"4","author":"F B\u00e9res","year":"2019","unstructured":"B\u00e9res F, Kelen DM, P\u00e1lovics R, Bencz\u00far AA (2019) Node embeddings in dynamic graphs. Appl Netw Sci 4(1):64","journal-title":"Appl Netw Sci"},{"key":"344_CR41","doi-asserted-by":"publisher","first-page":"3762","DOI":"10.1109\/BigData.2018.8621910","volume-title":"2018 IEEE international conference on big data (big data)","author":"S Mahdavi","year":"2018","unstructured":"Mahdavi S, Khoshraftar S, An A (2018) dynnode2vec: scalable dynamic network embedding. In: 2018 IEEE international conference on big data (big data). IEEE, pp\u00a03762\u20133765"},{"key":"344_CR42","doi-asserted-by":"publisher","first-page":"2672","DOI":"10.1145\/3219819.3220024","volume-title":"Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining","author":"W Yu","year":"2018","unstructured":"Yu W, Cheng W, Aggarwal CC, Zhang K, Chen H, Wang W (2018) Netwalk: a flexible deep embedding approach for anomaly detection in dynamic networks. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp\u00a02672\u20132681"},{"key":"344_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.06.024","volume":"187","author":"P Goyal","year":"2020","unstructured":"Goyal P, Chhetri SR, Canedo A (2020) dyngraph2vec: capturing network dynamics using dynamic graph representation learning. Knowl-Based Syst 187:104816","journal-title":"Knowl-Based Syst"},{"key":"344_CR44","doi-asserted-by":"publisher","first-page":"29219","DOI":"10.1109\/ACCESS.2018.2839770","volume":"6","author":"T Li","year":"2018","unstructured":"Li T, Zhang J, Philip SY, Zhang Y, Yan Y (2018) Deep dynamic network embedding for link prediction. IEEE Access 6:29219\u201329230","journal-title":"IEEE Access"},{"key":"344_CR45","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/3336191.3371845","volume-title":"Proceedings of the 13th international conference on web search and data mining","author":"A Sankar","year":"2020","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\u00a0519\u2013527"},{"key":"344_CR46","volume-title":"International conference on learning representations","author":"D Xu","year":"2020","unstructured":"Xu D, Ruan C, Korpeoglu E, Kumar S, Achan K (2020) Inductive representation learning on temporal graphs. In: International conference on learning representations"},{"key":"344_CR47","volume-title":"Thirty-second AAAI conference on artificial intelligence","author":"L Zhou","year":"2018","unstructured":"Zhou L, Yang Y, Ren X, Wu F, Zhuang Y (2018) Dynamic network embedding by modeling triadic closure process. In: Thirty-second AAAI conference on artificial intelligence"},{"issue":"10","key":"344_CR48","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, Ver Steeg G, 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":"1","key":"344_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-020-63221-2","volume":"10","author":"M Torricelli","year":"2020","unstructured":"Torricelli M, Karsai M, Gauvin L (2020) weg2vec: event embedding for temporal networks. Sci Rep 10(1):1\u201311","journal-title":"Sci Rep"},{"key":"344_CR50","first-page":"969","volume-title":"Companion proceedings of the web conference 2018","author":"GH Nguyen","year":"2018","unstructured":"Nguyen GH, Lee JB, Rossi RA, Ahmed NK, Koh E, Kim S (2018) Continuous-time dynamic network embeddings. In: Companion proceedings of the web conference 2018, pp\u00a0969\u2013976"},{"issue":"1","key":"344_CR51","doi-asserted-by":"publisher","DOI":"10.1140\/epjds\/s13688-020-00248-5","volume":"9","author":"X-X Zhan","year":"2020","unstructured":"Zhan X-X, Li Z, Masuda N, Holme P, Wang H (2020) Susceptible-infected-spreading-based network embedding in static and temporal networks. EPJ Data Sci 9(1):30","journal-title":"EPJ Data Sci"},{"key":"344_CR52","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1145\/3292500.3330895","volume-title":"Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining","author":"S Kumar","year":"2019","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 & data mining, pp\u00a01269\u20131278"},{"key":"344_CR53","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1137\/1.9781611976700.82","volume-title":"Proceedings of the 2021 SIAM international conference on data mining (SDM)","author":"OA Malik","year":"2021","unstructured":"Malik OA, Ubaru S, Horesh L, Kilmer ME, Avron H (2021) Dynamic graph convolutional networks using the tensor m-product. In: Proceedings of the 2021 SIAM international conference on data mining (SDM). SIAM, Philadelphia, pp\u00a0729\u2013737"},{"key":"344_CR54","first-page":"1003","volume-title":"Proceedings of the 2018 world wide web conference","author":"M Rudolph","year":"2018","unstructured":"Rudolph M, Blei D (2018) Dynamic embeddings for language evolution. In: Proceedings of the 2018 world wide web conference, pp\u00a01003\u20131011"},{"key":"344_CR55","volume-title":"Twenty-fourth international joint conference on artificial intelligence","author":"P Liu","year":"2015","unstructured":"Liu P, Qiu X, Huang X (2015) Learning context-sensitive word embeddings with neural tensor skip-gram model. In: Twenty-fourth international joint conference on artificial intelligence"},{"key":"344_CR56","first-page":"175","volume-title":"Proceedings of the 15th conference of the European chapter of the association for computational linguistics: volume 2, short papers","author":"R Cotterell","year":"2017","unstructured":"Cotterell R, Poliak A, Van Durme B, Eisner J (2017) Explaining and generalizing skip-gram through exponential family principal component analysis. In: Proceedings of the 15th conference of the European chapter of the association for computational linguistics: volume 2, short papers, pp\u00a0175\u2013181"},{"key":"344_CR57","first-page":"211","volume-title":"Proceedings of the 2010 SIAM international conference on data mining","author":"L Xiong","year":"2010","unstructured":"Xiong L, Chen X, Huang T-K, Schneider J, Carbonell JG (2010) Temporal collaborative filtering with Bayesian probabilistic tensor factorization. In: Proceedings of the 2010 SIAM international conference on data mining. SIAM, Philadelphia, pp\u00a0211\u2013222"},{"key":"344_CR58","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1145\/3289600.3290998","volume-title":"Proc. of the twelfth ACM int. conf. on web search and data mining","author":"X Wu","year":"2019","unstructured":"Wu X, Shi B, Dong Y, Huang C, Chawla NV (2019) Neural tensor factorization for temporal interaction learning. In: Proc. of the twelfth ACM int. conf. on web search and data mining, pp\u00a0537\u2013545"},{"key":"344_CR59","volume-title":"International conference on learning representations","author":"T Lacroix","year":"2020","unstructured":"Lacroix T, Obozinski G, Usunier N (2020) Tensor decompositions for temporal knowledge base completion. In: International conference on learning representations"},{"key":"344_CR60","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2018.12.008","volume":"59","author":"Y Ma","year":"2019","unstructured":"Ma Y, Tresp V, Daxberger EA (2019) Embedding models for episodic knowledge graphs. J Web Semant 59:100490","journal-title":"J Web Semant"},{"key":"344_CR61","volume-title":"Advances in neural information processing systems","author":"S Chanpuriya","year":"2020","unstructured":"Chanpuriya S, Musco C, Sotiropoulos K, Tsourakakis C (2020) Node embeddings and exact low-rank representations of complex networks. In: Advances in neural information processing systems, vol\u00a033"},{"key":"344_CR62","first-page":"1473","volume-title":"Proceedings of the 38th international conference on machine learning","author":"S Chanpuriya","year":"2021","unstructured":"Chanpuriya S, Musco C, Sotiropoulos K, Tsourakakis C (2021) Deepwalking backwards: from embeddings back to graphs. In: Meila M, Zhang T (eds) Proceedings of the 38th international conference on machine learning, vol\u00a0139, pp\u00a01473\u20131483"},{"issue":"7","key":"344_CR63","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0011596","volume":"5","author":"C Cattuto","year":"2010","unstructured":"Cattuto C, Van den Broeck W, Barrat A, Colizza V, Pinton J-F, Vespignani A (2010) Dynamics of person-to-person interactions from distributed rfid sensor networks. PLoS ONE 5(7):e11596","journal-title":"PLoS ONE"},{"issue":"1","key":"344_CR64","doi-asserted-by":"publisher","DOI":"10.1140\/epjds\/s13688-018-0140-1","volume":"7","author":"M G\u00e9nois","year":"2018","unstructured":"G\u00e9nois M, Barrat A (2018) Can co-location be used as a proxy for face-to-face contacts? EPJ Data Sci 7(1):11","journal-title":"EPJ Data Sci"},{"issue":"7","key":"344_CR65","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1009146","volume":"17","author":"R Hinch","year":"2021","unstructured":"Hinch R, Probert WJ, Nurtay A, Kendall M, Wymant C, Hall M, Lythgoe K, Bulas Cruz A, Zhao L, Stewart A et al. (2021) Openabm-COVID19\u2014an agent-based model for non-pharmaceutical interventions against COVID-19 including contact tracing. PLoS Comput Biol 17(7):1009146","journal-title":"PLoS Comput Biol"},{"key":"344_CR66","first-page":"539","volume-title":"Proceedings of the 2018 world wide web conference","author":"A Tsitsulin","year":"2018","unstructured":"Tsitsulin A, Mottin D, Karras P, M\u00fcller E (2018) Verse: versatile graph embeddings from similarity measures. In: Proceedings of the 2018 world wide web conference, pp\u00a0539\u2013548"},{"key":"344_CR67","doi-asserted-by":"crossref","unstructured":"McInnes L, Healy J, Melville J (2018) Umap: uniform manifold approximation and projection for dimension reduction. arXiv preprint. arXiv:1802.03426","DOI":"10.21105\/joss.00861"},{"issue":"8","key":"344_CR68","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0023176","volume":"6","author":"J Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9 J, Voirin N, Barrat A, Cattuto C, Isella L, Pinton J-F, Quaggiotto M, Van den Broeck W, R\u00e9gis C, Lina B et al. (2011) High-resolution measurements of face-to-face contact patterns in a primary school. PLoS ONE 6(8):e23176","journal-title":"PLoS ONE"},{"issue":"6","key":"344_CR69","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1140\/epjst\/e2013-01927-7","volume":"222","author":"A Barrat","year":"2013","unstructured":"Barrat A, Cattuto C, Colizza V, Gesualdo F, Isella L, Pandolfi E, Pinton J-F, Rav\u00e0 L, Rizzo C, Romano M, Stehl\u00e9 J, Tozzi AE, Van den Broeck W (2013) Empirical temporal networks of face-to-face human interactions. Eur Phys J Spec Top 222(6):1295\u20131309","journal-title":"Eur Phys J Spec Top"},{"issue":"5","key":"344_CR70","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.056115","volume":"85","author":"M Starnini","year":"2012","unstructured":"Starnini M, Baronchelli A, Barrat A, Pastor-Satorras R (2012) Random walks on temporal networks. Phys Rev E 85(5):056115","journal-title":"Phys Rev E"},{"key":"344_CR71","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1109\/PerComW.2013.6529492","volume-title":"2013 IEEE international conference on pervasive computing and communications workshops (PERCOM workshops)","author":"A Panisson","year":"2013","unstructured":"Panisson A, Gauvin L, Barrat A, Cattuto C (2013) Fingerprinting temporal networks of close-range human proximity. In: 2013 IEEE international conference on pervasive computing and communications workshops (PERCOM workshops). IEEE, pp\u00a0261\u2013266"},{"issue":"1","key":"344_CR72","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.98.012317","volume":"98","author":"A Sapienza","year":"2018","unstructured":"Sapienza A, Barrat A, Cattuto C, Gauvin L (2018) Estimating the outcome of spreading processes on networks with incomplete information: a dimensionality reduction approach. Phys Rev E 98(1):012317","journal-title":"Phys Rev E"},{"key":"344_CR73","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/3269206.3271767","volume-title":"Proceedings of the 27th ACM international conference on information and knowledge management","author":"E Galimberti","year":"2018","unstructured":"Galimberti E, Barrat A, Bonchi F, Cattuto C, Gullo F (2018) Mining (maximal) span-cores from temporal networks. In: Proceedings of the 27th ACM international conference on information and knowledge management, pp\u00a0107\u2013116"}],"container-title":["EPJ Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-022-00344-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1140\/epjds\/s13688-022-00344-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-022-00344-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T13:06:09Z","timestamp":1653743169000},"score":1,"resource":{"primary":{"URL":"https:\/\/epjdatascience.springeropen.com\/articles\/10.1140\/epjds\/s13688-022-00344-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,28]]},"references-count":73,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["344"],"URL":"https:\/\/doi.org\/10.1140\/epjds\/s13688-022-00344-8","relation":{},"ISSN":["2193-1127"],"issn-type":[{"value":"2193-1127","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,28]]},"assertion":[{"value":"11 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"33"}}