Abstract
Link prediction is a crucial task in graph analysis that aims to predict the existence of missing links in a graph. Graph embedding methods have gained popularity for link prediction by learning low-dimensional vector representations for nodes. However, most existing methods have not effectively utilized the graph structure and node attributes in attributed graphs. Additionally, higher-order neighborhood nodes that have high correlation with the source node are often disregarded. To address these issues, we propose an efficient graph embedding method called GSNA (\(\textbf{G}\)raph \(\textbf{S}\)tructure and \(\textbf{N}\)ode \(\textbf{A}\)ttributes), which effectively incorporates graph structure and node attributes to learn nodes representation for link prediction. Specifically, node sequences are generated using random walk, and then the nodes with high frequency are screened out. Then, the Top-N list of high-order neighborhood nodes with high correlation is obtained by calculating attribute similarities between nodes. Afterwards, a new graph is generated and passed through a multi-head attention mechanism to further learn the representations for link prediction tasks. Experiments conducted on several benchmark datasets demonstrate the effectiveness and efficiency of our proposed method for link prediction.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Halliwell, N.: Evaluating explanations of relational graph convolutional network link predictions on knowledge graphs. In: Thirty-Sixth AAAI Conference on Artificial Intelligence, pp. 12880–12881 (2022)
Wu, E., Cui, H., Chen, Z.: RelpNet: relation-based link prediction neural network. In: Proceedings of the 31st ACM International Conference on Information & Knowledge Management, pp. 2138–2147 (2022)
Baghershahi, P., Hosseini, R., Moradi, H.: Self-attention presents low-dimensional knowledge graph embeddings for link prediction. Knowl.-Based Syst. 260, 110124 (2023)
Song, Z., Zhang, Y., King, I.: Towards an optimal asymmetric graph structure for robust semi-supervised node classification. In: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1656–1665 (2022)
Chen, C., et al.: Vertically federated graph neural network for privacy-preserving node classification. In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI, pp. 1959–1965 (2022)
Lee, J., Oh, Y., In, Y., Lee, N., Hyun, D., Park, C.: GraFN: semi-supervised node classification on graph with few labels via non-parametric distribution assignment. In: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 2243–2248 (2022)
Jin, D., et al.: A survey of community detection approaches: from statistical modeling to deep learning. IEEE Trans. Knowl. Data Eng. 35(2), 1149–1170 (2023)
Ni, L., Xu, H., Zhang, Y., Luo, W.: Spatial-aware local community detection guided by dominance relation. IEEE Trans. Comput. Soc. Syst. 10(2), 686–699 (2023)
Wu, X., et al.: CLARE: a semi-supervised community detection algorithm. In: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2059–2069 (2022)
Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic, NIPS 2001, Vancouver, British Columbia, Canada, 3–8 December 2001], pp. 849–856 (2001)
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)
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)
Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013, pp. 3111–3119 (2013)
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, WWW 2015, Florence, Italy, 18–22 May 2015, pp. 1067–1077 (2015)
Cao, S., Lu, W., Xu, Q.: GraRep: learning graph representations with global structural information. In: Proceedings of the 24th ACM International Conference on Information and Knowledge Management, CIKM 2015, Melbourne, VIC, Australia, 19–23 October 2015, pp. 891–900 (2015)
Hamilton, W.L., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems, pp. 1024–1034 (2017)
Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., Bengio, Y.: Graph attention networks. In: 6th International Conference on Learning Representations, ICLR (2018)
Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic, NIPS 2001, Vancouver, British Columbia, Canada, 3–8 December 2001], pp. 585–591 (2001)
Roweis, S.T., Saul, L.K.: Nonlinear dimensionality reduction by locally linear embedding. Science 290, 2323–2326 (2000)
Ou, M., Cui, P., Pei, J., Zhang, Z., Zhu, W.: Asymmetric transitivity preserving graph embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1105–1114 (2016)
Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: 5th International Conference on Learning Representations, ICLR (2017)
Wang, D., Cui, P., Zhu, W.: Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1225–1234 (2016)
Wang, X., et al.: Heterogeneous graph attention network. In: The World Wide Web Conference, WWW, pp. 2022–2032 (2019)
Wang, H., et al.: A united approach to learning sparse attributed network embedding. In: IEEE International Conference on Data Mining, ICDM, pp. 557–566 (2018)
Kipf, T.N., Welling, M.: Variational graph auto-encoders. In: Advances in Neural Information Processing Systems, pp. 5591–5600 (2016)
Salha, G., Hennequin, R., Vazirgiannis, M.: Simple and effective graph autoencoders with one-hop linear models. In: Hutter, F., Kersting, K., Lijffijt, J., Valera, I. (eds.) ECML PKDD 2020. LNCS (LNAI), vol. 12457, pp. 319–334. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-67658-2_19
Acknowledgements
This work was supported in part by the National Natural Science Foundation of China under Grant U1811263 and the Science and Technology Program of Guangzhou, China under Grant 2023A04J1728.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Li, W., Tang, F., Chang, C., Zhong, H., Lin, R., Tang, Y. (2023). Efficient Graph Embedding Method for Link Prediction via Incorporating Graph Structure and Node Attributes. In: Zhang, F., Wang, H., Barhamgi, M., Chen, L., Zhou, R. (eds) Web Information Systems Engineering – WISE 2023. WISE 2023. Lecture Notes in Computer Science, vol 14306. Springer, Singapore. https://doi.org/10.1007/978-981-99-7254-8_33
Download citation
DOI: https://doi.org/10.1007/978-981-99-7254-8_33
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-7253-1
Online ISBN: 978-981-99-7254-8
eBook Packages: Computer ScienceComputer Science (R0)