Abstract
One of the most effective and successful approaches to construct effective Euclidean representation of graphs, i.e., embedding, are based on random walks. This solution allows to learn a latent representation by capturing nodes similarities from a series of walk contexts while optimizing the likelihood of preserving their neighborhood in the Euclidean space. In this paper, we address the question of enhancing the existing random walks based methods by making the walk generation process aware of the global graph structure. To this end, we propose a node embedding method based on random walks guided by weights calculated considering a macro observation of the graph structure rather than a micro one. Experimental results on both synthetic and real-world networks show that our computed embedding allows to reach better accuracy rates on two tasks: node classification and link prediction.
Supported by Agence National de Recherche under Grant No ANR-20-CE23-0002.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
link to LFR benchmark: https://doi.org/10.5281/zenodo.4450167.
References
Ahmed, N., et al.: Role-based graph embeddings. IEEE Trans. Knowl. Data Eng. (2020)
Cai, H., Zheng, V., Chang, K.C.C.: A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans. Knowl. Data Eng. 30(9), 1616–1637 (2018)
Chandra, A.K., Raghavan, P., Ruzzo, W.L., Smolensky, R., Tiwari, P.: The electrical resistance of a graph captures its commute and cover times. Comput. Complex. 6(4), 312–340 (1997)
Doyle, P.G., Snell, J.L.: Random Walks and Electric Networks, vol. 22. American Mathematical Soc. (1984)
Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD, pp. 855–864. ACM (2016)
Hanley, J.A., McNeil, B.J.: The meaning and use of the area under a receiver operating characteristic (ROC) curve. Radiology 143(1), 29–36 (1982)
Jiao, P., et al.: A survey on role-oriented network embedding. IEEE Trans. Big Data (2021)
Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: 5th International Conference on Learning Representations (2017)
Leskovec, J., Sosič, R.: SNAP: a general-purpose network analysis and graph-mining library. ACM Trans. Intell. Syst. Technol. (TIST) 8(1), 1 (2016)
Meng, Z., Liang, S., Fang, J., Xiao, T.: Semi-supervisedly co-embedding attributed networks. In: Advances in Neural Information Processing Systems, vol. 32 (2019)
Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. In: 1st International Conference on Learning Representations (2013)
Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: The 20th ACM SIGKDD, pp. 701–710 (2014)
Perozzi, B., Kulkarni, V., Chen, H., Skiena, S.: Don’t walk, skip!: Online learning of multi-scale network embeddings. In: Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 258–265 (2017)
Spielman, D.A., Srivastava, N.: Graph sparsification by effective resistances. SIAM J. Comput. 40(6), 1913–1926 (2011)
Spielman, D.A., Teng, S.: A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning. SIAM J. Comput. 42(1), 1–26 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Gacem, A., Haddad, M., Seba, H., Berthe, G., Habib, M. (2022). Guiding Random Walks by Effective Resistance for Effective Node Embedding. In: El Yacoubi, M., Granger, E., Yuen, P.C., Pal, U., Vincent, N. (eds) Pattern Recognition and Artificial Intelligence. ICPRAI 2022. Lecture Notes in Computer Science, vol 13363. Springer, Cham. https://doi.org/10.1007/978-3-031-09037-0_54
Download citation
DOI: https://doi.org/10.1007/978-3-031-09037-0_54
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-09036-3
Online ISBN: 978-3-031-09037-0
eBook Packages: Computer ScienceComputer Science (R0)