ArticlePloS one2025
A knowledge tracing approach with dual graph convolutional networks and positive/negative feature enhancement network.
Article in PloS one, 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.
- Hierarchical graph attention knowledge tracing and personalized recommendation for computer courses.Scientific reports · 2026Article
- Cognitive and skill acquisition trajectories in school-based music education: evidence from Chinese classrooms.Frontiers in psychology · 2026Article
- A Dual-Encoder Contrastive Learning Model for Knowledge Tracing.Entropy (Basel, Switzerland) · 2025Article
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
No grant is acknowledged in the PubMed record.
Abstract
Knowledge tracing models predict students' mastery of specific knowledge points by analyzing their historical learning performance. However, existing methods struggle with handling a large number of skills, data sparsity, learning differences, and complex skill correlations. To address these issues, we propose a knowledge tracing method based on dual graph convolutional networks and positive/negative feature enhancement. We construct dual graph structures with students and skills as nodes, respectively. The dual graph convolutional networks independently process the student and skill graphs, effectively resolving data sparsity and skill correlation challenges. By integrating positive/negative feature enhancement and spectral embedding clustering optimization modules, the model efficiently combines student and skill features, overcoming variations in learning performance. Experimental results on public datasets demonstrate that our proposed method outperforms existing approaches, showcasing significant advantages in handling complex learning data. This method provides new directions for educational data mining and personalized learning through innovative graph learning models and feature enhancement techniques.
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.