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%.DOI:
https://doi.org/10.31449/inf.v50i6.8942Downloads
Published
How to Cite
Issue
Section
License
Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.
All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.
Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.







