Original title: A course recommendation method based on bidirectional fusion of graph convolution using knowledge graphs
Jingyi Hu, Yiwen Zhang, Xiqin Ao, Simeng Zhang +1 · September 2026
Online learning systems struggle to suggest the right courses when they have little data about new students or new classes. Many systems use a knowledge graphA structured network of connected facts, like courses linked to topics and instructors., which is a web of connected facts linking topics and courses, to help fill in these blanks. But most tools look at student interests or course topics separately instead of together. Researchers created a new system called KGCNA model that uses graph convolution to learn representations of items from their neighbors in a knowledge graph.-RN to fix this. It spreads a learner's past interests through the web of connections using a tool called RippleNetA method that propagates user preferences across a knowledge graph to find related items.. At the same time, it gathers related topics around each course. By combining both sides, it improves understanding of both learners and courses. Tests showed it beat or matched standard methods at predicting and ranking useful courses.
Imagine deciding what to cook for a dinner party. You know your guests' tastes and the ingredients in your pantry. If you only consider one side, you might miss a great dish. In this paper, the system combines both: it propagates user preferences through a knowledge graph of courses and aggregates course semantics from neighboring entities. This bidirectional fusion improves recommendations.
Students often struggle to find relevant courses, especially when they are new to a platform. This method improves recommendation accuracy by combining what a learner likes with what courses actually cover. That means fewer irrelevant suggestions and better course discovery for everyone.
The abstract doesn't explicitly state limitations, but it only evaluates on the MOOCCube dataset, so generalizability to other domains is not established. It also does not discuss computational cost or scalability.
Ask anything about this paper. Answers come from its abstract, and say so when the abstract doesn't cover your question.
A course recommendation method based on bidirectional fusion of graph convolution using knowledge graphs — Jingyi Hu, Yiwen Zhang, Xiqin Ao et al. — Scientific Reports — doi:10.1038/s41598-026-72215-5
Abstract licence: CC BY
Explanation generated by Synthesis from the abstract — it is not the original paper.