Skip to main content
SpringerLink
Log in

TNSEIR: A SEIR pattern-based embedding approach for temporal network

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Network embedding defines a set of techniques for learning the vector representations of nodes and links, which accurately encode the network in a low-dimensional space for computational network analysis. The states of a network evolution are multiple containing link emergence and vanishing. However, determining the topological change caused by link vanishing in the dynamic environment is difficult because most temporal network embedding methods are restricted by learning frameworks. For example, embedding methods based on graph neural networks and matrix factorization handle only link emergences. To identify the structural changes caused by both link appearance and link vanishing, this paper introduces a temporal network embedding approach named TNSEIR inspired by classical susceptible-exposed-infectious-recovered (SEIR) model of infectious diseases, which exploits the information of network structure and temporal evolution. The structural change after link disappearance is represented as the ”recovered” state of SEIR. A new node pair connection (”infection”) probability function is proposed for capturing the information of neighboring nodes and the effect of macro-temporal factor. The macro-temporal factor specifies the topological structure of each network snapshot and the ”latency” information of node pairs, while ”latency” is derived from the ”exposed” state of SEIR. Through that, TNSEIR can accurately capture the long-distance connection trends of node pairs and thereby predict the evolution trend. Extensive experiments are performed on three real-world temporal networks. TNSEIR mechanism outperforms the state-of-the-art (SOTA) autonomous-modeling embedding methods on network analysis and network inference tasks. The strength of TNSEIR is distinctly evidenced by its large improvement on the Wikipedia network, which contains both link appearances and disappearances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Availability of data

The data sets, ”Wikipedia”, ”DBLP”, and ”Academic”, that support the findings of this study are available in/from ”http://konect.cc/networksnk-dynamic-simplewiki”, ”HTNE [13] repository”, and ”Arnetminer [33] repository”.

Notes

  1. http://konect.cc/networks/link-dynamic-simplewiki

References

  1. Cui P, Wang X, Pei J, Zhu W (2018) A survey on network embedding. IEEE Trans Knowl Data Eng 31(5):833–852

    Article  Google Scholar 

  2. Cui Z, Li Z, Wu S, Zhang X, Liu Q, Wang L, Ai M (2022) Dygcn: Efficient dynamic graph embedding with graph convolutional network. IEEE Trans Neural Netw Learn Syst 1–12

  3. 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–710

  4. 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 1067–1077

  5. Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: KDD: Proceedings international conference on knowledge discovery & data mining, vol 2016, pp 855–864

  6. Scarselli F, Gori M, Tsoi AC, Hagenbuchner M, Monfardini G (2008) The graph neural network model. IEEE Trans Neural Netw 20(1):61–80

    Article  Google Scholar 

  7. Veličković P, Cucurull G, Casanova A, Romero A, Liò P, Bengio Y (2018) Graph attention networks. In: International conference on learning representations

  8. Yin Z, Yue K (2022) Temporal resonant graph network for representation learning on dynamic graphs. Appl Intell 1–18

  9. Lu Y, Wang X, Shi C, Yu SP, Ye Y (2019) Temporal network embedding with micro- and macro-dynamics. In: Proceedings of the 28th ACM international conference on information and knowledge management, pp 469–478

  10. Zhou L, Yang Y, Ren X, Wu F, Zhuang Y (2018) Dynamic network embedding by modeling triadic closure process. In: Proceedings of the AAAI conference on artificial intelligence, vol. 32

  11. Xu D, Ruan C-W, Korpeoglu E, Kumar S, Achan K (2020) Inductive representation learning on temporal graphs. In: International conference on learning representations

  12. Sanchez-Gonzalez A, Heess N, Springenberg JT, Merel J, Riedmiller M, Hadsell R, Battaglia P (2018) Graph networks as learnable physics engines for inference and control. In: International conference on machine learning, pp 4470–4479

  13. Zuo Y, Liu G, Lin H, Guo J, Hu X, Wu J (2018) Embedding temporal network via neighborhood formation. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp 2857–2866

  14. Mohamadou Y, Halidou A, Kapen PT (2020) A review of mathematical modeling, artificial intelligence and datasets used in the study, prediction and management of covid-19. Appl Intell 50(11):3913–3925

    Article  Google Scholar 

  15. Yuan J, Shi J, Wang J, Liu W (2022) Modelling network public opinion polarization based on sir model considering dynamic network structure. Alex Eng J 61(6):4557–4571

    Article  Google Scholar 

  16. Zhu H, Kong Y, Wei J, Ma J (2018) Effect of users’ opinion evolution on information diffusion in online social networks. Physica A Stat Mech Appl 492:2034–2045

    Article  Google Scholar 

  17. Qiu L, Zhang J, Tian X (2021) Ranking influential nodes in complex networks based on local and global structures. Appl Intell 51:4394–4407

    Article  Google Scholar 

  18. Yu E-Y, Wang Y-P, Fu Y, Chen D-B, Xie M (2020) Identifying critical nodes in complex networks via graph convolutional networks. Knowl Based Syst 198:105893

    Article  Google Scholar 

  19. 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

    Article  Google Scholar 

  20. Xue G, Zhong M, Li J, Chen J, Zhai C, Kong R (2022) Dynamic network embedding survey. Neurocomputing 472:212–223

    Article  Google Scholar 

  21. Zhu D, Cui P, Zhang Z, Pei J, Zhu W (2018) High-order proximity preserved embedding for dynamic networks. IEEE Trans Knowl Data Eng 30(11):2134–2144

    Google Scholar 

  22. Wang X, Lu Y, Shi C, Wang R, Cui P, Mou S (2020) Dynamic heterogeneous information network embedding with meta-path based proximity. IEEE Trans Knowl Data Eng 34(3):1117–1132

    Article  Google Scholar 

  23. Nguyen GH, Lee JB, Rossi RA, Ahmed NK, Koh E, Kim S (2018) Continuous-time dynamic network embeddings. Companion proceedings of the the web conference 2018:969–976

    Google Scholar 

  24. Lee J, Lee I, Kang J (2019) Self-attention graph pooling. In: International conference on machine learning, pp 3734–3743

  25. Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser L, Polosukhin I (2017) Attention is all you need. In: Proceedings of the 31st international conference on neural information processing systems, pp 6000–6010

  26. Hawkes AG (1971) Spectra of some self-exciting and mutually exciting point processes. Biometrika 58(1):83–90

    Article  MathSciNet  MATH  Google Scholar 

  27. Kipf T, Fetaya E, Wang K-C, Welling M, Zemel R (2018) Neural relational inference for interacting systems. In: International conference on machine learning, pp 2688–2697

  28. Pareja A, Domeniconi G, Chen J, Ma T, Suzumura T, Kanezashi H, Kaler T, Schardl T, Leiserson C (2020) Evolvegcn: Evolving graph convolutional networks for dynamic graphs. Proceedings of the AAAI conference on artificial intelligence 34:5363–5370

    Article  Google Scholar 

  29. Trivedi R, Farajtabar M, Biswal P, Zha H (2019) Dyrep: Learning representations over dynamic graphs. In: International conference on learning representations

  30. 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–1035

  31. Marquardt DW (1963) An algorithm for least-squares estimation of nonlinear parameters. J Soc Ind Appl Math 11(2):431–441

    Article  MathSciNet  MATH  Google Scholar 

  32. Preusse J, Kunegis J, Thimm M, Staab S, Gottron T (2013) Structural dynamics of knowledge networks. Proceedings of the international AAAI conference on web and social media 7:506–515

    Article  Google Scholar 

  33. Tang J, Zhang J, Yao L, Li J, Zhang L, Su Z (2008) Arnetminer: extraction and mining of academic social networks. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 990–998

  34. Bjrnstad ON, Shea K, Krzywinski M, Altman N (2020) The seirs model for infectious disease dynamics. Nat Methods 17(6):557–558

  35. Wang X, Liu Z, Wang L, Guo C, Xiang H (2021) An application of a novel geometric criterion to global-stability problems of a nonlinear SEIVS epidemic model. J Appl Math Comput 67(1):707–730

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the Sichuan Province Science and Technology Program China (No. 2019YFSY0032)

Author information

Authors and Affiliations

  1. School of Computing and Artificial Intelligence, Southwest Jiaotong University, 611756, Sichuan, China

    Lei Wang, Yan Zhu & Qiang Peng

Authors
  1. Lei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yan Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qiang Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yan Zhu.

Ethics declarations

Conflict of Interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, L., Zhu, Y. & Peng, Q. TNSEIR: A SEIR pattern-based embedding approach for temporal network. Appl Intell 53, 24202–24216 (2023). https://doi.org/10.1007/s10489-023-04842-8

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-023-04842-8

Keywords

Search

Navigation