MétaCan
Menu
Back to cohort
Record W2230887875 · doi:10.1080/10888438.2015.1107073

The Random Forests statistical technique: An examination of its value for the study of reading

2016· article· en· W2230887875 on OpenAlexafffund
Kazunaga Matsuki, Victor Kuperman, Julie A. Van Dyke

Bibliographic record

VenueScientific Studies of Reading · 2016
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Text Analysis Techniques
Canadian institutionsMcMaster University
FundersEunice Kennedy Shriver National Institute of Child Health and Human DevelopmentNational Institute of Child Health and Human DevelopmentSocial Sciences and Humanities Research Council of CanadaNatural Sciences and Engineering Research Council of Canada
KeywordsReading (process)Computer scienceRandom forestStatistical analysisValue (mathematics)StatisticsArtificial intelligenceMachine learningMathematicsLinguistics

Abstract

fetched live from OpenAlex

Studies investigating individual differences in reading ability often involve data sets containing a large number of collinear predictors and a small number of observations. In this paper, we discuss the method of Random Forests and demonstrate its suitability for addressing the statistical concerns raised by such datasets. The method is contrasted with other methods of estimating relative variable importance, especially Dominance Analysis and Multimodel Inference. All methods were applied to a dataset that gauged eye-movements during reading and offline comprehension in the context of multiple ability measures with high collinearity due to their shared verbal core. We demonstrate that the Random Forests method surpasses other methods in its ability to handle model overfitting, and accounts for a comparable or larger amount of variance in reading measures relative to other methods.

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.116
metaresearch head score (Gemma)0.244
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch
Consensus categoriesnone
DomainCandidate signal: Methods · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.884
Threshold uncertainty score0.612

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.1160.244
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0060.006
Science and technology studies0.0020.003
Scholarly communication0.0020.004
Open science0.0020.002
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0020.001

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.367
Teacher spread0.320 · 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.

Study designTheoretical or conceptual
DomainMethods
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

Citations168
Published2016
Admission routes2
Has abstractyes

Explore more

Same venueScientific Studies of ReadingSame topicAdvanced Text Analysis TechniquesFrench-language works237,207