ArticleScientific reports2025
Knowledge graph convolutional networks with user preferences for course recommendation.
Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
3 citing papers in PubMed.
- Dual-adaptive imputation graph neural network for knowledge-aware recommendation.Scientific reports · 2026Article
- Relation-aware context aggregation framework for sparse knowledge graph completion.Scientific reports · 2026Article
- A multi-task heterogeneous graph learning with cross-attention fusion for robust recommendation.Scientific reports · 2026Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
Abstract
With the rapid growth of the internet and online education resources, the number of massive open online courses (MOOCs) has increased dramatically, making it difficult for users to find personalized courses that meet their needs. Knowledge graphs (KGs) have been employed in recommendation systems to effectively address the issue of sparse interaction data in the MOOC scenarios for their rich semantic information. Research on KG-enhanced recommendation algorithms has found that the utilization of side information in KGs is crucial for improving accuracy. This paper introduces KGCN-UP (Knowledge Graph Convolutional Networks with User Preferences), a novel model for predicting the likelihood of a user interacting with a course based on user preferences and item relationships within a knowledge graph. The KGCN-UP model consists of two key modules. First, the user preference propagation module refines user preferences by exploring relational chains in the knowledge graph and dynamically adjusting attention to improve user representation. Second, the item neighbor enhancement module enhances item representations by aggregating semantic relationships and assigning attention weights based on the type of relationship between entities. Together, these components address the challenge of data sparsity and improve the quality of recommendations by leveraging high-order structural and semantic information. Empirical results on a real-world dataset demonstrate that KGCN-UP significantly outperforms existing state-of-the-art recommendation models in terms of accuracy.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.