MétaCan
Menu
Back to cohort
Record W4321446334 · doi:10.3233/jifs-222627

Learning resource recommendation via knowledge graphs and learning style clustering

2023· article· en· W4321446334 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of Intelligent & Fuzzy Systems · 2023
Typearticle
Languageen
FieldComputer Science
TopicOnline Learning and Analytics
Canadian institutionsNipissing University
FundersNational Natural Science Foundation of China
KeywordsComputer scienceCluster analysisInterpretabilityMachine learningArtificial intelligenceInstance-based learningRecommender systemEmbeddingUnsupervised learning

Abstract

fetched live from OpenAlex

An e-learning system should recommend learners appropriate learning resources according to their actual needs and cognitive status for improving their learning performance. To overcome the deficiencies of existing approaches (e.g., poor interpretability, limited efficiency and accuracy of recommendation), we propose a new recommendation approach to learning resources via knowledge graphs and learning style clustering. In this approach, the knowledge graphs of an online learning environment are constructed based on a generic ontology model, and the graph embedding algorithm and graph matching process are applied to optimize the efficiency of graph computation for identifying similar learning resources. By introducing learning style theory, learners are clustered based on their learning styles. Based on the clustering results, the learners’ degrees of interest in similar learning resources are measured, and the recommendation results are obtained according to the degrees of interest. Finally, the experiments demonstrate that the proposed approach significantly enhances the computational efficiency and the quality of learning resource recommendation compared with the existing approaches in large-scale graph data scenarios.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.588
Threshold uncertainty score0.608

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.023
GPT teacher head0.285
Teacher spread0.262 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it