MétaCan
Menu
Back to cohort
Record W1537529093

Methods to find the number of latent skills

2012· article· en· W1537529093 on OpenAlexaff
Behzad Beheshti, Michel C. Desmarais, Rhouma Naceur

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicIntelligent Tutoring Systems and Adaptive Learning
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsSingular value decompositionTask (project management)Set (abstract data type)Computer scienceLatent variableFraction (chemistry)Latent semantic analysisArtificial intelligenceMachine learningEngineering
DOInot available

Abstract

fetched live from OpenAlex

Identifying the skills that determine the success or failure to exercises and question items is a difficult task. Multiple skills may be involved at various degree of importance. Skills may overlap and correlate. Slip and guess factors affect item outcome and depend on the profile of the student’s skill mastery and on item characteristics. In an effort towards the goal of finding the skills behind a set of items, we investigate two techniques to determine the number of salient latent skills. The Singular Value Decomposition (SVD) is a known technique to find latent factors. The singular values represent direct evidence of the strength of latent factors. Application of SVD to finding the number of latent skills is explored. A second technique is based on a wrapper approach. Linear models with different number of skills are built, and the one that yields the best prediction accuracy through cross validation is considered the most appropriate. The results show that both techniques are effective in identifying the latent factors of simulated data. Finally, an investigation with real data is reported. Both the SVD and wrapper methods yield results that have no simple interpretation, but one interpretation is consistent across the two methods, albeit not well aligned with the assessment of experts. 1.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.006
metaresearch head score (Gemma)0.026
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.007
Threshold uncertainty score0.031

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.026
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0040.003
Science and technology studies0.0010.001
Scholarly communication0.0020.002
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0070.003

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.033
GPT teacher head0.358
Teacher spread0.325 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations20
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicIntelligent Tutoring Systems and Adaptive LearningFrench-language works237,207