{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T12:20:00Z","timestamp":1783340400985,"version":"3.54.6"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"crossref","award":["ANR-19-CE46-0008-01"],"award-info":[{"award-number":["ANR-19-CE46-0008-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100007364","name":"Fondazione CRT","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100007364","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EPJ Data Sci."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Low-dimensional vector representations of network nodes have proven successful to feed graph data to machine learning algorithms and to improve performance across diverse tasks. Most of the embedding techniques, however, have been developed with the goal of achieving dense, low-dimensional encoding of network structure and patterns. Here, we present a node embedding technique aimed at providing low-dimensional feature vectors that are informative of dynamical processes occurring over temporal networks \u2013 rather than of the network structure itself \u2013 with the goal of enabling prediction tasks related to the evolution and outcome of these processes. We achieve this by using a lossless modified supra-adjacency representation of temporal networks and building on standard embedding techniques for static graphs based on random walks. We show that the resulting embedding vectors are useful for prediction tasks related to paradigmatic dynamical processes, namely epidemic spreading over empirical temporal networks. In particular, we illustrate the performance of our approach for the prediction of nodes\u2019 epidemic states in single instances of a spreading process. We show how framing this task as a supervised multi-label classification task on the embedding vectors allows us to estimate the temporal evolution of the entire system from a partial sampling of nodes at random times, with potential impact for nowcasting infectious disease dynamics.<\/jats:p>","DOI":"10.1140\/epjds\/s13688-021-00277-8","type":"journal-article","created":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T14:38:32Z","timestamp":1620052712000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Predicting partially observed processes on temporal networks by Dynamics-Aware Node Embeddings (DyANE)"],"prefix":"10.1140","volume":"10","author":[{"given":"Koya","family":"Sato","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mizuki","family":"Oka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8683-269X","authenticated-orcid":false,"given":"Alain","family":"Barrat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ciro","family":"Cattuto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,5,1]]},"reference":[{"issue":"1","key":"277_CR1","doi-asserted-by":"publisher","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":"2","key":"277_CR2","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"},{"key":"277_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791383","volume-title":"Dynamical processes on complex networks","author":"A Barrat","year":"2008","unstructured":"Barrat A, Barth\u00e9lemy M, Vespignani A (2008) Dynamical processes on complex networks. Cambridge University Press, Cambridge"},{"issue":"3","key":"277_CR4","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.87.925","volume":"87","author":"R Pastor-Satorras","year":"2015","unstructured":"Pastor-Satorras R, Castellano C, Van Mieghem P, Vespignani A (2015) Epidemic processes in complex networks. Rev Mod Phys 87(3):925","journal-title":"Rev Mod Phys"},{"key":"277_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:97\u2013125","journal-title":"Phys Rep"},{"issue":"9","key":"277_CR6","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2015-60657-4","volume":"88","author":"P Holme","year":"2015","unstructured":"Holme P (2015) Modern temporal network theory: a colloquium. Eur Phys J B 88(9):234","journal-title":"Eur Phys J B"},{"key":"277_CR7","first-page":"415","volume-title":"SDM","author":"S Sundareisan","year":"2015","unstructured":"Sundareisan S, Vreeken J, Prakash BA (2015) Hidden hazards: finding missing nodes in large graph epidemics. In: SDM, pp\u00a0415\u2013423"},{"key":"277_CR8","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1109\/ICDM.2018.00079","volume-title":"ICDM","author":"H Xiao","year":"2018","unstructured":"Xiao H, Aslay C, Gionis A (2018) Robust cascade reconstruction by Steiner tree sampling. In: ICDM, pp\u00a0637\u2013646. https:\/\/doi.org\/10.1109\/ICDM.2018.00079"},{"issue":"2","key":"277_CR9","first-page":"403","volume":"49","author":"E Sefer","year":"2016","unstructured":"Sefer E, Kingsford C (2016) Diffusion archeology for diffusion progression history reconstruction. KAIS 49(2):403\u2013427","journal-title":"KAIS"},{"issue":"3","key":"277_CR10","first-page":"402","volume":"6","author":"S Feizi","year":"2018","unstructured":"Feizi S, Medard M, Quon G, Kellis M, Duffy K (2018) Network infusion to infer information sources in networks. IEEE TNSE 6(3):402\u2013417","journal-title":"IEEE TNSE"},{"key":"277_CR11","first-page":"1","volume-title":"IEEE TKDE","author":"Z Chen","year":"2019","unstructured":"Chen Z, Tong H, Ying L (2019) Inferring full diffusion history from partial timestamps. In: IEEE TKDE, p\u00a01"},{"issue":"10","key":"277_CR12","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2014\/10\/P10016","volume":"2014","author":"F Altarelli","year":"2014","unstructured":"Altarelli F, Braunstein A, Dall\u2019Asta F, Ingrosso A, Zecchina R (2014) The patient-zero problem with noisy observations. J Stat Mech Theory Exp 2014(10):10016","journal-title":"J Stat Mech Theory Exp"},{"key":"277_CR13","doi-asserted-by":"publisher","first-page":"1835","DOI":"10.1145\/2939672.2939865","volume-title":"KDD","author":"P Rozenshtein","year":"2016","unstructured":"Rozenshtein P, Gionis A, Prakash BA, Vreeken J (2016) Reconstructing an epidemic over time. In: KDD, pp\u00a01835\u20131844"},{"key":"277_CR14","first-page":"666","volume-title":"SDM","author":"H Xiao","year":"2018","unstructured":"Xiao H, Rozenshtein P, Tatti N, Gionis A (2018) Reconstructing a cascade from temporal observations. In: SDM, pp\u00a0666\u2013674"},{"issue":"9","key":"277_CR15","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 (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":"277_CR16","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"},{"key":"277_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.06.024","author":"P Goyal","year":"2019","unstructured":"Goyal P, Chhetri SR, Canedo A (2019) dyngraph2vec: capturing network dynamics using dynamic graph representation learning. Knowl-Based Syst. https:\/\/doi.org\/10.1016\/j.knosys.2019.06.024","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"277_CR18","doi-asserted-by":"publisher","DOI":"10.1140\/epjds4","volume":"1","author":"G Krings","year":"2012","unstructured":"Krings G, Karsai M, Bernhardsson S, Blondel VD, Saram\u00e4ki J (2012) Effects of time window size and placement on the structure of an aggregated communication network. EPJ Data Sci 1(1):4","journal-title":"EPJ Data Sci"},{"issue":"7","key":"277_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pcbi.1003142","volume":"9","author":"P Holme","year":"2013","unstructured":"Holme P (2013) Epidemiologically optimal static networks from temporal network data. PLoS Comput Biol 9(7):1\u201310. https:\/\/doi.org\/10.1371\/journal.pcbi.1003142","journal-title":"PLoS Comput Biol"},{"key":"277_CR20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.110.198701","volume":"110","author":"R Pfitzner","year":"2013","unstructured":"Pfitzner R, Scholtes I, Garas A, Tessone CJ, Schweitzer F (2013) Betweenness preference: quantifying correlations in the topological dynamics of temporal networks. Phys Rev Lett 110:198701. https:\/\/doi.org\/10.1103\/PhysRevLett.110.198701","journal-title":"Phys Rev Lett"},{"issue":"3","key":"277_CR21","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2016-60663-0","volume":"89","author":"I Scholtes","year":"2016","unstructured":"Scholtes I, Wider N, Garas A (2016) Higher-order aggregate networks in the analysis of temporal networks: path structures and centralities. Eur Phys J B 89(3):61","journal-title":"Eur Phys J B"},{"issue":"4","key":"277_CR22","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1038\/s41567-019-0459-y","volume":"15","author":"R Lambiotte","year":"2019","unstructured":"Lambiotte R, Rosvall M, Scholtes I (2019) From networks to optimal higher-order models of complex systems. Nat Phys 15(4):313\u2013320. https:\/\/doi.org\/10.1038\/s41567-019-0459-y","journal-title":"Nat Phys"},{"key":"277_CR23","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.5.021005","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:021005. https:\/\/doi.org\/10.1103\/PhysRevX.5.021005","journal-title":"Phys Rev X"},{"issue":"1","key":"277_CR24","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-018-29577-2","volume":"8","author":"M Kivel\u00e4","year":"2018","unstructured":"Kivel\u00e4 M, Cambe J, Saram\u00e4ki J, Karsai M (2018) Mapping temporal-network percolation to weighted, static event graphs. Sci Rep 8(1):12357","journal-title":"Sci Rep"},{"key":"277_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.101.052303","volume":"101","author":"A Badie-Modiri","year":"2020","unstructured":"Badie-Modiri A, Karsai M, Kivel\u00e4 M (2020) Efficient limited-time reachability estimation in temporal networks. Phys Rev E 101:052303. https:\/\/doi.org\/10.1103\/PhysRevE.101.052303","journal-title":"Phys Rev E"},{"key":"277_CR26","first-page":"701","volume-title":"KDD","author":"B Perozzi","year":"2014","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: KDD, pp\u00a0701\u2013710"},{"key":"277_CR27","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1145\/2939672.2939754","volume-title":"KDD","author":"A Grover","year":"2016","unstructured":"Grover A, Leskovec J (2016) Node2vec: scalable feature learning for networks. In: KDD, pp\u00a0855\u2013864"},{"key":"277_CR28","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1103\/RevModPhys.81.591","volume":"81","author":"C Castellano","year":"2009","unstructured":"Castellano C, Fortunato S, Loreto V (2009) Statistical physics of social dynamics. Rev Mod Phys 81:591\u2013646","journal-title":"Rev Mod Phys"},{"key":"277_CR29","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841035","volume-title":"Modeling infectious diseases in humans and animals","author":"MJ Keeling","year":"2008","unstructured":"Keeling MJ, Rohani P (2008) Modeling infectious diseases in humans and animals. Princeton University Press, Princeton"},{"key":"277_CR30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.110.028701","volume":"110","author":"S G\u00f3mez","year":"2013","unstructured":"G\u00f3mez S, D\u00edaz-Guilera A, G\u00f3mez-Garde\u00f1es J, P\u00e9rez-Vicente CJ, Moreno Y, Arenas A (2013) Diffusion dynamics on multiplex networks. Phys Rev Lett 110:028701. https:\/\/doi.org\/10.1103\/PhysRevLett.110.028701","journal-title":"Phys Rev Lett"},{"issue":"3","key":"277_CR31","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1093\/comnet\/cnu016","volume":"2","author":"M Kivel\u00e4","year":"2014","unstructured":"Kivel\u00e4 M, Arenas A, Barthelemy M, Gleeson JP, Moreno Y, Porter MA (2014) Multilayer networks. J Complex Netw 2(3):203\u2013271","journal-title":"J Complex Netw"},{"key":"277_CR32","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1145\/2736277.2741093","volume-title":"WWW","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: WWW, pp\u00a01067\u20131077"},{"key":"277_CR33","volume-title":"AAAI","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: AAAI"},{"key":"277_CR34","unstructured":"Goyal P, Kamra N, He X, Liu Y (2018) Dyngem: deep embedding method for dynamic graphs. Preprint. arXiv:1805.11273"},{"issue":"1","key":"277_CR35","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"},{"issue":"7","key":"277_CR36","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, Vespignani A (2010) Dynamics of person-to-person interactions from distributed rfid sensor networks. PLoS ONE 5(7):11596","journal-title":"PLoS ONE"},{"issue":"1","key":"277_CR37","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"},{"key":"277_CR38","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 \u00c9 (2011) Scikit-learn: machine learning in Python. J Mach Learn Res 12:2825\u20132830","journal-title":"J Mach Learn Res"}],"container-title":["EPJ Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-021-00277-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1140\/epjds\/s13688-021-00277-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-021-00277-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T04:03:01Z","timestamp":1626840181000},"score":1,"resource":{"primary":{"URL":"https:\/\/epjdatascience.springeropen.com\/articles\/10.1140\/epjds\/s13688-021-00277-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,1]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["277"],"URL":"https:\/\/doi.org\/10.1140\/epjds\/s13688-021-00277-8","relation":{},"ISSN":["2193-1127"],"issn-type":[{"value":"2193-1127","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,1]]},"assertion":[{"value":"25 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"22"}}