TY - GEN
T1 - Online Education Recommendation Algorithm Based on Relationship Aware Heterogeneous Graph Neural Network
AU - Wang, Yanqi
AU - Sun, Na
AU - Wang, Chenxu
AU - Deng, Yufeng
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.
PY - 2026
Y1 - 2026
N2 - With the rapid development and digital transformation of online education, how to provide users with accurate personalized recommendations in the vast amount of educational resources has become an urgent problem to be solved. Traditional recommendation algorithms have shortcomings in capturing the complex and multi-level interactive relationships between students, teachers, and courses, which can easily lead to information overload and unsatisfactory recommendation results. This article proposes an online education recommendation algorithm based on relation aware heterogeneous graph neural network(RAHG-FKAN). This method first splits the global heterogeneous graph into a teacher centered graph and a course centered graph, capturing implicit relationships between students, teachers, and courses from different perspectives; Subsequently, the Fourier KAN module is introduced to map node features to the frequency domain and perform nonlinear feature transformation, constructing a dual tower structure to fuse fine-grained and coarse-grained information; Finally, feature fusion and personalized prediction are achieved using a shared multi-layer perceptron. The experiment verified on the MOOCCube dataset that this method significantly outperforms traditional models in terms of recommendation accuracy and efficiency, providing effective technical support for optimizing resource allocation and improving user experience on online education platforms.
AB - With the rapid development and digital transformation of online education, how to provide users with accurate personalized recommendations in the vast amount of educational resources has become an urgent problem to be solved. Traditional recommendation algorithms have shortcomings in capturing the complex and multi-level interactive relationships between students, teachers, and courses, which can easily lead to information overload and unsatisfactory recommendation results. This article proposes an online education recommendation algorithm based on relation aware heterogeneous graph neural network(RAHG-FKAN). This method first splits the global heterogeneous graph into a teacher centered graph and a course centered graph, capturing implicit relationships between students, teachers, and courses from different perspectives; Subsequently, the Fourier KAN module is introduced to map node features to the frequency domain and perform nonlinear feature transformation, constructing a dual tower structure to fuse fine-grained and coarse-grained information; Finally, feature fusion and personalized prediction are achieved using a shared multi-layer perceptron. The experiment verified on the MOOCCube dataset that this method significantly outperforms traditional models in terms of recommendation accuracy and efficiency, providing effective technical support for optimizing resource allocation and improving user experience on online education platforms.
KW - Dual-tower structure
KW - Fourier-KAN
KW - Heterogeneous graph neural network
KW - Online education recommendation
UR - https://www.scopus.com/pages/publications/105016905087
U2 - 10.1007/978-3-032-06310-6_3
DO - 10.1007/978-3-032-06310-6_3
M3 - 会议稿件
AN - SCOPUS:105016905087
SN - 9783032063090
T3 - Lecture Notes in Computer Science
SP - 36
EP - 48
BT - Cognitive Computing - ICCC 2025 - 9th International Conference, Held as Part of the Services Conference Federation, SCF 2025, Proceedings
A2 - Yang, Yujiu
A2 - Huang, Mengxing
A2 - Pan, Xiuqin
A2 - Zhang, Jiajia
A2 - Chen, Junyang
A2 - Zhang, Liang-Jie
PB - Springer Science and Business Media Deutschland GmbH
T2 - 9th International Conference on Cognitive Computing, ICCC 2025, Held as Part of the Services Conference Federation, SCF 2025
Y2 - 27 September 2025 through 30 September 2025
ER -