MétaCan
Menu
Back to cohort
Record W2400421776

Assessing Motivational Strategies in Serious Games Using Hidden Markov Models.

2013· article· en· W2400421776 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicIntelligent Tutoring Systems and Adaptive Learning
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsTUTORJudgementComputer sciencePsychological interventionHidden Markov modelIntervention (counseling)Human–computer interactionPsychologyArtificial intelligenceApplied psychology
DOInot available

Abstract

fetched live from OpenAlex

Recent research has extended tutor strategies to model not just interventions to offer information and activities, but also interventions to support learners ’ wills and motivation. It is important to investigate new ways, intertwined with learners ’ performance (successful completion of tasks) and judgement (self-report questionnaires), for evaluating tutor intervention strategies. One promising way is the use of physiological sensors. Within this paper, we study some motivational strategies that were implemented in a serious game called HeapMotiv to support learners ’ performance and motivation. We build several hidden Markov models which use Keller’s ARCS model of motivation and electrophysiological data (heart rate HR, skin conductance SC and EEG) and are able to identify physiological patterns correlated with different motivational strategies.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScholarly communication
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.896
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.004
Open science0.0000.000
Research integrity0.0000.000
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.047
GPT teacher head0.284
Teacher spread0.237 · 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