Comparison of Recommendation Models Based on GraphSAGE, Heterogeneous Graph Transformer and Heterogeneous Graph Attention Network for Educational Recommendation in Heterogeneous Knowledge Graphs

2025

Closed access Metadata (CSL-JSON)
DOI 10.1109/ubmk67458.2025.11207063
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

The article considers the problem of constructing personalized educational recommendations based on a heterogeneous knowledge graph that combines data from university curricula, vacancies, and online courses. To rank courses by relevance to the user’s competence, an approach based on heterogenous graph neural networks is proposed. The experiments were conducted on a heterogeneous graph that includes different types of nodes and edges. In the experimental study, the quality of the models was assessed using different metrics. The results showed the superiority of the recommendation model with the HGTConv layer on the link task weight prediction, especially in terms of ranking quality metrics, which indicates its suitability for building recommendations in educational systems. The presented approach can be used to develop adaptive recommendations in education focused on the user’s career goals.