Recommendation Algorithm and Simulation Experiment Based on Graph Representation Learning

Abstract

Based on the GAN construction, the recommendation model in this paper preprocesses the interaction score between users and items, mines the implicit relationship embedding vector representation between users and items according to the user-item interaction bipartitic graph, extracts the explicit relationship between users and items from the graph, fuses the implicit relationship vector of nodes with the explicit relationship vector, and calculates the predictive score to obtain the recommendation result. Emphasis is placed on recessive relation extraction, dominant relation extraction and similarity calculation. The proposed model was verified by simulation experiments, including the construction of experimental environment, the selection of data sets, the design of evaluation indicators, the simulation experiment, and the analysis of experimental results. Compared with the best baseline model KGAT, the NDCG@5 index is improved by 2.31%. Compared with GraphRec, the worst baseline model, the RMGAT model improved the NDCG@5 index by 25.49%.

Authors

  • Junju Sun School of Information and Communication Engineering, Xinyang Vocational and Technical College, Xinyang 464000, China
  • Longlong Zhang School of Information and Communication Engineering, Xinyang Vocational and Technical College, Xinyang 464000, China

DOI:

https://doi.org/10.31449/inf.v50i6.8942

Downloads

Published

02/21/2026

How to Cite

Sun, J., & Zhang, L. (2026). Recommendation Algorithm and Simulation Experiment Based on Graph Representation Learning. Informatica, 50(6). https://doi.org/10.31449/inf.v50i6.8942