Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1007/978-3-030-92185-9_35guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Dynamic Network Embedding by Time-Relaxed Temporal Random Walk

Published: 08 December 2021 Publication History

Abstract

Network embedding, also called network representation learning, aims at mapping high dimensional network information into low dimensional vectors. Previous studies mainly focus on static networks. In recent years, dynamic network embedding attracts much attention and methods specific to dynamic network are emerging. However, previous dynamic network embedding methods, such as CTDNE, still have drawbacks when using random walk to generate node sequences. Temporal random walk strictly requires that the time value of next edge be larger (i.e. later visiting) than that of the previous visited edge, which often leads to insufficient information obtained by random walk. In this article, a novel model named Time-Relaxed Temporal Random Walk(TxTWalk) for dynamic network embedding is proposed. Firstly, a time-relaxed function is designed, which enables random walk to select the next edge in a time interval, not strictly larger than the time of previously visited edge. It can make the walking sequences obtained by TxTWalk contain a wider range of temporal information. Then the node sequences are put into the skip-gram model for training to generate embedding of nodes on dynamic networks. Experimental validations on various networks demonstrate that TxTWalk is more effective than other state-of-the-art methods in link prediction.

References

[1]
Aggarwal, C., Subbian, K.: Evolutionary network analysis: a survey. ACM Comput. Surv. 47(1) (2014).
[2]
Ahmed, A., Shervashidze, N., Narayanamurthy, S., Josifovski, V., Smola, A.J.: Distributed large-scale natural graph factorization. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 37–48. WWW ’13, Association for Computing Machinery, New York, NY, USA (2013).
[3]
Belkin M and Niyogi P Laplacian eigenmaps for dimensionality reduction and data representation Neural Comput. 2003 15 6 1373-1396
[4]
Cao, S., Lu, W., Xu, Q.: Grarep: learning graph representations with global structural information. In: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, pp. 891–900. CIKM 2015, Association for Computing Machinery, New York, NY, USA (2015).
[5]
Opsahl T and Panzarasa P Clustering in weighted networks Soc. Netw. 2009 31 2 155-163
[6]
Fu, T.Y., Lee, W.C., Lei, Z.: Hin2vec: explore meta-paths in heterogeneous information networks for representation learning. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. p. 1797–1806. CIKM ’17, Association for Computing Machinery, New York, NY, USA (2017).
[7]
Godard, C., Mac Aodha, O., Firman, M., Brostow, G.J.: Digging into self-supervised monocular depth estimation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) (October 2019)
[8]
Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855–864 (2016)
[9]
Hamilton, W.L., Ying, R., Leskovec, J.: Inductive representation learning on large graphs. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 1025–1035 (2017)
[10]
Hisano, R.: Semi-supervised graph embedding approach to dynamic link prediction. In: Cornelius, S., Coronges, K., Gonçalves, B., Sinatra, R., Vespignani, A. (eds.) Complex Networks IX. CompleNet 2018. Springer Proceedings in Complexity, pp. 109–121. Springer, Cham (2018).
[11]
Li, J., Dani, H., Hu, X., Tang, J., Chang, Y., Liu, H.: Attributed network embedding for learning in a dynamic environment. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 387–396. CIKM 20017, Association for Computing Machinery, New York, NY, USA (2017).
[12]
Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space (2013)
[13]
Nguyen, G.H., Lee, J.B., Rossi, R.A., Ahmed, N.K., Koh, E., Kim, S.: Continuous-time dynamic network embeddings. In: Companion Proceedings of the The Web Conference 2018, pp. 969–976. WWW 2018, International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE (2018)
[14]
Opsahl, T.: Triadic closure in two-mode networks: redefining the global and local clustering coefficients. Soc. Netw. (2011)
[15]
Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701–710 (2014)
[16]
Panzarasa, P., Opsahl, T., Carley, K.M.: Patterns and dynamics of users’ behavior and interaction: network analysis of an online community. J. Am. Soc. Inf. Sci. Technol. (2009)
[17]
Provost, F., Fawcett, T.: Analysis and visualization of classifier performance: comparison under imprecise class and cost distributions. In: Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining, pp. 43–48 (1997)
[18]
Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). http://networkrepository.com
[19]
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1067–1077 (2015)
[20]
Xie, Y., Li, C., Yu, B., Zhang, C., Tang, Z.: A survey on dynamic network embedding. CoRR abs/2006.08093 (2020). https://arxiv.org/abs/2006.08093

Cited By

View all
  • (2022)Dynamic Network Embedding via Temporal Path Adjacency Matrix FactorizationProceedings of the 31st ACM International Conference on Information & Knowledge Management10.1145/3511808.3557302(1219-1228)Online publication date: 17-Oct-2022

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
Neural Information Processing: 28th International Conference, ICONIP 2021, Sanur, Bali, Indonesia, December 8–12, 2021, Proceedings, Part I
Dec 2021
718 pages
ISBN:978-3-030-92184-2
DOI:10.1007/978-3-030-92185-9

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 08 December 2021

Author Tags

  1. Network embedding
  2. Network representation learning
  3. Link prediction
  4. Random walk

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2022)Dynamic Network Embedding via Temporal Path Adjacency Matrix FactorizationProceedings of the 31st ACM International Conference on Information & Knowledge Management10.1145/3511808.3557302(1219-1228)Online publication date: 17-Oct-2022

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media