Skip to main content

2023 | OriginalPaper | Buchkapitel

Memory Based Temporal Network Prediction

verfasst von : Li Zou, An Wang, Huijuan Wang

Erschienen in: Complex Networks and Their Applications XI

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Temporal networks are networks like physical contact networks whose topology changes over time. Predicting future temporal network is crucial e.g., to forecast and mitigate the spread of epidemics and misinformation on the network. Most existing methods for temporal network prediction are based on machine learning algorithms, at the expense of high computational costs and limited interpretation of the underlying mechanisms that form the networks. This motivates us to develop network-based models to predict the temporal network at the next time step based on the network observed in the past. Firstly, we investigate temporal network properties to motivate our network prediction models and to explain how the performance of these models depends on the temporal networks. We explore the similarity between the network topology (snapshot) at any two time steps with a given time lag/interval. We find that the similarity is relatively high when the time lag is small and decreases as the time lag increases. Inspired by such time-decaying memory of temporal networks and recent advances, we propose two models that predict a link’s future activity (i.e., connected or not), based on the past activities of the link itself or also of neighboring links, respectively. Via seven real-world physical contact networks, we find that our models outperform in both prediction quality and computational complexity, and predict better in networks that have a stronger memory. Beyond, our model also reveals how different types of neighboring links contribute to the prediction of a given link’s future activity, again depending on properties of temporal networks.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
The clustering coefficient of network is the probability that two neighbors of node are connected.
 
Literatur
1.
Zurück zum Zitat Holme, P., Saramäki, J.: Temporal networks. Phys. Rep. 519, 97–125 (2012)CrossRef Holme, P., Saramäki, J.: Temporal networks. Phys. Rep. 519, 97–125 (2012)CrossRef
2.
Zurück zum Zitat Masuda, N., Lambiotte, R.: A guide to temporal networks. In: Series on complexity science, vol. 4, pp. 252. World scientific, Europe (2016) Masuda, N., Lambiotte, R.: A guide to temporal networks. In: Series on complexity science, vol. 4, pp. 252. World scientific, Europe (2016)
3.
Zurück zum Zitat Masuda, N., Klemm, K., Eguíluz, V.M.: Temporal networks: slowing down diffusion by long lasting interactions. Phys. Rev. Lett. 111, 188701 (2013)CrossRef Masuda, N., Klemm, K., Eguíluz, V.M.: Temporal networks: slowing down diffusion by long lasting interactions. Phys. Rev. Lett. 111, 188701 (2013)CrossRef
4.
Zurück zum Zitat Delvenne, J.-C., Lambiotte, R., Rocha, L.E.C.: Diffusion on networked systems is a question of time or structure. Nat. Commun. 6, 7366 (2015)CrossRef Delvenne, J.-C., Lambiotte, R., Rocha, L.E.C.: Diffusion on networked systems is a question of time or structure. Nat. Commun. 6, 7366 (2015)CrossRef
5.
Zurück zum Zitat Peixoto, T., Rosvall, M.: Modelling sequences and temporal networks with dynamic community structures. Nat. Commun. 8, 582 (2017)CrossRef Peixoto, T., Rosvall, M.: Modelling sequences and temporal networks with dynamic community structures. Nat. Commun. 8, 582 (2017)CrossRef
6.
Zurück zum Zitat Zhan, X.-X., Hanjalic, A., Wang, H.: Information diffusion backbones in temporal networks. Sci. Rep. 9, 6798 (2019)CrossRef Zhan, X.-X., Hanjalic, A., Wang, H.: Information diffusion backbones in temporal networks. Sci. Rep. 9, 6798 (2019)CrossRef
7.
Zurück zum Zitat Lü, L., Medo, M., Yeung, C.H., Zhang, Y.-C., Zhang, Z.-K., Zhou, T.: Recommender systems. Phys. Rep. 519, 1–49 (2012)CrossRef Lü, L., Medo, M., Yeung, C.H., Zhang, Y.-C., Zhang, Z.-K., Zhou, T.: Recommender systems. Phys. Rep. 519, 1–49 (2012)CrossRef
8.
Zurück zum Zitat Aleta, A., Tuninetti, M., Paolotti, D., Moreno, Y., Starnini, M.: Link prediction in multiplex networks via triadic closure. Phys. Rev. Res. 2, 042029 (2020)CrossRef Aleta, A., Tuninetti, M., Paolotti, D., Moreno, Y., Starnini, M.: Link prediction in multiplex networks via triadic closure. Phys. Rev. Res. 2, 042029 (2020)CrossRef
9.
Zurück zum Zitat Zhou, L., Yang, Y., Ren, X., Wu, F., Zhuang, Y.: Dynamic network embedding by modeling triadic closure process. In: 32nd AAAI Conference on Artificial Intelligence, pp. 571-578. AAAI Press, California USA (2018) Zhou, L., Yang, Y., Ren, X., Wu, F., Zhuang, Y.: Dynamic network embedding by modeling triadic closure process. In: 32nd AAAI Conference on Artificial Intelligence, pp. 571-578. AAAI Press, California USA (2018)
10.
Zurück zum Zitat Rahman, M. Saha, T.K., Hasan, M.A., Xu, K.S., Reddy, C.K.: DyLink2Vec: Effective Feature Representation for Link Prediction in Dynamic Networks (2018) Rahman, M. Saha, T.K., Hasan, M.A., Xu, K.S., Reddy, C.K.: DyLink2Vec: Effective Feature Representation for Link Prediction in Dynamic Networks (2018)
11.
Zurück zum Zitat Zhan, X.-X., Li, Z., Masuda, N., Holme, P., Wang, H.: Susceptible-infected-spreading-based network embedding in static and temporal networks. EPJ Data Sci. 9, 30 (2020)CrossRef Zhan, X.-X., Li, Z., Masuda, N., Holme, P., Wang, H.: Susceptible-infected-spreading-based network embedding in static and temporal networks. EPJ Data Sci. 9, 30 (2020)CrossRef
12.
Zurück zum Zitat Li, X., Du, N., Li, H., Li, K., Gao, J., Zhang, A.: A deep learning approach to link prediction in dynamic networks. In: 2014 SIAM International Conference on Data Mining, pp. 289-297 (2014) Li, X., Du, N., Li, H., Li, K., Gao, J., Zhang, A.: A deep learning approach to link prediction in dynamic networks. In: 2014 SIAM International Conference on Data Mining, pp. 289-297 (2014)
13.
Zurück zum Zitat Pareja, A., Domeniconi, G., Chen, J., Ma, T., Suzumura, T., Kanezashi, H., Kaler, T., Schardl, T.B., Leiserson, C.E.: EvolveGCN: evolving graph convolutional networks for dynamic graphs. In.: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 5363–5370. AAAI Press, California, USA (2020) Pareja, A., Domeniconi, G., Chen, J., Ma, T., Suzumura, T., Kanezashi, H., Kaler, T., Schardl, T.B., Leiserson, C.E.: EvolveGCN: evolving graph convolutional networks for dynamic graphs. In.: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 5363–5370. AAAI Press, California, USA (2020)
14.
Zurück zum Zitat Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: The Twelfth International Conference on Information and Knowledge Management, vol. 4, pp. 556–559. Association for Computing Machinery, New York (2003) Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: The Twelfth International Conference on Information and Knowledge Management, vol. 4, pp. 556–559. Association for Computing Machinery, New York (2003)
15.
Zurück zum Zitat Ahmed, N.M., Chen, L., Wang, Y., Li, B., Li, Y., Liu, W.: Sampling-based algorithm for link prediction in temporal networks. Inf. Sci. 374, 1–14 (2016)CrossRefMATH Ahmed, N.M., Chen, L., Wang, Y., Li, B., Li, Y., Liu, W.: Sampling-based algorithm for link prediction in temporal networks. Inf. Sci. 374, 1–14 (2016)CrossRefMATH
16.
Zurück zum Zitat Xu, H.H., Zhang, L.J.: Application of link prediction in temporal networks. Adv. Mater. Res. 2231, 756–759 (2013) Xu, H.H., Zhang, L.J.: Application of link prediction in temporal networks. Adv. Mater. Res. 2231, 756–759 (2013)
17.
Zurück zum Zitat Li, X., Liang, W., Zhang, X., Liu, X., Wu, W.: A universal method based on structure subgraph feature for link prediction over dynamic networks. In: 39th International Conference on Distributed Computing Systems, pp. 1210–1220. IEEE, Dallas, USA (2019) Li, X., Liang, W., Zhang, X., Liu, X., Wu, W.: A universal method based on structure subgraph feature for link prediction over dynamic networks. In: 39th International Conference on Distributed Computing Systems, pp. 1210–1220. IEEE, Dallas, USA (2019)
18.
Zurück zum Zitat Jo, H.-H., Perotti, J.I., Kaski, K., Kerteéz, J.: Correlated bursts and the role of memory range. Phys. Rev. E. 92, 022814 (2015)CrossRef Jo, H.-H., Perotti, J.I., Kaski, K., Kerteéz, J.: Correlated bursts and the role of memory range. Phys. Rev. E. 92, 022814 (2015)CrossRef
19.
Zurück zum Zitat Génois, M., Barrat, A.: Can co-location be used as a proxy for face-to-face contacts? EPJ Data Sci. 7, 11 (2018)CrossRef Génois, M., Barrat, A.: Can co-location be used as a proxy for face-to-face contacts? EPJ Data Sci. 7, 11 (2018)CrossRef
20.
Zurück zum Zitat Rossi, R.A., Ahmed, K.: The network data repository with interactive graph analytics and visualization. In: The Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 4292–4293. AAAI Press, Palo Alto, California (2015) Rossi, R.A., Ahmed, K.: The network data repository with interactive graph analytics and visualization. In: The Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 4292–4293. AAAI Press, Palo Alto, California (2015)
21.
Zurück zum Zitat Isella, L., Stehlé, J., Barrat, A., Cattuto, C., Pinton, J.-F., den Broeck, W.V.: What’s in a crowd? Analysis of face-to-face behavioral networks. J. Theor. Biol. 271, 166–180 (2011)CrossRefMATH Isella, L., Stehlé, J., Barrat, A., Cattuto, C., Pinton, J.-F., den Broeck, W.V.: What’s in a crowd? Analysis of face-to-face behavioral networks. J. Theor. Biol. 271, 166–180 (2011)CrossRefMATH
22.
Zurück zum Zitat Zou, L., Zhan, X.-X., Sun, J., Hanjalic, A., Wang, H.: Temporal network prediction and interpretation. IEEE Trans. Netw. Sci. Eng. 9, 1215–1224 (2022)CrossRef Zou, L., Zhan, X.-X., Sun, J., Hanjalic, A., Wang, H.: Temporal network prediction and interpretation. IEEE Trans. Netw. Sci. Eng. 9, 1215–1224 (2022)CrossRef
23.
Zurück zum Zitat Yu, W., Cheng, W., Aggarwal, C.C., Chen, H., Wang, W.: Link prediction with spatial and temporal consistency in dynamic networks. In: The Twenty-Sixth International Joint Conference on Artificial Intelligence, pp. 3343–3349. International Joint Conferences on Artificial Intelligence, Melbourne, Australia (2017) Yu, W., Cheng, W., Aggarwal, C.C., Chen, H., Wang, W.: Link prediction with spatial and temporal consistency in dynamic networks. In: The Twenty-Sixth International Joint Conference on Artificial Intelligence, pp. 3343–3349. International Joint Conferences on Artificial Intelligence, Melbourne, Australia (2017)
24.
Zurück zum Zitat Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: Tenth ACM International Conference on Web Search and Data Mining, pp. 601–610. Association for Computing Machinery, Cambridge, United Kingdom (2017) Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: Tenth ACM International Conference on Web Search and Data Mining, pp. 601–610. Association for Computing Machinery, Cambridge, United Kingdom (2017)
25.
Zurück zum Zitat Saramäki, J., Moro, E.: From seconds to months: an overview of multi-scale dynamics of mobile telephone calls. Eur. Phys. J. B. 88, 164 (2015)CrossRef Saramäki, J., Moro, E.: From seconds to months: an overview of multi-scale dynamics of mobile telephone calls. Eur. Phys. J. B. 88, 164 (2015)CrossRef
26.
Zurück zum Zitat Tibshirni, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Series B. 58, 267–88 (1996) Tibshirni, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Series B. 58, 267–88 (1996)
27.
Zurück zum Zitat Davis, J., Goadrich, M.: The relationship between precision-recall and ROC curves. In: The 23rd International Conference on Machine Learning, vol. 8, pp. 233–240. Association for Computing Machinery, New York, USA (2006) Davis, J., Goadrich, M.: The relationship between precision-recall and ROC curves. In: The 23rd International Conference on Machine Learning, vol. 8, pp. 233–240. Association for Computing Machinery, New York, USA (2006)
Metadaten
Titel
Memory Based Temporal Network Prediction
verfasst von
Li Zou
An Wang
Huijuan Wang
Copyright-Jahr
2023
DOI
https://doi.org/10.1007/978-3-031-21131-7_51

Premium Partner